{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:53:47Z","timestamp":1777733627149,"version":"3.51.4"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031439797","type":"print"},{"value":"9783031439803","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_4","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"35-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Evaluating Regular Path Queries on\u00a0Compressed Adjacency Matrices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2509-8097","authenticated-orcid":false,"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1216-2176","authenticated-orcid":false,"given":"Adri\u00e1n","family":"G\u00f3mez-Brand\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2286-741X","authenticated-orcid":false,"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10115-014-0770-y","volume":"44","author":"S \u00c1lvarez-Garc\u00eda","year":"2015","unstructured":"\u00c1lvarez-Garc\u00eda, S., Brisaboa, N.R., Fern\u00e1ndez, J., Mart\u00ednez-Prieto, M., Navarro, G.: Compressed vertical partitioning for efficient RDF management. Knowl. Inf. Syst. 44(2), 439\u2013474 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Angles, R., et al.: G-CORE: a core for future graph query languages. In: SIGMOD International Conference on Management of Data, pp. 1421\u20131432. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3190654","DOI":"10.1145\/3183713.3190654"},{"key":"4_CR3","doi-asserted-by":"publisher","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\u201368:40 (2017). https:\/\/doi.org\/10.1145\/3104031","DOI":"10.1145\/3104031"},{"key":"4_CR4","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 38th IEEE International Conference on Data Engineering (ICDE), pp. 3091\u20133105 (2022)","DOI":"10.1109\/ICDE53745.2022.00277"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Navarro, G., Reutter, J.L., Rojas-Ledesma, J.: Optimal joins using compressed quadtrees. ACM Trans. Database Syst. 47(2), article 8 (2022)","DOI":"10.1145\/3514231"},{"key":"4_CR6","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: ACM International Conference on Management of Data (SIGMOD), pp. 102\u2013114 (2021)","DOI":"10.1145\/3448016.3457256"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.jcss.2022.09.001","volume":"131","author":"G de Bernardo","year":"2023","unstructured":"de Bernardo, G., Gagie, T., Ladra, S., Navarro, G., Seco, D.: Faster compressed quadtrees. J. Comput. Syst. Sci. 131, 86\u2013104 (2023)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-02432-5_14","volume-title":"String Processing and Information Retrieval","author":"G de Bernardo","year":"2013","unstructured":"de Bernardo, G., \u00c1lvarez-Garc\u00eda, S., Brisaboa, N.R., Navarro, G., Pedreira, O.: Compact querieable representations of raster data. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 96\u2013108. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02432-5_14"},{"key":"4_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3308558.3313472"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"5643","DOI":"10.1007\/s11227-022-04890-w","volume":"79","author":"N Brisaboa","year":"2023","unstructured":"Brisaboa, N., Cerdeira-Pena, A., de Bernardo, G., Fari\u00f1a, A., Navarro, G.: Space\/time-efficient RDF stores based on circular suffix sorting. J. Supercomput. 79, 5643\u20135683 (2023)","journal-title":"J. Supercomput."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.is.2013.08.003","volume":"39","author":"NR Brisaboa","year":"2014","unstructured":"Brisaboa, N.R., Ladra, S., Navarro, G.: Compact representation of web graphs with extended functionality. Inf. Syst. 39(1), 152\u2013174 (2014)","journal-title":"Inf. Syst."},{"key":"4_CR12","unstructured":"Clark, D.R.: Compact PAT trees. Ph.D. thesis, University of Waterloo, Canada (1996)"},{"key":"4_CR13","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Deutsch, A., et al.: Graph pattern matching in GQL and SQL\/PGQ. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 2246\u20132258 (2022)","DOI":"10.1145\/3514221.3526057"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Deutsch, A., Xu, Y., Wu, M., Lee, V.E.: Aggregation support for modern graph analytics in TigerGraph. In: SIGMOD International Conference on Management of Data, pp. 377\u2013392. ACM (2020). https:\/\/doi.org\/10.1145\/3318464.3386144","DOI":"10.1145\/3318464.3386144"},{"issue":"524","key":"4_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/3318221","volume":"62","author":"A Elgohary","year":"2019","unstructured":"Elgohary, A., Boehm, M., Haas, P.J., Reiss, F.R., Reinwald, B.: Compressed linear algebra for declarative large-scale machine learning. Commun. ACM 62(524), 83\u201391 (2019)","journal-title":"Commun. ACM"},{"key":"4_CR17","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-02184-8_2","volume-title":"Networked Knowledge - Networked Media","author":"O Erling","year":"2009","unstructured":"Erling, O., Mikhailov, I.: RDF support in the Virtuoso DBMS. In: Pellegrini, T., Auer, S., Tochtermann, K., Schaffert, S. (eds.) Networked Knowledge - Networked Media. Studies in Computational Intelligence, vol. 221, pp. 7\u201324. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02184-8_2"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Francis, N., et al.: Cypher: an evolving query language for property graphs. In: SIGMOD International Conference on Management of Data, pp. 1433\u20131445. ACM (2018)","DOI":"10.1145\/3183713.3190657"},{"issue":"5","key":"4_CR19","first-page":"1252","volume":"11","author":"ME Furman","year":"1970","unstructured":"Furman, M.E.: Application of a method of fast multiplication of matrices in the problem of Finding the transitive closure of a graph. Sov. Math. Dokl. 11(5), 1252 (1970)","journal-title":"Sov. Math. Dokl."},{"issue":"9","key":"4_CR20","first-page":"1098","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. Inst. Electr. Radio Eng. 40(9), 1098\u20131101 (1952)","journal-title":"Proc. Inst. Electr. Radio Eng."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Losemann, K., Martens, W.: The complexity of evaluating path expressions in SPARQL. In: Proceedings of the 31st Symposium on Principles of Database Systems (PODS), pp. 101\u2013112. ACM (2012)","DOI":"10.1145\/2213556.2213573"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-00668-6_23","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"S Malyshev","year":"2018","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: Vrande\u010di\u0107, D., et al. (eds.) ISWC 2018. LNCS, vol. 11137, pp. 376\u2013394. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00668-6_23"},{"key":"4_CR23","unstructured":"Manola, F., Miller, E.: RDF primer. W3C Recommendation (2004). http:\/\/www.w3.org\/TR\/rdf-primer\/"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Martens, W., Niewerth, M., Popp, T., Rojas, C., Vansummeren, S., Vrgoc, 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"},{"issue":"6","key":"4_CR25","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":"4_CR26","series-title":"Lecture Notes in Computer Science","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.) FSTTCS 1996. LNCS, vol. 1180, pp. 37\u201342. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-62034-6_35"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.11.008","volume":"354","author":"G Penn","year":"2006","unstructured":"Penn, G.: Efficient transitive closure of sparse matrices over closed semirings. Theoret. Comput. Sci. 354(1), 72\u201381 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"van Rest, O., Hong, S., Kim, J., Meng, X., Chafi, H.: PGQL: a property graph query language. In: International Workshop on Graph Data Management: Experiences and Systems (GRADES), p. 7. ACM (2016)","DOI":"10.1145\/2960414.2960421"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(82)90114-4","volume":"15","author":"A Schoor","year":"1982","unstructured":"Schoor, A.: Fast algorithm for sparse matrix multiplication. Inf. Process. Lett. 15(2), 87\u201389 (1982)","journal-title":"Inf. Process. Lett."},{"key":"4_CR31","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)"},{"issue":"10","key":"4_CR32","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 knowledge base. Commun. ACM 57(10), 78\u201385 (2014)","journal-title":"Commun. ACM"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: SIGMOD International Conference on Management of Data, pp. 1875\u20131889. ACM (2016)","DOI":"10.1145\/2882903.2882944"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:33Z","timestamp":1695124953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}