Skip to main content
SpringerLink
Log in

An External Memory Algorithm for All-Pairs Regular Path Problem

  • Conference paper
  • First Online:
Database and Expert Systems Applications (Globe 2015, DEXA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9262))

  • 841 Accesses

Abstract

In this paper, we consider solving the all-pairs regular path problem on large graphs efficiently. Let G be a graph and r be a regular path query, and consider finding the answers of r on G. If G is so small that it fits in main memory, it suffices to load entire G into main memory and traverse G to find paths matching r. However, if G is too large and cannot fit in main memory, we need another approach. In this paper, we propose an external memory algorithm for solving all-pairs regular path problem on large graphs. Our algorithm finds the answers matching r by scanning the node list of G sequentially, which avoids random accesses to disk and thus makes regular path query processing I/O efficient.

Y. Kwon–Currently, the author is with Graduate School of Agricultural and Life Sciences, The University of Tokyo, 1-1-1 Yayoi, Bunkyo-ku, Tokyo 113-8657, Japan.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Notes

  1. 1.

    http://www.sparsity-technologies.com/.

  2. 2.

    http://www.neo4j.org/.

  3. 3.

    https://github.com/tinkerpop/gremlin.

  4. 4.

    https://jena.apache.org/.

  5. 5.

    http://openrdf.org/.

  6. 6.

    We currently adopt breadth first search but any other search strategies can be applicable.

  7. 7.

    https://github.com/jexp/batch-import.

  8. 8.

    Neo4j has a declarative query language Cypher but it does not fully support regular path query. Thus we chose Gremlin in this experiment.

  9. 9.

    We also tried the same queries on Sparksee 5.1.0 and Apache Jena TDB, but obtained no result due to main memory exhaustion errors in both environments.

References

  1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  2. Bai, Y., Wang, C., Ning, Y., Wu, H., Wang, H.: G-path: flexible path pattern query on large graphs. In: Proceedings of the WWW 2013, pp. 333–336 (2013)

    Google Scholar 

  3. Baeza, P.B.: Querying graph databases. In: Proceedings of the PODS 2013, pp. 175–188 (2013)

    Google Scholar 

  4. Hu, X., Tao, Y., Chung, C.-W.: Massive graph triangulation. In: Proceedings of the SIGMOD 2013, pp. 325–336 (2013)

    Google Scholar 

  5. Koschmieder, A., Leser, U.: Regular path queries on large graphs. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 177–194. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Losemann, K., Martens, W.: The complexity of regular expressions and property paths in SPARQL. ACM Trans. Database Syst. 38(4), 24:1–24:39 (2013)

    Article  MathSciNet  Google Scholar 

  7. Luo, Y., Fletcher, G.H., Hidders, J., Wu, Y., De Bra, P.: External memory k-bisimulation reduction of big graphs. In: Proceedings of CIKM 2013, pp. 919–928 (2013)

    Google Scholar 

  8. Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: Proceedings of the SIGMOD 2010, pp. 135–146 (2010)

    Google Scholar 

  9. Martínez-Bazan, N., Muntés-Mulero, V., Gómez-Villamor, S., Nin, J., Sánchez-Martínez, M.-A., Larriba-Pey, J.-L.: Dex: high-performance exploration on large graphs for information retrieval. In: Proceedings of the CIKM 2007, pp. 573–582 (2007)

    Google Scholar 

  10. Morishima, A., Tajima, K., Tadaishi, M.: Optimal tree node ordering for child/descendant navigations. In: Proceedings of the ICDE 2010, pp. 840–843 (2010)

    Google Scholar 

  11. Schmidt, M., Hornung, T., Lausen, G., Pinkel, C.: Sp2Bench: A SPARQL performance benchmark. In: Proceedings of the ICDE 2009, pp. 222–233 (2009)

    Google Scholar 

  12. Shoaran, M., Thomo, A.: Distributed multi-source regular path queries. In: Proceedings of the ISPA 2007, pp. 365–374 (2007)

    Google Scholar 

  13. Stefanescu, D.C., Thomo, A., Thomo, L.: Distributed evaluation of generalized path queries. In: Proceedings of the SAC 2005, pp. 610–616 (2005)

    Google Scholar 

  14. Tung, L.-D., Nguyen-Van, Q., Hu, Z.: Efficient query evaluation on distributed graphs with hadoop environment. In: SoICT 2013, pp. 311–319 (2013)

    Google Scholar 

  15. Wood, P.T.: Query languages for graph databases. SIGMOD Rec. 41(1), 50–60 (2012)

    Article  Google Scholar 

  16. Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509–534 (2012)

    Article  Google Scholar 

  17. Zhang, Z., Yu, J.X., Qin, L., Chang, L., Lin, X.: I/O efficient: Computing SCCs in massive graphs. In: Proceedings of the SIGMOD 2013, pp. 181–192 (2013)

    Google Scholar 

  18. Zhang, Z., Yu, J.X., Qin, L., Zhu, Q., Zhou, X.: I/O cost minimization: reachability queries processing over massive graphs. In: Proceedings of the EDBT 2012, pp. 468–479 (2012)

    Google Scholar 

  19. Zou, L., Özsu, M.T., Chen, L., Shen, X., Huang, R., Zhao, D.: gStore: a graph-based SPARQL query engine. VLDB J. 23(4), 565–590 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tsukuba, 1-2 Kasuga, Tsukuba, Ibaraki, 305-8550, Japan

    Nobutaka Suzuki & Kosetsu Ikeda

  2. Tokyo University of Science, 2641 Yamazaki, Noda, Chiba, 278-8510, Japan

    Yeondae Kwon

Authors
  1. Nobutaka Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kosetsu Ikeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yeondae Kwon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nobutaka Suzuki .

Editor information

Editors and Affiliations

  1. Hewlett-Packard Enterprise, Sunnyvale, California, USA

    Qiming Chen

  2. Paul Sabatier University, Toulouse, France

    Abdelkader Hameurlain

  3. Blaise Pascal University, Aubiere, France

    Farouk Toumani

  4. University of Linz, Linz, Austria

    Roland Wagner

  5. Universidad Politécnica de Valencia, Valencia, Spain

    Hendrik Decker

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Suzuki, N., Ikeda, K., Kwon, Y. (2015). An External Memory Algorithm for All-Pairs Regular Path Problem. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds) Database and Expert Systems Applications. Globe DEXA 2015 2015. Lecture Notes in Computer Science(), vol 9262. Springer, Cham. https://doi.org/10.1007/978-3-319-22852-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22852-5_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22851-8

  • Online ISBN: 978-3-319-22852-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation