Skip to main content
SpringerLink
Log in

Efficient Regular Path Query Evaluation with Structural Path Constraints

  • Conference paper
  • First Online:
Advanced Data Mining and Applications (ADMA 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14178))

Included in the following conference series:

  • 227 Accesses

Abstract

Regular path query is a technique of using a regular expression (regex) on graph data. Classical methods adopt the finite state automaton to match the regular path query on the graph. Their matching results are the sequences of vertex pairs (i.e., a set of paths), and constraints between paths cannot be satisfied. To solve this problem, we propose a structural regular path query method that satisfies not only regex constraints but also structural path constraints a specific constraint needed to be satisfied by the target paths. We first define a structural regular path query and then design the structural automaton to represent this query. Also, we devise an automaton-based matching method using the deep-first traversal on the graph and design optimizations to improve the matching efficiency. Experiments are conducted in real datasets by comparing the proposed method to the traditional methods.

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

References

  1. Arenas, M., Conca, S., Pérez, J.: Counting beyond a yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In: World Wide Web Conference, pp. 629–638. ACM (2012)

    Google Scholar 

  2. Bizer, C., Vidal, M., Weiss, M.: Resource description framework. In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems. Springer (2018). https://doi.org/10.1007/978-1-4614-8265-9_905

  3. Bornea, M.A., et al.: Building an efficient RDF store over a relational database. In: ACM SIGMOD Conference, pp. 121–132. ACM (2013)

    Google Scholar 

  4. Carletti, V., Foggia, P., Saggese, A., Vento, M.: Introducing VF3: a new algorithm for subgraph isomorphism. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 128–139. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-58961-9_12

    Chapter  Google Scholar 

  5. Han, S., Zou, L., Yu, J.X.: Speeding up set intersections in graph algorithms using SIMD instructions. In: ACM SIGMOD Conference, pp. 1587–1602. ACM (2018)

    Google Scholar 

  6. Holzer, M., Kutrib, M.: Nondeterministic finite automata - recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20(4), 563–580 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Koschmieder, A.: Cost-based optimization of regular path queries on large graphs. In: Grundlagen von Datenbanken. CEUR Workshop Proceedings, vol. 581. CEUR-WS.org (2010)

    Google Scholar 

  8. Koschmieder, A., Leser, U.: Regular path queries on large graphs. Sci. Stat. Database Manag. 7338, 177–194 (2012)

    Google Scholar 

  9. Libkin, L., Vrgoc, D.: Regular path queries on graphs with data. In: International Conference on Database Theory, pp. 74–85. ACM (2012)

    Google Scholar 

  10. Ma, H., Zhou, D., Liu, C., Lyu, M.R., King, I.: Recommender systems with social regularization. In: Web Search and Web Data Mining Conference, pp. 287–296. ACM (2011)

    Google Scholar 

  11. Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: International Conference on Very Large Data Bases, pp. 185–193. Morgan Kaufmann (1989)

    Google Scholar 

  12. Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. VLDB J. 12(11), 1692–1704 (2019)

    Google Scholar 

  13. Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. VLDB J. 1(1), 647–659 (2008)

    Google Scholar 

  14. Peng, P., Zou, L., Özsu, M.T., Chen, L., Zhao, D.: Processing SPARQL queries over distributed RDF graphs. VLDB J. 25(2), 243–268 (2016)

    Article  Google Scholar 

  15. Qiu, T., Yang, X., Wang, B., Wang, W.: Efficient regular expression matching based on positional inverted index. IEEE Trans. Knowl. Data Eng. 34(3), 1133–1148 (2020)

    Article  Google Scholar 

  16. Reutter, J.L., Romero, M., Vardi, M.Y.: Regular queries on graph databases. Theory Comput. Syst. 61(1), 31–83 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  17. Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)

    Google Scholar 

  18. Santos, F.C., Costa, U.S., Musicante, M.A.: A Bottom-Up Algorithm for Answering Context-Free Path Queries in Graph Databases. In: Mikkonen, T., Klamma, R., Hernández, J. (eds.) ICWE 2018. LNCS, vol. 10845, pp. 225–233. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91662-0_17

    Chapter  Google Scholar 

  19. Sun, S., Luo, Q.: In-memory subgraph matching: an in-depth study. In: ACM SIGMOD Conference, pp. 1083–1098. ACM (2020)

    Google Scholar 

  20. Wang, M., et al.: PDD graph: bridging electronic medical records and biomedical knowledge graphs via entity linking. In: d’Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10588, pp. 219–227. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68204-4_23

    Chapter  Google Scholar 

  21. Weiss, C., Karras, P., Bernstein, A.: Hexastore: sextuple indexing for semantic web data management. VLDB J. 1(1), 1008–1019 (2008)

    Google Scholar 

  22. Wi, S., Han, W., Chang, C., Kim, K.: Towards multi-way join aware optimizer in SAP HANA. VLDB J. 13(12), 3019–3031 (2020)

    Google Scholar 

  23. Wilkinson, K., Sayers, C., Kuno, H.A., Reynolds, D.: Efficient RDF storage and retrieval in jena2. In: Semantic Web and Databases, pp. 131–150 (2003)

    Google Scholar 

  24. Zeng, L., Zou, L., Özsu, M.T., Hu, L., Zhang, F.: GSI: GPU-friendly subgraph isomorphism. In: International Conference on Data Engineering. pp, 1249–1260. IEEE (2020)

    Google Scholar 

  25. Zhang, X., den Bussche, J.V.: On the power of SPARQL in expressing navigational queries. Comput. J. 58(11), 2841–2851 (2015)

    Article  Google Scholar 

  26. Zhang, X., Feng, Z., Wang, X., Rao, G., Wu, W.: Context-Free Path Queries on RDF Graphs. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 632–648. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46523-4_38

    Chapter  Google Scholar 

  27. Zou, L., Mo, J., Chen, L., Özsu, M.T., Zhao, D.: Gstore: answering SPARQL queries via subgraph matching. VLDB J. 4(8), 482–493 (2011)

    Google Scholar 

