nach oben

Erschienen in:

2025 | OriginalPaper | Buchkapitel

PathFinder: Returning Paths in Graph Queries

verfasst von : Benjamín Farías, Wim Martens, Carlos Rojas, Domagoj Vrgoč

Erschienen in: The Semantic Web – ISWC 2024

Verlag: Springer Nature Switzerland

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Path queries are a central feature of all modern graph query languages and standards, such as SPARQL, Cypher, SQL/PGQ, and GQL. While SPARQL returns endpoints of path queries, it is possible in Cypher, SQL/PGQ, and GQL to return entire paths. In this paper, we present the first framework for returning paths that match regular path queries under all fifteen modes in the SQL/PGQ and GQL standards. At the core of our approach is the product graph construction combined with a way to compactly represent a potentially exponential number of results that can match a path query. Throughout the paper we describe how this approach operates on a conceptual level and provide runtime guarantees for evaluating path queries. We also develop a reference implementation on top of an existing open-source graph processing engine, and perform a detailed analysis of path querying over Wikidata to gauge the usefulness of our methods in a real world scenario. Compared to several modern graph engines, we obtain order-of-magnitude speedups and remarkably stable performance, even for theoretically intractable queries.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Exploiting Distant Supervision to Learn Semantic Descriptions of Tables with Overlapping Data

Nächstes Kapitel eSPARQL: Representing and Reconciling Agnostic and Atheistic Beliefs in RDF-star Knowledge Graphs

Aebeloe, C., Montoya, G., Setty, V., Hose, K.: Discovering diversified paths in knowledge bases. Proc. VLDB Endow. 11(12), 2002–2005 (2018). https://doi.org/10.14778/3229863.3236245

Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgoč, D.: WDBench: a Wikidata graph query benchmark. In: The Semantic Web - ISWC 2022 (2022). https://doi.org/10.1007/978-3-031-19433-7_41

Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgoč, D.: WDBench Dataset Download (2022). https://doi.org/10.6084/m9.figshare.19599589

Angles, R., et al.: G-CORE: a core for future graph query languages. In: International Conference on Management of Data (SIGMOD) (2018). https://doi.org/10.1145/3183713.3190654

Angles, R., Arenas, M., Barceló, P., Hogan, A., Reutter, J.L., Vrgoč, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50(5) (2017). https://doi.org/10.1145/3104031

Baeza, P.B.: Querying graph databases. In: Symposium on Principles of Database Systems (PODS), pp. 175–188 (2013). https://doi.org/10.1145/2463664.2465216

Bagan, G., Bonifati, A., Groz, B.: A trichotomy for regular simple path queries on graphs. In: Symposium on Principles of Database Systems (PODS), pp. 261–272 (2013). https://doi.org/10.1145/2463664.2467795

Blazegraph source code (2024). https://github.com/blazegraph

Bonifati, A., Martens, W., Timm, T.: Navigating the maze of Wikidata query logs. In: The World Wide Web Conference (WWW), pp. 127–138. ACM (2019). https://doi.org/10.1145/3308558.3313472

10.

Bonifati, A., Martens, W., Timm, T.: An analytical study of large SPARQL query logs. VLDB J. 29(2–3), 655–679 (2020). https://doi.org/10.1007/s00778-019-00558-9CrossRef

11.

Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. J. Comput. Syst. Sci. 64(3), 443–465 (2002). https://doi.org/10.1006/JCSS.2001.1805MathSciNetCrossRef

12.

Casel, K., Schmid, M.L.: Fine-grained complexity of regular path queries. In: International Conference on Database Theory (ICDT), pp. 19:1–19:20 (2021). https://doi.org/10.4230/LIPICS.ICDT.2021.19

13.

Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: International Conference on Management of Data (SIGMOD), pp. 323–330 (1987). https://doi.org/10.1145/38713.38749

14.

Deutsch, A., et al.: Graph pattern matching in GQL and SQL/PGQ. In: International Conference on Management of Data (SIGMOD) (2022). https://doi.org/10.1145/3514221.3526057

15.

Erling, O.: Virtuoso, a hybrid RDBMS/graph column store. IEEE Data Eng. Bull. 35(1), 3–8 (2012). http://sites.computer.org/debull/A12mar/vicol.pdf

16.

Farías, B., Martens, W., Rojas, C., Vrgoč, D.: PathFinder: a unified approach for handling paths in graph query languages (2024). https://github.com/AnonCSR/PathFinder

17.

Farías, B., Rojas, C., Vrgoč, D.: MillenniumDB path query challenge. In: Alberto Mendelzon Workshop (AMW) (2023). https://ceur-ws.org/Vol-3409/paper13.pdf

18.

Fionda, V., Pirrò, G., Gutiérrez, C.: Nautilod: a formal language for the web of data graph. ACM Trans. Web 9(1), 5:1–5:43 (2015). https://doi.org/10.1145/2697393

19.

Florenzano, F., Riveros, C., Ugarte, M., Vansummeren, S., Vrgoc, D.: Efficient enumeration algorithms for regular document spanners. ACM Trans. Database Syst. 45(1), 3:1–3:42 (2020). https://doi.org/10.1145/3351451

20.

Francis, N., et al.: A researcher’s digest of GQL (invited talk). In: International Conference on Database Theory (ICDT) (2023). https://doi.org/10.4230/LIPIcs.ICDT.2023.1

21.

Francis, N., et al.: Cypher: an evolving query language for property graphs. In: International Conference on Management of Data (SIGMOD) (2018). https://doi.org/10.1145/3183713.3190657

22.

Gubichev, A.: Query processing and optimization in graph databases. Ph.D. thesis, Technical University Munich (2015). https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20150625-1238730-1-7

23.

