Evaluating Reachability Queries over Path Collections

  • Panagiotis Bouros
  • Spiros Skiadopoulos
  • Theodore Dalamagas
  • Dimitris Sacharidis
  • Timos Sellis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5566)

Abstract

Several applications in areas such as biochemistry, GIS, involve storing and querying large volumes of sequential data stored as path collections. There is a number of interesting queries that can be posed on such data. This work focuses on reachability queries: given a path collection and two nodes vs, vt, determine whether a path from vs to vt exists and identify it. To answer these queries, the path-first search paradigm, which treats paths as first-class citizens, is proposed. To improve the performance of our techniques, two indexing structures that capture the reachability information of paths are introduced. Further, methods for updating a path collection and its indices are discussed. Finally, an extensive experimental evaluation verifies the advantages of our approach.

Keywords

path collections reachability queries 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Critchlow, T., Lacroix, Z.: Bioinformatics: Managing Scientific Data. Morgan Kaufmann, San Francisco (2003)Google Scholar
  2. 2.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937–946 (2002)Google Scholar
  3. 3.
    Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD Conference, pp. 253–262 (1989)Google Scholar
  4. 4.
    Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: SIGMOD Conference, pp. 595–608 (2008)Google Scholar
  5. 5.
    Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: ICDE, p. 75 (2006)Google Scholar
  6. 6.
    Agrawal, R., Jagadish, H.V.: Materialization and incremental update of path information. In: ICDE, pp. 374–383 (1989)Google Scholar
  7. 7.
    Agrawal, R., Jagadish, H.V.: Direct algorithms for computing the transitive closure of database relations. In: VLDB, pp. 255–266 (1987)Google Scholar
  8. 8.
    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
  9. 9.
    Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computing reachability labelings for large graphs with high compression rate. In: EDBT, pp. 193–204 (2008)Google Scholar
  10. 10.
    Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD Conference, pp. 845–856 (2007)Google Scholar
  11. 11.
    Bouros, P., Skiadopoulos, S., Dalamagas, T., Sacharidis, D., Sellis, T.K.: Evaluating reachability queries over path collections. Technical report, KDBS Lab, NTU Athens (2008), http://www.dblab.ece.ntua.gr/~pbour/reachOnPaths.pdf
  12. 12.
    Terrovitis, M.: Modelling and Operation Issues for Pattern Base Management Systems. PhD thesis, Knowledge and Database Systems Laboratory, School of Electrical and Computer Engineering, NTUA (May 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Panagiotis Bouros
    • 1
  • Spiros Skiadopoulos
    • 2
  • Theodore Dalamagas
    • 3
  • Dimitris Sacharidis
    • 1
  • Timos Sellis
    • 1
    • 3
  1. 1.National Technical University of AthensAthensGreece
  2. 2.University of PeloponneseTripoliGreece
  3. 3.Institute for the Management of Information Systems — “Athena” R.C.AthensGreece

Personalised recommendations