Skip to main content
SpringerLink
Log in

Graph Reachability Queries: A Survey

  • Chapter
  • First Online:
Managing and Mining Graph Data

Part of the book series: Advances in Database Systems ((ADBS,volume 40))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In Proceedings of the 1989 ACM SIGMOD international conference on Management of data (SIGMOD 1989), 1989.

    Google Scholar 

  2. K. Anyanwu and A. Sheth. ρ-queries: enabling querying for semantic associations on the semantic web. In Proceedings of the 12th international conference on World Wide Web (WWW 2003), 2003.

    Google Scholar 

  3. B. Berendt and M. Spiliopoulou. Analysis of navigation behaviour in web sites integrating multiple information systems. The VLDB Journal, 9(1), 2000.

    Google Scholar 

  4. R. Bramandia, J. Cheng, B. Choi, and J. X. Yu. Updating recursive XML views without transitive closure. To appear in VLDB J., 2009.

    Google Scholar 

  5. R. Bramandia, B. Choi, and W. K. Ng. On incremental maintenance of 2-hop labeling of graphs. In Proceedings of the 17th international conference on World Wide Web (WWW 2008), 2008.

    Google Scholar 

  6. D. Brickley and R. V. Guha. Resource Description Framework (RDF) Schema Specification 1.0. W3C Recommendation, 2000.

    Google Scholar 

  7. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. In Proceedings of the 2002 ACM SIGMOD international conference on Management of data (SIGMOD 2002), 2002.

    Google Scholar 

  8. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In Proceedings of the 31nd international conference on Very large data bases (VLDB 2005), 2005.

    Google Scholar 

  9. Y. Chen and Y. Chen. An efficient algorithm for answering graph reachability queries. In Proceedings of the 24th International Conference on Data Engineering (ICDE 2008), 2008.

    Google Scholar 

  10. J. Cheng and J. X. Yu. On-line exact shortest distance query processing. In Proceedings of the 12th International Conference on Extending Database Technology (EDBT 2009), 2009.

    Google Scholar 

  11. J. Cheng, J. X. Yu, and B. Ding. Cost-based query optimization for multi reachability joins. In Proceedings of the 12th International Conference on Database Systems for Advanced Applications (DASFAA 2007), 2007.

    Google Scholar 

  12. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In Proceedings of the 24th International Conference on Data Engineering (ICDE 2008).

    Google Scholar 

  13. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In Proceedings of the 10th International Conference on Extending Database Technology (EDBT 2006), 2006.

    Google Scholar 

  14. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computing reachability labelings for large graphs with high compression rate. In Proceedings of the 11th International Conference on Extending Database Technology (EDBT 2008), 2008.

    Google Scholar 

  15. J. Cheng, J. X. Yu, and N. Tang. Fast reachability query processing. In Proceedings of the 11th International Conference on Database Systems for Advanced Applications (DASFAA 2006), 2006.

    Google Scholar 

  16. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396–1400, 1965.

    MATH  Google Scholar 

  17. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms (SODA 2002), 2002.

    Google Scholar 

  18. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 2001.

    Google Scholar 

  19. S. DeRose, E. Maler, and D. Orchard. XML linking language (XLink) version 1.0. 2001.

    Google Scholar 

  20. S. DeRose, E. Maler, and D. Orchard. XML pointer language (XPointer) version 1.0. 2001.

    Google Scholar 

  21. J. Edmonds. Optimum branchings. J. Research of the National Bureau of Standards, 71B:233–240, 1967.

    MathSciNet  Google Scholar 

  22. Fernandez, D. Florescu, A. Levy, and D. Suciu. A query language for a web-site management system. SIGMOD Rec., 26(3), 1997.

    Google Scholar 

  23. H. He, H. Wang, J. Yang, and P. S. Yu. Compact reachability labeling for graph-structured data. In Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management (CIKM 2005), pages 594–601, 2005.

    Google Scholar 

  24. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558–598, 1990.

    Article  MathSciNet  Google Scholar 

  25. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-HOP: A high-compression indexing scheme for reachability query. In Proceedings of the 2009 ACM SIGMOD international conference on Management of data (SIGMOD 2009), 2009.

    Google Scholar 

  26. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD 2008), 2008.

    Google Scholar 

  27. D. S. Johnson. Approximation algorithms for combinatorial problems. In Proceedings of the 5th annual ACM symposium on Theory of computing (STOC 1973), 1973.

    Google Scholar 

  28. L. Roditty and U. Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In Proceedings of the 36 annual ACM symposium on Theory of computing (STOC 2004), 2004.

    Google Scholar 

  29. R. Schenkel, A. Theobald, and G. Weikum. Hopi: An efficient connection index for complex XML document collections. In Proceedings of the 9th International Conference on Extending Database Technology (EDBT 2004), 2004.

    Google Scholar 

  30. R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In Proceedings of the 21th International Conference on Data Engineering (ICDE 2005), 2005.

    Google Scholar 

  31. K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1–3):325–346, 1988.

    Article  MATH  Google Scholar 

  32. S. TrißI and U. Leser. Fast and practical indexing and querying of very large graphs. In Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD 2007), 2007.

    Google Scholar 

  33. J. van Helden, A. Naim, R. Mancuso, , M. Eldridge, L. Wernisch, D. Gilbert, and S. Wodak. Reresenting and analysing molecular and cellular function using the computer. Journal of Biological Chemistry, 381(9–10), 2000.

    Google Scholar 

  34. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In Proceedings of the 22th International Conference on Data Engineering (ICDE 2006), 2006.

    Google Scholar 

  35. H. Wang, J. Li, J. Luo, and H. Gao. Hash-base subgraph query processing method for graph-structured XML documents. Proceedings VLDB Endowment, 1(1), 2008.

    Google Scholar 

  36. H. Wang, W. Wang, X. Lin, and J. Li. Labeling scheme and structural joins for graph-structured XML data. In Proceedings of the 7th Asia-Pacific Web Conference on Web Technologies Research and Development (APWeb 2005), 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Chinese University of Hong Kong, Hong Kong, China

    Jeffrey Xu Yu & Jiefeng Cheng

Authors
  1. Jeffrey Xu Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiefeng Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jeffrey Xu Yu .

Editor information

Editors and Affiliations

  1. Thomas J. Watson Research Center, IBM, Skyline Drive 19, Hawthorne, 10532, U.S.A.

    Charu C. Aggarwal

  2. Microsoft Research Asia, Zhichun Road 49, Beijing, 100080, China, People's Republic

    Haixun Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag US

About this chapter

Cite this chapter

Yu, J.X., Cheng, J. (2010). Graph Reachability Queries: A Survey. In: Aggarwal, C., Wang, H. (eds) Managing and Mining Graph Data. Advances in Database Systems, vol 40. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6045-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-6045-0_6

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-6044-3

  • Online ISBN: 978-1-4419-6045-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation