Skip to main content

Efficient Graph Reachability Query Answering Using Tree Decomposition

  • Conference paper
Reachability Problems (RP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6227))

Included in the following conference series:

  • 411 Accesses

Abstract

Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data processing, ontology reasoning and bioinformatics.

In this paper, we present a novel indexing method based on the concept of tree decomposition. We show analytically that this intuitive approach is both time and space efficient. We demonstrate empirically the efficiency and the effectiveness of our method.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD (1989)

    Google Scholar 

  2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC (1993)

    Google Scholar 

  4. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–23 (1993)

    MATH  MathSciNet  Google Scholar 

  5. Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence 21(3), 286–305 (2005)

    Article  MathSciNet  Google Scholar 

  6. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gottlob, G., Pichler, R., Wei, F.: Tractable database design through bounded treewidth. In: PODS, pp. 124–133 (2006)

    Google Scholar 

  8. Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD (2009)

    Google Scholar 

  9. Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: SIGMOD (2008)

    Google Scholar 

  10. Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2), 165–193 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Koster, A.M.C.A., Bodlaender, H.L., Hoesel, S.P.M.V.: Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics (2001)

    Google Scholar 

  12. Robertson, P.D., Seymour, N.: Graph minors iii: Planar tree-width. Journal of Combinatorial Theory, Series B 36, 49–64 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  13. Schenkel, R., Theobald, A., Weikum, G.: Hopi: An efficient connection index for complex xml document collections. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 237–255. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In: ICDE, pp. 360–371 (2005)

    Google Scholar 

  15. Trissl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD (2007)

    Google Scholar 

  16. Wang, H., He2, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: ICDE (2006)

    Google Scholar 

  17. Wei, F.: Tedi: Efficient shortest path query answering on graphs. In: SIGMOD (2010)

    Google Scholar 

  18. Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On supporting containment queries in relational database management systems. In: SIGMOD Conference (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, F. (2010). Efficient Graph Reachability Query Answering Using Tree Decomposition. In: Kučera, A., Potapov, I. (eds) Reachability Problems. RP 2010. Lecture Notes in Computer Science, vol 6227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15349-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15349-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15348-8

  • Online ISBN: 978-3-642-15349-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics