Graph Reachability Queries: A Survey

There are numerous applications that need to deal with a large graph, including bioinformatics, social science, link analysis, citation analysis, and collaborative networks. A fundamental query is to query whether a node is reachable from another node in a large graph, which is called a reachability query. In this survey, we discuss several existing approaches to process reachability queries. In addition, we will discuss how to answer reachability queries with the shortest distance, and graph pattern matching over a large graph.

[1]  Jianzhong Li,et al.  Hash-base subgraph query processing method for graph-structured XML documents , 2008, Proc. VLDB Endow..

[2]  Jeffrey Xu Yu,et al.  On-line exact shortest distance query processing , 2009, EDBT '09.

[3]  Dan Brickley,et al.  Resource description framework (RDF) schema specification , 1998 .

[4]  H. V. Jagadish,et al.  A compression technique to materialize transitive closure , 1990, TODS.

[5]  Jeffrey Xu Yu,et al.  Optimizing updates of recursive XML views of relations , 2009, The VLDB Journal.

[6]  Steven J. DeRose,et al.  XML Pointer Language (XPointer) Version 1. 0. World Wide Web Consortium, Working Draft WD - xptr - 2 , 2001 .

[7]  Klaus Simon,et al.  An Improved Algorithm for Transitive Closure on Acyclic Digraphs , 1986, Theor. Comput. Sci..

[8]  Li Chen,et al.  Stack-based Algorithms for Pattern Matching on DAGs , 2005, VLDB.

[9]  Philip S. Yu,et al.  Fast Graph Pattern Matching , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[10]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[11]  Jeffrey Xu Yu,et al.  Fast Reachability Query Processing , 2006, DASFAA.

[12]  Steven J. DeRose,et al.  Xml pointer language (xpointer) version 1 , 2001 .

[13]  Philip S. Yu,et al.  Compact reachability labeling for graph-structured data , 2005, CIKM '05.

[14]  Philip S. Yu,et al.  Fast computing reachability labelings for large graphs with high compression rate , 2008, EDBT '08.

[15]  Yang Xiang,et al.  Efficiently answering reachability queries on very large directed graphs , 2008, SIGMOD Conference.

[16]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[17]  Yang Xiang,et al.  3-HOP: a high-compression indexing scheme for reachability query , 2009, SIGMOD Conference.

[18]  S. Wodak,et al.  Representing and Analysing Molecular and Cellular Function Using the Computer , 2000, Biological chemistry.

[19]  Steven J. DeRose,et al.  Xml linking language (xlink), version 1. 0 , 2000, WWW 2000.

[20]  Philip S. Yu,et al.  Fast Computation of Reachability Labeling for Large Graphs , 2006, EDBT.

[21]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[22]  Gerhard Weikum,et al.  Efficient creation and incremental maintenance of the HOPI index for complex XML document collections , 2005, 21st International Conference on Data Engineering (ICDE'05).

[23]  Gerhard Weikum,et al.  HOPI: An Efficient Connection Index for Complex XML Document Collections , 2004, EDBT.

[24]  Philip S. Yu,et al.  Dual Labeling: Answering Graph Reachability Queries in Constant Time , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[25]  Jianzhong Li,et al.  Labeling Scheme and Structural Joins for Graph-Structured XML Data , 2005, APWeb.

[26]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[27]  Ulf Leser,et al.  Fast and practical indexing and querying of very large graphs , 2007, SIGMOD '07.

[28]  Byron Choi,et al.  On incremental maintenance of 2-hop labeling of graphs , 2008, WWW.

[29]  Yangjun Chen,et al.  An Efficient Algorithm for Answering Graph Reachability Queries , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[30]  Jeffrey Xu Yu,et al.  Cost-Based Query Optimization for Multi Reachability Joins , 2007, DASFAA.

[31]  Uri Zwick,et al.  A fully dynamic reachability algorithm for directed graphs with an almost linear update time , 2004, STOC '04.

[32]  Myra Spiliopoulou,et al.  Analysis of navigation behaviour in web sites integrating multiple information systems , 2000, The VLDB Journal.

[33]  Dan Suciu,et al.  A query language for a Web-site management system , 1997, SGMD.

[34]  Amit P. Sheth,et al.  Ρ-Queries: enabling querying for semantic associations on the semantic web , 2003, WWW '03.