Gubichev, A., Neumann, T.: Path query processing on very large RDF graphs. In: WebDB 2011 (2011). http://webdb2011.rutgers.edu/papers/Paper21/pathwebdb.pdf

24.

Harris, S., Seaborne, A., Prud’hommeaux, E.: SPARQL 1.1 query language. W3C Recommendation (2013). https://www.w3.org/TR/sparql11-query/

25.

Hogan, A., et al.: Knowledge graphs. ACM Comput. Surv. 54(4), 71:1–71:37 (2022). https://doi.org/10.1145/3447772

26.

Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)

27.

Apache jena source code (2024). https://github.com/apache/jena

28.

Jin, G., Feng, X., Chen, Z., Liu, C., Salihoglu, S.: Kùzu graph database management system. In: 13th Conference on Innovative Data Systems Research. CIDR 2023, 8–11 January 2023, Amsterdam, The Netherlands (2023). www.cidrdb.org , https://www.cidrdb.org/cidr2023/papers/p48-jin.pdf

29.

Jumper, J., et al.: Highly accurate protein structure prediction with AlphaFold. Nature 596(7873), 583–589 (2021). https://doi.org/10.1038/s41586-021-03819-2

30.

Malyshev, S., Krötzsch, M., González, L., Gonsior, J., Bielefeldt, A.: Getting the most out of Wikidata: semantic technology usage in Wikipedia’s knowledge graph. In: International Semantic Web Conference (ISWC) (2018). https://doi.org/10.1007/978-3-030-00668-6_23

31.

Martens, W., Niewerth, M., Popp, T., Rojas, C., Vansummeren, S., Vrgoč, D.: Representing paths in graph database pattern matching. Proc. VLDB Endow. 16(7), 1790–1803 (2023). https://www.vldb.org/pvldb/vol16/p1790-martens.pdf

32.

Martens, W., Niewerth, M., Trautner, T.: A trichotomy for regular trail queries. In: International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 7:1–7:16 (2020). https://doi.org/10.4230/LIPICS.STACS.2020.7

33.

Martens, W., Trautner, T.: Evaluation and enumeration problems for regular path queries. In: International Conference on Database Theory (ICDT), pp. 19:1–19:21 (2018). https://doi.org/10.4230/LIPICS.ICDT.2018.19

34.

Martens, W., Trautner, T.: Bridging theory and practice with query log analysis. SIGMOD Rec. 48(1), 6–13 (2019). https://doi.org/10.1145/3371316.3371319CrossRef

35.

Martens, W., Trautner, T.: Dichotomies for evaluating simple regular path queries. ACM Trans. Database Syst. 44(4), 16:1–16:46 (2019). https://doi.org/10.1145/3331446

36.

Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: Very Large Data Bases, pp. 185–193 (1989). http://www.vldb.org/conf/1989/P185.PDF

37.

Neo4j open source code (2024). https://github.com/neo4j/neo4j

38.

Reutter, J.L., Soto, A., Vrgoč, D.: Recursion in SPARQL. Semant. Web 12(5), 711–740 (2021). https://doi.org/10.3233/SW-200401CrossRef

39.

Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)

40.

Sakr, S., et al.: The future is big graphs: a community view on graph processing systems. Commun. ACM 64(9), 62–71 (2021). https://doi.org/10.1145/3434642CrossRef

41.

Savenkov, V., Mehmood, Q., Umbrich, J., Polleres, A.: Counting to k or how SPARQL1.1 property paths can be extended to top-k path queries. In: SEMANTiCS 2017 (2017). https://doi.org/10.1145/3132218.3132239

42.

Team, J.: Jena TDB (2021). https://jena.apache.org/documentation/tdb/

43.

Team, M.: Memgraph (2023). https://memgraph.com/

44.

Thompson, B.B., Personick, M., Cutcher, M.: The Bigdata® RDF graph database. In: Harth, A., Hose, K., Schenkel, R. (eds.) Linked Data Management, pp. 193–237. Chapman and Hall/CRC (2014). http://www.crcnetbase.com/doi/abs/10.1201/b16859-12

45.

Vesoft Inc/Nebula: NebulaGraph (2023). https://www.nebula-graph.io/

46.

Virtuoso open source code (2024). https://github.com/openlink/virtuoso-opensource

47.

Vrandecic, D., Krötzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78–85 (2014). https://doi.org/10.1145/2629489CrossRef

48.

Vrgoč, D., et al.: MillenniumDB: an open-source graph database system. Data Intell. 5(3), 560–610 (2023). https://doi.org/10.1162/dint_a_00229

49.

Webber, J.: A programmatic introduction to Neo4j. In: SPLASH (2012). https://doi.org/10.1145/2384716.2384777

50.

Wikidata:database download (2021). https://www.wikidata.org/wiki/Wikidata:Database_download

51.

ten Wolde, D., Singh, T., Szárnyas, G., Boncz, P.A.: DuckPGQ: efficient property graph queries in an analytical RDBMS. In: Conference on Innovative Data Systems Research (CIDR) (2023). https://www.cidrdb.org/cidr2023/papers/p66-wolde.pdf

52.

Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: International Conference on Management of Data (SIGMOD), pp. 1875–1889. ACM (2016). https://doi.org/10.1145/2882903.2882944

Titel: PathFinder: Returning Paths in Graph Queries
verfasst von: Benjamín Farías
Wim Martens
Carlos Rojas
Domagoj Vrgoč
Verlag: Springer Nature Switzerland
Buch: The Semantic Web – ISWC 2024
Print ISBN: 978-3-031-77849-0

Electronic ISBN: 978-3-031-77850-6

Copyright-Jahr: 2025
DOI: https://doi.org/10.1007/978-3-031-77850-6_8

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"