{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T09:30:23Z","timestamp":1745832623639,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031334542"},{"type":"electronic","value":"9783031334559"}],"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-33455-9_3","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T19:01:35Z","timestamp":1684695695000},"page":"38-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Join Ordering of\u00a0SPARQL Property Path Queries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6707-0204","authenticated-orcid":false,"given":"Julien","family":"Aimonier-Davat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1062-6659","authenticated-orcid":false,"given":"Hala","family":"Skaf-Molli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8048-273X","authenticated-orcid":false,"given":"Pascal","family":"Molli","sequence":"additional","affiliation":[]},{"given":"Minh-Hoang","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Brice","family":"N\u00e9delec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-77385-4_4","volume-title":"The Semantic Web","author":"J Aimonier-Davat","year":"2021","unstructured":"Aimonier-Davat, J., Skaf-Molli, H., Molli, P.: Processing SPARQL property path queries online with web preemption. In: Verborgh, R., et al. (eds.) ESWC 2021. LNCS, vol. 12731, pp. 57\u201372. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77385-4_4"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ali, W., Saleem, M., Yao, B., Hogan, A., Ngomo, A.C.N.: A survey of RDF stores & SPARQL engines for querying knowledge graphs. VLDB J., 1\u201326 (2021)","DOI":"10.1007\/s00778-021-00711-3"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgo\u010d, D.: WDBench: a wikidata graph query benchmark. In: Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgo\u010d, D., et al. (eds.) The Semantic Web\u2014ISWC 2022. ISWC 2022. Lecture Notes in Computer Science, vol. 13489, pp. 714\u2013731. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-19433-7_41","DOI":"10.1007\/978-3-031-19433-7_41"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., Hogan, A., Navarro, G., Rojas-Ledesma, J.: Time-and space-efficient regular path queries. In: 38th International Conference on Data Engineering (ICDE), pp. 3091\u20133105. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00277"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bonifati, A., Martens, W., Timm, T.: Navigating the maze of wikidata query logs. In: The World Wide Web Conference, pp. 127\u2013138 (2019)","DOI":"10.1145\/3308558.3313472"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-41338-4_18","volume-title":"The Semantic Web \u2013 ISWC 2013","author":"C Buil-Aranda","year":"2013","unstructured":"Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y.: SPARQL web-querying infrastructure: ready for action? In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8219, pp. 277\u2013293. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41338-4_18"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-58907-4_6","volume-title":"Database Theory \u2014 ICDT \u201995","author":"S Cluet","year":"1995","unstructured":"Cluet, S., Moerkotte, G.: On the complexity of generating optimal left-deep processing trees with cross products. In: Gottlob, G., Vardi, M.Y. (eds.) ICDT 1995. LNCS, vol. 893, pp. 54\u201367. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-58907-4_6"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Erling, O., Mikhailov, I.: RDF support in the virtuoso DBMS. In: n: Pellegrini, T., Auer, S., Tochtermann, K., Schaffert, S. (eds.) Networked Knowledge - Networked Media. Studies in Computational Intelligence, vol. 221, pp. 7\u201324. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02184-8_2","DOI":"10.1007\/978-3-642-02184-8_2"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.websem.2013.01.002","volume":"19","author":"JD Fern\u00e1ndez","year":"2013","unstructured":"Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., Guti\u00e9rrez, C., Polleres, A., Arias, M.: Binary RDF representation for publication and exchange (HDT). J. Web Seman. 19, 22\u201341 (2013)","journal-title":"J. Web Seman."},{"key":"3_CR10","unstructured":"Gubichev, A.: Query processing and optimization in graph databases. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2015)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S.J., Seufert, S.: Sparqling kleene: fast property paths in RDF-3x. In: First International Workshop on Graph Data Management Experiences and Systems, pp. 1\u20137 (2013)","DOI":"10.1145\/2484425.2484443"},{"key":"3_CR12","unstructured":"Gubichev, A., Neumann, T.: Exploiting the query structure for efficient join ordering in SPARQL queries. In: 17th International Conference on Extending Database Technology, EDBT (2014)"},{"key":"3_CR13","unstructured":"Hertzschuch, A., Hartmann, C., Habich, D., Lehner, W.: Simplicity done right for join ordering. In: CIDR (2021)"},{"key":"3_CR14","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 2020 ACM SIGMOD International Conference on Management of Data, pp. 681\u2013697 (2020)","DOI":"10.1145\/3318464.3380567"},{"key":"3_CR15","unstructured":"Kader, R.A., Boncz, P.A., Manegold, S., van Keulen, M.: ROX: run-time optimization of XQueries. In: \u00c7etintemel, U., Zdonik, S.B., Kossmann, D., Tatbul, N. (eds.) International Conference on Management of Data, SIGMOD. ACM (2009)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-25007-6_1","volume-title":"The Semantic Web - ISWC 2015","author":"EV Kostylev","year":"2015","unstructured":"Kostylev, E.V., Reutter, J.L., Romero, M., Vrgo\u010d, D.: SPARQL with property paths. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 3\u201318. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25007-6_1"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P.A., Kemper, A., Neumann, T.: How good are query optimizers, really? VLDB Endow. 9(3), 204\u2013215 (2015)","journal-title":"VLDB Endow."},{"key":"3_CR18","unstructured":"Leis, V., Radke, B., Gubichev, A., Kemper, A., Neumann, T.: Cardinality estimation done right: Index-based join sampling. In: CIDR (2017)"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Li, F., Wu, B., Yi, K., Zhao, Z.: Wander join and XDB: online aggregation via random walks. ACM Trans. Database Syst. 44(1), 1\u201341 (2019). https:\/\/doi.org\/10.1145\/3284551","DOI":"10.1145\/3284551"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2494529","volume":"38","author":"K Losemann","year":"2013","unstructured":"Losemann, K., Martens, W.: The complexity of regular expressions and property paths in SPARQL. ACM Trans. Database Syst. (TODS) 38(4), 1\u201339 (2013)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"3_CR21","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":"3_CR22","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: 27th International Conference on Data Engineering. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Park, Y., Ko, S., Bhowmick, S.S., Kim, K., Hong, K., Han, W.S.: G-care: a framework for performance benchmarking of cardinality estimation techniques for subgraph matching. In: International Conference on Management of Data (SIGMOD) (2020)","DOI":"10.1145\/3318464.3389702"},{"issue":"3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1567274.1567278","volume":"34","author":"J P\u00e9rez","year":"2009","unstructured":"P\u00e9rez, J., Arenas, M., Guti\u00e9rrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34(3), 1\u201345 (2009)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Meier, M., Lausen, G.: Foundations of SPARQL query optimization. In: Database Theory - ICDT 2010, pp. 4\u201333 (2010)","DOI":"10.1145\/1804669.1804675"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Selingerl, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access path selection in a relational database management system. In: ACM SIGMOD (1979)","DOI":"10.1145\/582095.582099"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Sengupta, N., Bagchi, A., Ramanath, M., Bedathur, S.: Arrow: approximating reachability using random walks over web-scale graphs. In: International Conference on Data Engineering (ICDE), pp. 470\u2013481. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00049"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S., Weikum, G.: Ferrari: flexible and efficient reachability range assignment for graph indexing. In: 29th International Conference on Data Engineering (ICDE), pp. 1009\u20131020. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Stefanoni, G., Motik, B., Kostylev, E.V.: Estimating the cardinality of conjunctive queries over RDF data using graph summarisation. In: The World Wide Web Conference, pp. 1043\u20131052 (2018)","DOI":"10.1145\/3178876.3186003"},{"key":"3_CR30","unstructured":"Steve, H., Andy, S.: SPARQL 1.1 query language. In: Recommendation W3C (2013)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Thompson, B., Personick, M., Cutcher, M.: The bigdata\u00ae RDF graph database. In: Linked Data Management, pp. 221\u2013266. Chapman and Hall\/CRC, Boca Raton (2016)","DOI":"10.1201\/b16859-17"},{"key":"3_CR32","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: International Conference on Management of Data, pp. 1463\u20131480 (2019)","DOI":"10.1145\/3299869.3319882"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: International Conference on Management of Data, pp. 1875\u20131889 (2016)","DOI":"10.1145\/2882903.2882944"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33455-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T23:08:59Z","timestamp":1690844939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33455-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031334542","9783031334559"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33455-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hersonissos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"28 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esws2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.eswc-conferences.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","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":"50","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":"46% - 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":"9","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":"9","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)"}},{"value":"Submissions: Posters & Demos: 71 PhD Symposium: 24 Industry:14","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}