{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:57Z","timestamp":1775912997533,"version":"3.50.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031778490","type":"print"},{"value":"9783031778506","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-77850-6_8","type":"book-chapter","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T05:14:27Z","timestamp":1732598067000},"page":"135-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PathFinder: Returning Paths in\u00a0Graph Queries"],"prefix":"10.1007","author":[{"given":"Benjam\u00edn","family":"Far\u00edas","sequence":"first","affiliation":[]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Rojas","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Vrgo\u010d","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Aebeloe, C., Montoya, G., Setty, V., Hose, K.: Discovering diversified paths in knowledge bases. Proc. VLDB Endow. 11(12), 2002\u20132005 (2018). https:\/\/doi.org\/10.14778\/3229863.3236245","DOI":"10.14778\/3229863.3236245"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgo\u010d, 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","DOI":"10.1007\/978-3-031-19433-7_41"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgo\u010d, D.: WDBench Dataset Download (2022). https:\/\/doi.org\/10.6084\/m9.figshare.19599589","DOI":"10.6084\/m9.figshare.19599589"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1145\/3183713.3190654"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Angles, R., Arenas, M., Barcel\u00f3, P., Hogan, A., Reutter, J.L., Vrgo\u010d, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50(5) (2017). https:\/\/doi.org\/10.1145\/3104031","DOI":"10.1145\/3104031"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Baeza, P.B.: Querying graph databases. In: Symposium on Principles of Database Systems (PODS), pp. 175\u2013188 (2013). https:\/\/doi.org\/10.1145\/2463664.2465216","DOI":"10.1145\/2463664.2465216"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"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\u2013272 (2013). https:\/\/doi.org\/10.1145\/2463664.2467795","DOI":"10.1145\/2463664.2467795"},{"key":"8_CR8","unstructured":"Blazegraph source code (2024). https:\/\/github.com\/blazegraph"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Bonifati, A., Martens, W., Timm, T.: Navigating the maze of Wikidata query logs. In: The World Wide Web Conference (WWW), pp. 127\u2013138. ACM (2019). https:\/\/doi.org\/10.1145\/3308558.3313472","DOI":"10.1145\/3308558.3313472"},{"issue":"2\u20133","key":"8_CR10","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s00778-019-00558-9","volume":"29","author":"A Bonifati","year":"2020","unstructured":"Bonifati, A., Martens, W., Timm, T.: An analytical study of large SPARQL query logs. VLDB J. 29(2\u20133), 655\u2013679 (2020). https:\/\/doi.org\/10.1007\/s00778-019-00558-9","journal-title":"VLDB J."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1006\/JCSS.2001.1805","volume":"64","author":"D Calvanese","year":"2002","unstructured":"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\u2013465 (2002). https:\/\/doi.org\/10.1006\/JCSS.2001.1805","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Casel, K., Schmid, M.L.: Fine-grained complexity of regular path queries. In: International Conference on Database Theory (ICDT), pp. 19:1\u201319:20 (2021). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2021.19","DOI":"10.4230\/LIPICS.ICDT.2021.19"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"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\u2013330 (1987). https:\/\/doi.org\/10.1145\/38713.38749","DOI":"10.1145\/38713.38749"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1145\/3514221.3526057"},{"key":"8_CR15","unstructured":"Erling, O.: Virtuoso, a hybrid RDBMS\/graph column store. IEEE Data Eng. Bull. 35(1), 3\u20138 (2012). http:\/\/sites.computer.org\/debull\/A12mar\/vicol.pdf"},{"key":"8_CR16","unstructured":"Far\u00edas, B., Martens, W., Rojas, C., Vrgo\u010d, D.: PathFinder: a unified approach for handling paths in graph query languages (2024). https:\/\/github.com\/AnonCSR\/PathFinder"},{"key":"8_CR17","unstructured":"Far\u00edas, B., Rojas, C., Vrgo\u010d, D.: MillenniumDB path query challenge. In: Alberto Mendelzon Workshop (AMW) (2023). https:\/\/ceur-ws.org\/Vol-3409\/paper13.pdf"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Fionda, V., Pirr\u00f2, G., Guti\u00e9rrez, C.: Nautilod: a formal language for the web of data graph. ACM Trans. Web 9(1), 5:1\u20135:43 (2015). https:\/\/doi.org\/10.1145\/2697393","DOI":"10.1145\/2697393"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"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\u20133:42 (2020). https:\/\/doi.org\/10.1145\/3351451","DOI":"10.1145\/3351451"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Francis, N., et al.: A researcher\u2019s digest of GQL (invited talk). In: International Conference on Database Theory (ICDT) (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2023.1","DOI":"10.4230\/LIPIcs.ICDT.2023.1"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1145\/3183713.3190657"},{"key":"8_CR22","unstructured":"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"},{"key":"8_CR23","unstructured":"Gubichev, A., Neumann, T.: Path query processing on very large RDF graphs. In: WebDB 2011 (2011). http:\/\/webdb2011.rutgers.edu\/papers\/Paper21\/pathwebdb.pdf"},{"key":"8_CR24","unstructured":"Harris, S., Seaborne, A., Prud\u2019hommeaux, E.: SPARQL 1.1 query language. W3C Recommendation (2013). https:\/\/www.w3.org\/TR\/sparql11-query\/"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Hogan, A., et al.: Knowledge graphs. ACM Comput. Surv. 54(4), 71:1\u201371:37 (2022). https:\/\/doi.org\/10.1145\/3447772","DOI":"10.1145\/3447772"},{"key":"8_CR26","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)"},{"key":"8_CR27","unstructured":"Apache jena source code (2024). https:\/\/github.com\/apache\/jena"},{"key":"8_CR28","unstructured":"Jin, G., Feng, X., Chen, Z., Liu, C., Salihoglu, S.: K\u00f9zu graph database management system. In: 13th Conference on Innovative Data Systems Research. CIDR 2023, 8\u201311 January 2023, Amsterdam, The Netherlands (2023). www.cidrdb.org , https:\/\/www.cidrdb.org\/cidr2023\/papers\/p48-jin.pdf"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Jumper, J., et\u00a0al.: Highly accurate protein structure prediction with AlphaFold. Nature 596(7873), 583\u2013589 (2021). https:\/\/doi.org\/10.1038\/s41586-021-03819-2","DOI":"10.1038\/s41586-021-03819-2"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Malyshev, S., Kr\u00f6tzsch, M., Gonz\u00e1lez, L., Gonsior, J., Bielefeldt, A.: Getting the most out of Wikidata: semantic technology usage in Wikipedia\u2019s knowledge graph. In: International Semantic Web Conference (ISWC) (2018). https:\/\/doi.org\/10.1007\/978-3-030-00668-6_23","DOI":"10.1007\/978-3-030-00668-6_23"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Martens, W., Niewerth, M., Popp, T., Rojas, C., Vansummeren, S., Vrgo\u010d, D.: Representing paths in graph database pattern matching. Proc. VLDB Endow. 16(7), 1790\u20131803 (2023). https:\/\/www.vldb.org\/pvldb\/vol16\/p1790-martens.pdf","DOI":"10.14778\/3587136.3587151"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"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\u20137:16 (2020). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2020.7","DOI":"10.4230\/LIPICS.STACS.2020.7"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Martens, W., Trautner, T.: Evaluation and enumeration problems for regular path queries. In: International Conference on Database Theory (ICDT), pp. 19:1\u201319:21 (2018). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2018.19","DOI":"10.4230\/LIPICS.ICDT.2018.19"},{"issue":"1","key":"8_CR34","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3371316.3371319","volume":"48","author":"W Martens","year":"2019","unstructured":"Martens, W., Trautner, T.: Bridging theory and practice with query log analysis. SIGMOD Rec. 48(1), 6\u201313 (2019). https:\/\/doi.org\/10.1145\/3371316.3371319","journal-title":"SIGMOD Rec."},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Martens, W., Trautner, T.: Dichotomies for evaluating simple regular path queries. ACM Trans. Database Syst. 44(4), 16:1\u201316:46 (2019). https:\/\/doi.org\/10.1145\/3331446","DOI":"10.1145\/3331446"},{"key":"8_CR36","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: Very Large Data Bases, pp. 185\u2013193 (1989). http:\/\/www.vldb.org\/conf\/1989\/P185.PDF"},{"key":"8_CR37","unstructured":"Neo4j open source code (2024). https:\/\/github.com\/neo4j\/neo4j"},{"issue":"5","key":"8_CR38","doi-asserted-by":"publisher","first-page":"711","DOI":"10.3233\/SW-200401","volume":"12","author":"JL Reutter","year":"2021","unstructured":"Reutter, J.L., Soto, A., Vrgo\u010d, D.: Recursion in SPARQL. Semant. Web 12(5), 711\u2013740 (2021). https:\/\/doi.org\/10.3233\/SW-200401","journal-title":"Semant. Web"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9781139195218"},{"issue":"9","key":"8_CR40","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3434642","volume":"64","author":"S Sakr","year":"2021","unstructured":"Sakr, S., et al.: The future is big graphs: a community view on graph processing systems. Commun. ACM 64(9), 62\u201371 (2021). https:\/\/doi.org\/10.1145\/3434642","journal-title":"Commun. ACM"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1145\/3132218.3132239"},{"key":"8_CR42","unstructured":"Team, J.: Jena TDB (2021). https:\/\/jena.apache.org\/documentation\/tdb\/"},{"key":"8_CR43","unstructured":"Team, M.: Memgraph (2023). https:\/\/memgraph.com\/"},{"key":"8_CR44","unstructured":"Thompson, B.B., Personick, M., Cutcher, M.: The Bigdata\u00ae RDF graph database. In: Harth, A., Hose, K., Schenkel, R. (eds.) Linked Data Management, pp. 193\u2013237. Chapman and Hall\/CRC (2014). http:\/\/www.crcnetbase.com\/doi\/abs\/10.1201\/b16859-12"},{"key":"8_CR45","unstructured":"Vesoft Inc\/Nebula: NebulaGraph (2023). https:\/\/www.nebula-graph.io\/"},{"key":"8_CR46","unstructured":"Virtuoso open source code (2024). https:\/\/github.com\/openlink\/virtuoso-opensource"},{"issue":"10","key":"8_CR47","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrandecic","year":"2014","unstructured":"Vrandecic, D., Kr\u00f6tzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78\u201385 (2014). https:\/\/doi.org\/10.1145\/2629489","journal-title":"Commun. ACM"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Vrgo\u010d, D., et al.: MillenniumDB: an open-source graph database system. Data Intell. 5(3), 560\u2013610 (2023). https:\/\/doi.org\/10.1162\/dint_a_00229","DOI":"10.1162\/dint_a_00229"},{"key":"8_CR49","doi-asserted-by":"publisher","unstructured":"Webber, J.: A programmatic introduction to Neo4j. In: SPLASH (2012). https:\/\/doi.org\/10.1145\/2384716.2384777","DOI":"10.1145\/2384716.2384777"},{"key":"8_CR50","unstructured":"Wikidata:database download (2021). https:\/\/www.wikidata.org\/wiki\/Wikidata:Database_download"},{"key":"8_CR51","unstructured":"ten Wolde, D., Singh, T., Sz\u00e1rnyas, 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"},{"key":"8_CR52","doi-asserted-by":"publisher","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: International Conference on Management of Data (SIGMOD), pp. 1875\u20131889. ACM (2016). https:\/\/doi.org\/10.1145\/2882903.2882944","DOI":"10.1145\/2882903.2882944"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77850-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T08:42:12Z","timestamp":1732610532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77850-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,27]]},"ISBN":["9783031778490","9783031778506"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77850-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,27]]},"assertion":[{"value":"27 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanover, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2024.semanticweb.org\/event\/3715c6fc-e2d7-47eb-8c01-5fe4ac589a52\/summary","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}