{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T08:21:42Z","timestamp":1792743702636,"version":"4.5.0"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"FONDECYT","award":["1221926"],"award-info":[{"award-number":["1221926"]}]},{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["FEDER Galicia"],"award-info":[{"award-number":["FEDER Galicia"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2020-114635RB-I00"],"award-info":[{"award-number":["PID2020-114635RB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FONDECYT","award":["1-200038"],"award-info":[{"award-number":["1-200038"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s00778-023-00811-2","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T04:01:41Z","timestamp":1694059301000},"page":"349-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimizing RPQs over a compact graph representation"],"prefix":"10.1007","volume":"33","author":[{"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adri\u00e1n","family":"G\u00f3mez-Brand\u00f3n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9482-1982","authenticated-orcid":false,"given":"Aidan","family":"Hogan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javiel","family":"Rojas-Ledesma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"811_CR1","unstructured":"Abadi, D.J., Marcus, A., Madden, S.R., Hollenbach, K.: Scalable semantic web data management using vertical partitioning. In: Proceedings of the VLDB, pp. 411\u2013422 (2007)"},{"key":"811_CR2","doi-asserted-by":"crossref","unstructured":"Abul-Basher, Z.: Multiple-query optimization of regular path queries. In: Proceedings of the ICDE, pp. 1426\u20131430 (2017)","DOI":"10.1109\/ICDE.2017.205"},{"issue":"1","key":"811_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1108\/IJWIS-05-2013-0013","volume":"10","author":"F Alkhateeb","year":"2014","unstructured":"Alkhateeb, F., Euzenat, J.: Constrained regular expressions for answering RDF-path queries modulo RDFS. Int. J. Web Inf. Syst. 10(1), 24\u201350 (2014)","journal-title":"Int. J. Web Inf. Syst."},{"issue":"5","key":"811_CR4","first-page":"68:1","volume":"50","author":"R Angles","year":"2017","unstructured":"Angles, R., Arenas, M., Barcel\u00f3, P., Hogan, A., Reutter, J.L., Vrgoc, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50(5), 68:1-68:40 (2017)","journal-title":"ACM Comput. Surv."},{"key":"811_CR5","doi-asserted-by":"crossref","unstructured":"Angles, R., Arenas, M., Barcel\u00f3, P., Boncz, P.A., Fletcher, G.H.L., Guti\u00e9rrez, C., Lindaaker, T., Paradies, M., Plantikow, S., Sequeda, J.F., van Rest, O., Voigt, H.: G-CORE: a core for future graph query languages. In: Proceedings of the SIGMOD, pp. 1421\u20131432 (2018)","DOI":"10.1145\/3183713.3190654"},{"key":"811_CR6","doi-asserted-by":"crossref","unstructured":"Arenas, M., Conca, S., P\u00e9rez, J.: Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In: Proceedings of the WWW, pp. 629\u2013638 (2012)","DOI":"10.1145\/2187836.2187922"},{"key":"811_CR7","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Hogan, A., Navarro, G., Reutter, J., Rojas-Ledesma, J., Soto, A.: Worst-case optimal graph joins in almost no space. In: Proceedings of the SIGMOD, pp. 102\u2013114 (2021)","DOI":"10.1145\/3448016.3457256"},{"key":"811_CR8","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Hogan, A., Navarro, G., Rojas-Ledesma, J.: Time- and space-efficient regular path queries. In: Proceedings of the ICDE, pp. 3091\u20133105 (2022)","DOI":"10.1109\/ICDE53745.2022.00277"},{"issue":"4","key":"811_CR9","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/110859440","volume":"42","author":"A Atserias","year":"2013","unstructured":"Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. SIAM J. Comput. 42(4), 1737\u20131767 (2013)","journal-title":"SIAM J. Comput."},{"key":"811_CR10","doi-asserted-by":"crossref","unstructured":"Baier, J.A., Daroch, D., Reutter, J.L., Vrgoc, D.: Evaluating navigational RDF queries over the Web. In: Proceedings of the ACM HT, pp. 165\u2013174 (2017)","DOI":"10.1145\/3078714.3078731"},{"issue":"1","key":"811_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1328911.1328915","volume":"4","author":"J Barbay","year":"2008","unstructured":"Barbay, J., Kenyon, C.: Alternation and redundancy analysis of the intersection problem. ACM Trans. Algorithm 4(1), 1\u201318 (2008)","journal-title":"ACM Trans. Algorithm"},{"issue":"1","key":"811_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expression to deterministic automata. Theor. Comput. Sci. 48(1), 117\u2013126 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"811_CR13","doi-asserted-by":"crossref","unstructured":"Biega, J., Kuzey, E., Suchanek, F.M.: Inside YAGO2s: a transparent information extraction architecture. In: Proceedings of the WWW, pp. 325\u2013328 (2013)","DOI":"10.1145\/2487788.2487935"},{"key":"811_CR14","unstructured":"Bonchi, F., Gionis, A., Gullo, F., Ukkonen, A.: Distance oracles in edge-labeled graphs. In: Proceedings of the EDBT, pp. 547\u2013558 (2014)"},{"key":"811_CR15","doi-asserted-by":"crossref","unstructured":"Bonifati, A., Martens, W., Timm, T.: Navigating the maze of Wikidata query logs. In: Proceedings of the WWW, pp. 127\u2013138 (2019)","DOI":"10.1145\/3308558.3313472"},{"issue":"2\u20133","key":"811_CR16","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)","journal-title":"VLDB J."},{"issue":"2","key":"811_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120(2), 197\u2013213 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"811_CR18","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)"},{"key":"811_CR19","unstructured":"Clark, D.R.: Compact PAT trees. PhD thesis, University of Waterloo, Canada (1996)"},{"key":"811_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.is.2014.06.002","volume":"47","author":"F Claude","year":"2015","unstructured":"Claude, F., Navarro, G., Ord\u00f3\u00f1ez, A.: The wavelet matrix: an efficient wavelet tree for large alphabets. Inf. Syst. 47, 15\u201332 (2015)","journal-title":"Inf. Syst."},{"key":"811_CR21","doi-asserted-by":"crossref","unstructured":"Colazzo, D., Mecca, V., Nol\u00e9, M., Sartiani, C.: PathGraph: querying and exploring big data graphs. In: Proceedings of the SSDBM, pp. 29:1\u201329:4 (2018)","DOI":"10.1145\/3221269.3222331"},{"key":"811_CR22","doi-asserted-by":"crossref","unstructured":"Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: Proceedings of the SIGMOD, pp. 323\u2013330 (1987)","DOI":"10.1145\/38714.38749"},{"key":"811_CR23","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Xu, Y., Wu, M., Lee, V.E.: Aggregation support for modern graph analytics in TigerGraph. In: Proceedings of the SIGMOD, pp. 377\u2013392 (2020)","DOI":"10.1145\/3318464.3386144"},{"key":"811_CR24","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Francis, N., Green, A., Hare, K., Li, B., Libkin, L., Lindaaker, T., Marsault, V., Martens, W., Michels, J., Murlak, F., Plantikow, S., Selmer, P., van Rest, O., Voigt, H., Vrgoc, D., Wu, M., Zemke, F.: Graph pattern matching in GQL and SQL\/PGQ. In: Proceedings of the SIGMOD, pp. 2246\u20132258 (2022)","DOI":"10.1145\/3514221.3526057"},{"key":"811_CR25","doi-asserted-by":"crossref","unstructured":"Dey, S.C., Cuevas-Vicent\u00edn, V., K\u00f6hler, S., Gribkoff, E., Wang, M., Lud\u00e4scher, B.: On implementing provenance-aware regular path queries with relational query engines. In: Proceedings of the EDBT\/ICDT, pp. 214\u2013223 (2013)","DOI":"10.1145\/2457317.2457353"},{"key":"811_CR26","doi-asserted-by":"crossref","unstructured":"Erling, O., Mikhailov, I.: RDF support in the virtuoso DBMS. In: Networked Knowledge\u2014Networked Media, pp. 7\u201324. Springer (2009)","DOI":"10.1007\/978-3-642-02184-8_2"},{"issue":"4","key":"811_CR27","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed texts. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"issue":"6","key":"811_CR28","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.3233\/SW-190365","volume":"10","author":"V Fionda","year":"2019","unstructured":"Fionda, V., Pirr\u00f2, G., Consens, M.P.: Querying knowledge graphs with extended property paths. Semant. Web 10(6), 1127\u20131168 (2019)","journal-title":"Semant. Web"},{"key":"811_CR29","unstructured":"Fletcher, G.H.L., Peters, J., Poulovassilis, A.: Efficient regular path query evaluation using path indexes. In: Proceedings of the EDBT, pp. 636\u2013639 (2016)"},{"key":"811_CR30","doi-asserted-by":"crossref","unstructured":"Francis, N., Green, A., Guagliardo, P., Libkin, L., Lindaaker, T., Marsault, V., Plantikow, S., Rydberg, M., Selmer, P., Taylor, A.: Cypher: An evolving query language for property graphs. In: Proceedings of the SIGMOD, pp. 1433\u20131445 (2018)","DOI":"10.1145\/3183713.3190657"},{"key":"811_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.002","volume":"426","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Navarro, G., Puglisi, S.: New algorithms on wavelet trees and applications to information retrieval. Theor. Comput. Sci. 426, 25\u201341 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"811_CR32","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.002","volume":"426\u2013427","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Navarro, G., Puglisi, S.J.: New algorithms on wavelet trees and applications to information retrieval. Theor. Comput. Sci. 426\u2013427, 25\u201341 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"811_CR33","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2012.08.004","volume":"483","author":"T Gagie","year":"2013","unstructured":"Gagie, T., K\u00e4rkk\u00e4inen, J., Navarro, G., Puglisi, S.J.: Colored range queries and document retrieval. Theor. Comput. Sci. 483, 36\u201350 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"811_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V-M Glushkov","year":"1961","unstructured":"Glushkov, V.-M.: The abstract theory of automata. Russ. Math. Surv. 16, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"811_CR35","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the SODA, pp. 841\u2013850 (2003)"},{"key":"811_CR36","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S.J., Seufert, S.: Sparqling kleene: fast property paths in RDF-3X. In: Proceedings of the GRADES, pp.\u00a014 (2013)","DOI":"10.1145\/2484425.2484443"},{"issue":"4","key":"811_CR37","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1007\/s10115-020-01536-2","volume":"63","author":"X Guo","year":"2021","unstructured":"Guo, X., Gao, H., Zou, Z.: Distributed processing of regular path queries in RDF graphs. Knowl. Inf. Syst. 63(4), 993\u20131027 (2021)","journal-title":"Knowl. Inf. Syst."},{"key":"811_CR38","unstructured":"Harris, S., Seaborne, A., Prud\u2019hommeaux, E.: SPARQL 1.1 Query Language. W3C Recommendation (2013). http:\/\/www.w3.org\/TR\/sparql11-query\/"},{"issue":"6","key":"811_CR39","doi-asserted-by":"publisher","first-page":"773","DOI":"10.3233\/SW-160237","volume":"8","author":"O Hartig","year":"2017","unstructured":"Hartig, O., Pirr\u00f2, G.: SPARQL with property paths on the Web. Semant. Web 8(6), 773\u2013795 (2017)","journal-title":"Semant. Web"},{"key":"811_CR40","doi-asserted-by":"crossref","unstructured":"Jachiet, L., Genev\u00e8s, P., Gesbert, N., Laya\u00efda, N.: On the optimization of recursive relational queries: application to graph queries. In: Proceedings of the SIGMOD, pp. 681\u2013697 (2020)","DOI":"10.1145\/3318464.3380567"},{"key":"811_CR41","doi-asserted-by":"crossref","unstructured":"Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: Proceedings of the SIGMOD, pp. 123\u2013134 (2010)","DOI":"10.1145\/1807167.1807183"},{"key":"811_CR42","doi-asserted-by":"crossref","unstructured":"Koschmieder, A., Leser, U.: Regular path queries on large graphs. In: Proceedings of the SSDBM, pp. 177\u2013194 (2012)","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"811_CR43","doi-asserted-by":"crossref","unstructured":"Kostylev, E.V., Reutter, J.L., Romero, M., Vrgoc, D.: SPARQL with property paths. In: Proceedings of the ISWC, pp. 3\u201318 (2015)","DOI":"10.1007\/978-3-319-25007-6_1"},{"key":"811_CR44","unstructured":"Kuijpers, J., Fletcher, G., Lindaaker, T., Yakovets, N.: Path indexing in the cypher query pipeline. In: Proceedings of the EDBT, pp. 582\u2013587 (2021)"},{"key":"811_CR45","doi-asserted-by":"crossref","unstructured":"Liu, B., Wang, X., Liu, P., Li, S., Wang, X.: PAIRPQ: an efficient path index for regular path queries on knowledge graphs. In: Proceedings of the APWeb-WAIM, pp. 106\u2013120 (2021)","DOI":"10.1007\/978-3-030-85899-5_8"},{"key":"811_CR46","doi-asserted-by":"crossref","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: Proceedings of the ISWC, pp. 376\u2013394 (2018)","DOI":"10.1007\/978-3-030-00668-6_23"},{"key":"811_CR47","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.is.2015.08.008","volume":"56","author":"MA Mart\u00ednez-Prieto","year":"2016","unstructured":"Mart\u00ednez-Prieto, M.A., Brisaboa, N., C\u00e1novas, R., Claude, F., Navarro, G.: Practical compressed string dictionaries. Inf. Syst. 56, 73\u2013108 (2016)","journal-title":"Inf. Syst."},{"key":"811_CR48","doi-asserted-by":"publisher","first-page":"101031","DOI":"10.1109\/ACCESS.2019.2930416","volume":"7","author":"Q Mehmood","year":"2019","unstructured":"Mehmood, Q., Saleem, M., Sahay, R., Ngomo, A.N., d\u2019Aquin, M.: QPPDs: querying property paths over distributed RDF datasets. IEEE Access 7, 101031\u2013101045 (2019)","journal-title":"IEEE Access"},{"issue":"6","key":"811_CR49","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"AO Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"key":"811_CR50","unstructured":"Miura, K., Amagasa, T., Kitagawa, H.: Accelerating regular path queries using FPGA. In: Bordawekar, R., Lahiri, T. (eds.) Proceedings of the ADMS@VLDB, pp. 47\u201354 (2019)"},{"key":"811_CR51","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"JI Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science, pp. 37\u201342. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-62034-6_35"},{"key":"811_CR52","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2012.03.005","volume":"438","author":"JI Munro","year":"2012","unstructured":"Munro, J.I., Raman, R., Raman, V., S., S.R.: Succinct representations of permutations and functions. Theor. Comput. Sci. 438, 74\u201388 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.005","journal-title":"Theor. Comput. Sci."},{"key":"811_CR53","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings of the SODA, pp. 657\u2013666 (2002)"},{"issue":"4","key":"811_CR54","first-page":"52:1","volume":"46","author":"G Navarro","year":"2013","unstructured":"Navarro, G.: Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences. ACM Comput. Surv. 46(4), 52:1-52:47 (2013)","journal-title":"ACM Comput. Surv."},{"key":"811_CR55","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","volume":"25","author":"G Navarro","year":"2014","unstructured":"Navarro, G.: Wavelet trees for all. J. Discrete Algorithm 25, 2\u201320 (2014)","journal-title":"J. Discrete Algorithm"},{"issue":"2","key":"811_CR56","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00453-004-1120-3","volume":"41","author":"G Navarro","year":"2005","unstructured":"Navarro, G., Raffinot, M.: New techniques for regular expression searching. Algorithmica 41(2), 89\u2013116 (2005)","journal-title":"Algorithmica"},{"issue":"10","key":"811_CR57","doi-asserted-by":"publisher","first-page":"2648","DOI":"10.1587\/transinf.2017EDL8060","volume":"100","author":"V Nguyen","year":"2017","unstructured":"Nguyen, V., Kim, K.: Efficient regular path query evaluation by splitting with unit-subquery cost matrix. IEICE Trans. Inf. Syst. 100(10), 2648\u20132652 (2017)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"811_CR58","doi-asserted-by":"crossref","unstructured":"Nol\u00e9, M., Sartiani, C.: Regular path queries on massive graphs. In: Proceedings of the SSDBM, pp. 13:1\u201313:12 (2016)","DOI":"10.1145\/2949689.2949711"},{"key":"811_CR59","doi-asserted-by":"crossref","unstructured":"Pacaci, A., Bonifati, A., \u00d6zsu, M.T.: Regular path query evaluation on streaming graphs. In: Proceedings of the SIGMOD, pp. 1415\u20131430 (2020)","DOI":"10.1145\/3318464.3389733"},{"issue":"6","key":"811_CR60","first-page":"812","volume":"13","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Zhang, Y., Lin, X., Qin, L., Zhang, W.: Answering billion-scale label-constrained reachability queries within microsecond. PVLDB 13(6), 812\u2013825 (2020)","journal-title":"PVLDB"},{"issue":"1","key":"811_CR61","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00778-021-00695-0","volume":"31","author":"Y Peng","year":"2022","unstructured":"Peng, Y., Lin, X., Zhang, Y., Zhang, W., Qin, L.: Answering reachability and k-reach queries on large graphs with label constraints. VLDB J. 31(1), 101\u2013127 (2022)","journal-title":"VLDB J."},{"issue":"4","key":"811_CR62","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.websem.2010.01.002","volume":"8","author":"J P\u00e9rez","year":"2010","unstructured":"P\u00e9rez, J., Arenas, M., Guti\u00e9rrez, C.: nSPARQL: a navigational language for RDF. J. Web Semant. 8(4), 255\u2013270 (2010)","journal-title":"J. Web Semant."},{"key":"811_CR63","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S.J., Weikum, G.: FERRARI: flexible and efficient reachability range assignment for graph indexing. In: Proceedings of the ICDE, pp. 1009\u20131020 (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"issue":"3","key":"811_CR64","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s13222-020-00353-9","volume":"20","author":"F Tetzel","year":"2020","unstructured":"Tetzel, F., Lehner, W., Kasperovics, R.: Efficient compilation of regular path queries. Datenbank Spektrum 20(3), 243\u2013259 (2020)","journal-title":"Datenbank Spektrum"},{"key":"811_CR65","unstructured":"Thompson, B.B., Personick, M., Cutcher, M.: The Bigdata\u00aeRDF graph database. In: Linked data management, pp. 193\u2013237. Chapman and Hall\/CRC (2014)"},{"key":"811_CR66","doi-asserted-by":"crossref","unstructured":"Valstar, L.D.J., Fletcher, G.H.L., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: Proceedings of the SIGMOD, pp. 345\u2013358 (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"811_CR67","doi-asserted-by":"crossref","unstructured":"van Rest, O., Hong, S., Kim, J., Meng, X., Chafi, H.: PGQL: a property graph query language. In: Proceedings of the GRADES, p. 7 (2016)","DOI":"10.1145\/2960414.2960421"},{"key":"811_CR68","unstructured":"Veldhuizen, T.L.: Triejoin: a simple, worst-case optimal join algorithm. In: Proceedings of the ICDT, pp. 96\u2013106 (2014)"},{"issue":"10","key":"811_CR69","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)","journal-title":"Commun. ACM"},{"key":"811_CR70","doi-asserted-by":"crossref","unstructured":"Wadhwa, S., Prasad, A., Ranu, S., Bagchi, A., Bedathur, S.: Efficiently answering regular simple path queries on large labeled networks. In: Proceedings of the SIGMOD, pp. 1463\u20131480 (2019)","DOI":"10.1145\/3299869.3319882"},{"key":"811_CR71","doi-asserted-by":"crossref","unstructured":"Wang, X., Rao, G., Jiang, L., Lyu, X., Yang, Y., Feng, Z.: TraPath: fast regular path query evaluation on large-scale RDF graphs. In: Proceedings of the WAIM, pp. 372\u2013383 (2014)","DOI":"10.1007\/978-3-319-08010-9_39"},{"key":"811_CR72","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, J., Zhang, X.: Efficient distributed regular path queries on RDF graphs using partial evaluation. In: Proceedings of the CIKM, pp. 1933\u20131936 (2016)","DOI":"10.1145\/2983323.2983877"},{"key":"811_CR73","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Evaluation of SPARQL property paths via recursive SQL. In: Proceedings of the AMW (2013)"},{"key":"811_CR74","doi-asserted-by":"crossref","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: Proceedings of the SIGMOD, pp. 1875\u20131889 (2016)","DOI":"10.1145\/2882903.2882944"},{"key":"811_CR75","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.is.2013.10.003","volume":"40","author":"L Zou","year":"2014","unstructured":"Zou, L., Xu, K., Yu, J.X., Chen, L., Xiao, Y., Zhao, D.: Efficient processing of label-constraint reachability queries in large graphs. Inf. Syst. 40, 47\u201366 (2014)","journal-title":"Inf. Syst."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00811-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-023-00811-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00811-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T20:03:38Z","timestamp":1708545818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-023-00811-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["811"],"URL":"https:\/\/doi.org\/10.1007\/s00778-023-00811-2","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,7]]},"assertion":[{"value":"4 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}