Download references

Acknowledgements

This work is partially supported by the National Natural Science Foundation of China (Nos. 62002245, 61802268), the Natural Science Foundation of Liaoning Province (Nos. 2022-BS-218, 2022-MS-303, 2022-MS-302).

Author information

Authors and Affiliations

  1. School of Computer Science, Shenyang Aerospace University, Shenyang, China

    Tao Qiu, Yuhan Wang, Chuanyu Zong, Rui Zhu & Xiufeng Xia

  2. China National Institute of Standardization, Beijing, China

    Meng-xiang Wang

Authors
  1. Tao Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuhan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meng-xiang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chuanyu Zong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Rui Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xiufeng Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tao Qiu .

Editor information

Editors and Affiliations

  1. Northeastern University, Shenyang, China

    Xiaochun Yang

  2. The University of Indonesia, Depok, Indonesia

    Heru Suhartanto

  3. Beijing Institute of Technology, Beijing, China

    Guoren Wang

  4. Northeastern University, Shenyang, China

    Bin Wang

  5. University of Technology Sydney, Sydney, NSW, Australia

    Jing Jiang

  6. Agency for Science, Technology and Research (A*STAR), Singapore, Singapore

    Bing Li

  7. Sun Yat-sen University, Guangzhou, China

    Huaijie Zhu

  8. Anhui University, Hefei, China

    Ningning Cui

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qiu, T., Wang, Y., Wang, Mx., Zong, C., Zhu, R., Xia, X. (2023). Efficient Regular Path Query Evaluation with Structural Path Constraints. In: Yang, X., et al. Advanced Data Mining and Applications. ADMA 2023. Lecture Notes in Computer Science(), vol 14178. Springer, Cham. https://doi.org/10.1007/978-3-031-46671-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-46671-7_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-46670-0

  • Online ISBN: 978-3-031-46671-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation