AlgorithmicsandApplicationsofTreeandGraphSearchin.pptVIP

Extension to Trees Pathfix algorithm Phase 1: Encodes each root-to-leaf path of every data tree into a suffix array DB Phase 2: Compares the query tree Q with each data tree D in the DB allowing a difference of DIFF Implementation ATreeGrep Graphs Graphs Abstract data type of elements (nodes or vertices) interconnected by edges. A graph is a specialized tree in which there is no constraint on the number of paths is possible from a node No root Graph may contain cycles Keygraph Searching Searching for a particular graph or order of elements inside of a large graph (i.e. internet) Searching for a particular graph or structure among several graphs (i.e. chemical elements) Use indexing to reduce complexity Keygraph Searching Three basic steps Reduce the search space by filtering Formulate query into simple structures Match Keygraph Searching (survey) A* algorithm GraphDB Daylight Lore A* Seminal work by Nilson (1980) Route finding algorithm that keeps track of its visited nodes and the distance it has traveled.? Applications: ??? ??? Protein databases (discovery and search)??? ??? Image databases??? ??? Chinese character databases??? ??? CAD circuit data and software source code A* Pseudocode??? ??? function A*(start,goal)??? ??? ??? var closed := the empty set??? ??? ??? var q := make_queue(path(start))??? ??? ??? while q is not empty??? ??? ??????? var p := remove_first(q) ??? ??? ??????? var x := the last node of p??? ??? ??????? if x in closed??? ??? ??????????? continue??? ??? ??????? if x = goal??? ??? ??????????? return p??? ??? ??????? add x to closed??? ??? ??????? foreach y in successors(x) ??? ??? ??????????? enqueue(q, p, y)??? ??? ??? return failure GraphDB Specifies a data model and query model. Queries are in the form of regular expressions??? ??? Nodes are classes representing data objects??? Edges are classes to store paths in the database ? ??? Path classes are and indexing data structures are used to index database Provi