aboutsummaryrefslogtreecommitdiff
path: root/backend/cgi-bin
diff options
context:
space:
mode:
Diffstat (limited to 'backend/cgi-bin')
-rwxr-xr-xbackend/cgi-bin/data.py320
1 files changed, 320 insertions, 0 deletions
diff --git a/backend/cgi-bin/data.py b/backend/cgi-bin/data.py
new file mode 100755
index 0000000..05ed81b
--- /dev/null
+++ b/backend/cgi-bin/data.py
@@ -0,0 +1,320 @@
+#!/usr/bin/python3
+
+import sys, os.path, re, time
+import urllib.parse
+import sqlite3
+import gzip, jsonpickle
+
+dbFile = "data/data.db"
+imgDir = "data/img/"
+DEFAULT_SUGG_LIM = 5
+MAX_SUGG_LIM = 50
+CORS_ANY_ORIGIN = True # Used during development to avoid Cross-Origin Resource Sharing restrictions
+
+usageInfo = f"""
+Usage: {sys.argv[0]}
+
+CGI script that provides tree-of-life data, in JSON form.
+
+Query parameters:
+- name: Provides a name, or partial name, of a tree-of-life node. If absent, the root node is used.
+- type: Specifies what data to reply with.
+ If 'node', reply with a name-to-TolNode map, describing the named node and it's children.
+ If 'sugg', reply with a SearchSuggResponse, describing search suggestions for the possibly-partial name.
+ If 'info', reply with an InfoResponse, describing the named node.
+- toroot: Used with type=node, and causes inclusion of nodes upward to the root, and their children.
+ If specified, the value should be 'true'.
+- limit: Used with type=sugg to specify the max number of suggestions.
+- rtree: Specifies whether the reduced tree should be used.
+ If specified, the value should be 'true'.
+"""
+if len(sys.argv) > 1:
+ print(usageInfo, file=sys.stderr)
+ sys.exit(1)
+
+# Classes for objects sent as responses (matches lib.ts types in client-side code)
+class TolNode:
+ " Used when responding to 'node' and 'chain' requests "
+ def __init__(self, otolId, children, parent=None, tips=0, pSupport=False, commonName=None, imgName=None):
+ self.otolId = otolId # string | null
+ self.children = children # string[]
+ self.parent = parent # string | null
+ self.tips = tips # number
+ self.pSupport = pSupport # boolean
+ self.commonName = commonName # null | string
+ self.imgName = imgName # null | string | [string,string] | [null, string] | [string, null]
+class SearchSugg:
+ " Represents a search suggestion "
+ def __init__(self, name, canonicalName=None):
+ self.name = name # string
+ self.canonicalName = canonicalName # string | null
+class SearchSuggResponse:
+ " Sent as responses to 'sugg' requests "
+ def __init__(self, searchSuggs, hasMore):
+ self.suggs = searchSuggs # SearchSugg[]
+ self.hasMore = hasMore # boolean
+class DescInfo:
+ " Represents a node's associated description "
+ def __init__(self, text, wikiId, fromRedirect, fromDbp):
+ self.text = text # string
+ self.wikiId = wikiId # number
+ self.fromRedirect = fromRedirect # boolean
+ self.fromDbp = fromDbp # boolean
+class ImgInfo:
+ " Represents a node's associated image "
+ def __init__(self, id, src, url, license, artist, credit):
+ self.id = id # number
+ self.src = src # string
+ self.url = url # string
+ self.license = license # string
+ self.artist = artist # string
+ self.credit = credit # string
+class NodeInfo:
+ " Represents info about a node "
+ def __init__(self, tolNode, descInfo, imgInfo):
+ self.tolNode = tolNode # TolNode
+ self.descInfo = descInfo # null | DescInfo
+ self.imgInfo = imgInfo # null | ImgInfo
+class InfoResponse:
+ " Sent as responses to 'info' requests "
+ def __init__(self, nodeInfo, subNodesInfo = None):
+ self.nodeInfo = nodeInfo # NodeInfo
+ self.subNodesInfo = subNodesInfo # [] | [NodeInfo, NodeInfo]
+
+# For data lookup
+def lookupNodes(names, useReducedTree, dbCur):
+ " For a set of node names, returns a name-to-TolNode map that describes those nodes "
+ # Get node info
+ nameToNodes = {}
+ nodesTable = "nodes" if not useReducedTree else "r_nodes"
+ edgesTable = "edges" if not useReducedTree else "r_edges"
+ queryParamStr = ",".join(["?"] * len(names))
+ query = f"SELECT name, id, tips FROM {nodesTable} WHERE name IN ({queryParamStr})"
+ for (nodeName, otolId, tips) in dbCur.execute(query, names):
+ nameToNodes[nodeName] = TolNode(otolId, [], tips=tips)
+ # Get child info
+ query = f"SELECT parent, child FROM {edgesTable} WHERE parent IN ({queryParamStr})"
+ for (nodeName, childName) in dbCur.execute(query, names):
+ nameToNodes[nodeName].children.append(childName)
+ # Order children by tips
+ for (nodeName, node) in nameToNodes.items():
+ childToTips = {}
+ query = "SELECT name, tips FROM {} WHERE name IN ({})"
+ query = query.format(nodesTable, ",".join(["?"] * len(node.children)))
+ for (n, tips) in dbCur.execute(query, node.children):
+ childToTips[n] = tips
+ node.children.sort(key=lambda n: childToTips[n], reverse=True)
+ # Get parent info
+ query = f"SELECT parent, child, p_support FROM {edgesTable} WHERE child IN ({queryParamStr})"
+ for (nodeName, childName, pSupport) in dbCur.execute(query, names):
+ nameToNodes[childName].parent = nodeName
+ nameToNodes[childName].pSupport = (pSupport == 1)
+ # Get image names
+ idsToNames = {nameToNodes[n].otolId: n for n in nameToNodes.keys()}
+ query = "SELECT nodes.id from nodes INNER JOIN node_imgs ON nodes.name = node_imgs.name" \
+ " WHERE nodes.id IN ({})".format(",".join(["?"] * len(idsToNames)))
+ for (otolId,) in dbCur.execute(query, list(idsToNames.keys())):
+ nameToNodes[idsToNames[otolId]].imgName = otolId + ".jpg"
+ # Get 'linked' images for unresolved names
+ unresolvedNames = [n for n in nameToNodes if nameToNodes[n].imgName == None]
+ query = "SELECT name, otol_ids from linked_imgs WHERE name IN ({})"
+ query = query.format(",".join(["?"] * len(unresolvedNames)))
+ for (name, otolIds) in dbCur.execute(query, unresolvedNames):
+ if "," not in otolIds:
+ nameToNodes[name].imgName = otolIds + ".jpg"
+ else:
+ id1, id2 = otolIds.split(",")
+ nameToNodes[name].imgName = [
+ id1 + ".jpg" if id1 != "" else None,
+ id2 + ".jpg" if id2 != "" else None,
+ ]
+ # Get preferred-name info
+ query = f"SELECT name, alt_name FROM names WHERE pref_alt = 1 AND name IN ({queryParamStr})"
+ for (name, altName) in dbCur.execute(query, names):
+ nameToNodes[name].commonName = altName
+ #
+ return nameToNodes
+def lookupSuggs(searchStr, suggLimit, useReducedTree, dbCur):
+ " For a search string, returns a SearchSuggResponse describing search suggestions "
+ results = []
+ hasMore = False
+ # Get node names and alt-names
+ query1, query2 = (None, None)
+ if not useReducedTree:
+ query1 = "SELECT DISTINCT name FROM nodes" \
+ " WHERE name LIKE ? AND name NOT LIKE '[%' ORDER BY length(name) LIMIT ?"
+ query2 = "SELECT DISTINCT alt_name, name FROM names" \
+ " WHERE alt_name LIKE ? ORDER BY length(alt_name) LIMIT ?"
+ else:
+ query1 = "SELECT DISTINCT name FROM r_nodes" \
+ " WHERE name LIKE ? AND name NOT LIKE '[%' ORDER BY length(name) LIMIT ?"
+ query2 = "SELECT DISTINCT alt_name, names.name FROM" \
+ " names INNER JOIN r_nodes ON names.name = r_nodes.name" \
+ " WHERE alt_name LIKE ? ORDER BY length(alt_name) LIMIT ?"
+ # Join results, and get shortest
+ suggs = []
+ for (nodeName,) in dbCur.execute(query1, (searchStr + "%", suggLimit + 1)):
+ suggs.append(SearchSugg(nodeName))
+ for (altName, nodeName) in dbCur.execute(query2, (searchStr + "%", suggLimit + 1)):
+ suggs.append(SearchSugg(altName, nodeName))
+ # If insufficient results, try substring-search
+ foundNames = {n.name for n in suggs}
+ if len(suggs) < suggLimit:
+ newLim = suggLimit + 1 - len(suggs)
+ for (nodeName,) in dbCur.execute(query1, ("%" + searchStr + "%", newLim)):
+ if nodeName not in foundNames:
+ suggs.append(SearchSugg(nodeName))
+ foundNames.add(nodeName)
+ if len(suggs) < suggLimit:
+ newLim = suggLimit + 1 - len(suggs)
+ for (altName, nodeName) in dbCur.execute(query2, ("%" + searchStr + "%", suggLimit + 1)):
+ if altName not in foundNames:
+ suggs.append(SearchSugg(altName, nodeName))
+ foundNames.add(altName)
+ # Sort results
+ suggs.sort(key=lambda x: x.name)
+ suggs.sort(key=lambda x: len(x.name))
+ # Apply suggestion-quantity limit
+ results = suggs[:suggLimit]
+ if len(suggs) > suggLimit:
+ hasMore = True
+ #
+ return SearchSuggResponse(results, hasMore)
+def lookupInfo(name, useReducedTree, dbCur):
+ " For a node name, returns an InfoResponse, or None "
+ # Get node info
+ nameToNodes = lookupNodes([name], useReducedTree, dbCur)
+ tolNode = nameToNodes[name] if name in nameToNodes else None
+ if tolNode == None:
+ return None
+ # Check for compound node
+ match = re.fullmatch(r"\[(.+) \+ (.+)]", name)
+ subNames = [match.group(1), match.group(2)] if match != None else []
+ if len(subNames) > 0:
+ nameToSubNodes = lookupNodes(subNames, useReducedTree, dbCur)
+ if len(nameToSubNodes) < 2:
+ print(f"ERROR: Unable to find sub-names entries for {name}", file=sys.stderr)
+ return None
+ nameToNodes.update(nameToSubNodes)
+ namesToLookup = [name] if len(subNames) == 0 else subNames
+ # Get desc info
+ nameToDescInfo = {}
+ query = "SELECT name, desc, wiki_id, redirected, from_dbp FROM" \
+ " wiki_ids INNER JOIN descs ON wiki_ids.id = descs.wiki_id" \
+ " WHERE wiki_ids.name IN ({})".format(",".join(["?"] * len(namesToLookup)))
+ for (nodeName, desc, wikiId, redirected, fromDbp) in dbCur.execute(query, namesToLookup):
+ nameToDescInfo[nodeName] = DescInfo(desc, wikiId, redirected == 1, fromDbp == 1)
+ # Get image info
+ nameToImgInfo = {}
+ idsToNames = {nameToNodes[n].imgName[:-4]: n for n in namesToLookup if nameToNodes[n].imgName != None}
+ idsToLookup = list(idsToNames.keys()) # Lookup using IDs avoids having to check linked_imgs
+ query = "SELECT nodes.id, images.id, images.src, url, license, artist, credit FROM" \
+ " nodes INNER JOIN node_imgs ON nodes.name = node_imgs.name" \
+ " INNER JOIN images ON node_imgs.img_id = images.id AND node_imgs.src = images.src" \
+ " WHERE nodes.id IN ({})".format(",".join(["?"] * len(idsToLookup)))
+ for (id, imgId, imgSrc, url, license, artist, credit) in dbCur.execute(query, idsToLookup):
+ nameToImgInfo[idsToNames[id]] = ImgInfo(imgId, imgSrc, url, license, artist, credit)
+ # Construct response
+ nodeInfoObjs = [
+ NodeInfo(
+ nameToNodes[n],
+ nameToDescInfo[n] if n in nameToDescInfo else None,
+ nameToImgInfo[n] if n in nameToImgInfo else None
+ ) for n in [name] + subNames
+ ]
+ return InfoResponse(nodeInfoObjs[0], nodeInfoObjs[1:])
+
+# For handling request
+def respondJson(val):
+ content = jsonpickle.encode(val, unpicklable=False).encode("utf-8")
+ print("Content-type: application/json")
+ if "HTTP_ACCEPT_ENCODING" in os.environ and "gzip" in os.environ["HTTP_ACCEPT_ENCODING"]:
+ if len(content) > 100:
+ content = gzip.compress(content, compresslevel=5)
+ print(f"Content-length: {len(content)}")
+ print(f"Content-encoding: gzip")
+ if CORS_ANY_ORIGIN:
+ print("Access-Control-Allow-Origin: *")
+ print()
+ sys.stdout.flush()
+ sys.stdout.buffer.write(content)
+def handleReq(dbCur):
+ # Get query params
+ queryStr = os.environ["QUERY_STRING"] if "QUERY_STRING" in os.environ else ""
+ queryDict = urllib.parse.parse_qs(queryStr)
+ # Set vars from params
+ name = queryDict["name"][0] if "name" in queryDict else None
+ if name == None: # Get root node
+ query = "SELECT name FROM nodes LEFT JOIN edges ON nodes.name = edges.child WHERE edges.parent IS NULL LIMIT 1"
+ (name,) = dbCur.execute(query).fetchone()
+ reqType = queryDict["type"][0] if "type" in queryDict else None
+ useReducedTree = "rtree" in queryDict and queryDict["rtree"][0] == "true"
+ # Get data of requested type
+ if reqType == "node":
+ toroot = "toroot" in queryDict and queryDict["toroot"][0] == "true"
+ if not toroot:
+ tolNodes = lookupNodes([name], useReducedTree, dbCur)
+ if len(tolNodes) > 0:
+ tolNode = tolNodes[name]
+ childNodeObjs = lookupNodes(tolNode.children, useReducedTree, dbCur)
+ childNodeObjs[name] = tolNode
+ respondJson(childNodeObjs)
+ return
+ else:
+ results = {}
+ ranOnce = False
+ while True:
+ # Get node
+ tolNodes = lookupNodes([name], useReducedTree, dbCur)
+ if len(tolNodes) == 0:
+ if not ranOnce:
+ respondJson(results)
+ return
+ print(f"ERROR: Parent-chain node {name} not found", file=sys.stderr)
+ break
+ tolNode = tolNodes[name]
+ results[name] = tolNode
+ # Potentially add children
+ if not ranOnce:
+ ranOnce = True
+ else:
+ childNamesToAdd = []
+ for childName in tolNode.children:
+ if childName not in results:
+ childNamesToAdd.append(childName)
+ childNodeObjs = lookupNodes(childNamesToAdd, useReducedTree, dbCur)
+ results.update(childNodeObjs)
+ # Check if root
+ if tolNode.parent == None:
+ respondJson(results)
+ return
+ else:
+ name = tolNode.parent
+ elif reqType == "sugg":
+ # Check for suggestion-limit
+ suggLimit = None
+ invalidLimit = False
+ try:
+ suggLimit = int(queryDict["limit"][0]) if "limit" in queryDict else DEFAULT_SUGG_LIM
+ if suggLimit <= 0 or suggLimit > MAX_SUGG_LIM:
+ invalidLimit = True
+ except ValueError:
+ invalidLimit = True
+ print(f"INFO: Invalid limit {suggLimit}", file=sys.stderr)
+ # Get search suggestions
+ if not invalidLimit:
+ respondJson(lookupSuggs(name, suggLimit, useReducedTree, dbCur))
+ return
+ elif reqType == "info":
+ infoResponse = lookupInfo(name, useReducedTree, dbCur)
+ if infoResponse != None:
+ respondJson(infoResponse)
+ return
+ # On failure, provide empty response
+ respondJson(None)
+
+# Open db
+dbCon = sqlite3.connect(dbFile)
+dbCur = dbCon.cursor()
+# Handle request
+handleReq(dbCur)