Atlanta, GA, USA
April 3, 2006 to April 7, 2006
Huahai He , University of California, Santa Barbara
Ambuj K. Singh , University of California, Santa Barbara
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.37
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. We introduce the concept of a graph closure, a generalized graph that represents a number of graphs. Our indexing technique, called Closure-tree, organizes graphs hierarchically where each node summarizes its descendants by a graph closure. Closure-tree can efficiently support both subgraph queries and similarity queries. Subgraph queries find graphs that contain a specific subgraph, whereas similarity queries find graphs that are similar to a query graph. For subgraph queries, we propose a technique called pseudo subgraph isomorphism which approximates subgraph isomorphism with high accuracy. For similarity queries, we measure graph similarity through edit distance using heuristic graph mapping methods. We implement two kinds of similarity queries: K-NN query and range query. Our experiments on chemical compounds and synthetic graphs show that for subgraph queries, Closuretree outperforms existing techniques by up to two orders of magnitude in terms of candidate answer set size and index size. For similarity queries, our experiments validate the quality and efficiency of the presented algorithms.
Huahai He, Ambuj K. Singh, "Closure-Tree: An Index Structure for Graph Queries", ICDE, 2006, 22nd International Conference on Data Engineering, 22nd International Conference on Data Engineering 2006, pp. 38, doi:10.1109/ICDE.2006.37