{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:33:54Z","timestamp":1761806034039,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095268","type":"print"},{"value":"9783032095275","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09527-5_23","type":"book-chapter","created":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:29:53Z","timestamp":1761805793000},"page":"425-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact Answers to\u00a0Temporal Path Queries"],"prefix":"10.1007","author":[{"given":"Muhammad","family":"Adnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Calvanese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Corman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7621-967X","authenticated-orcid":false,"given":"Anton","family":"Dign\u00f6s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9347-1885","authenticated-orcid":false,"given":"Werner","family":"Nutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9141-3008","authenticated-orcid":false,"given":"Ognjen","family":"Savkovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Al-Kateb, M., Mansour, E., El-Sharkawi, M.E.: CME: a temporal relational model for efficient coalescing. In: Proc. of the 12th Int. Symp. on Temporal Representation and Reasoning (TIME), pp. 83\u201390. IEEE Computer Society (2005)","DOI":"10.1109\/TIME.2005.16"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Arenas, M., Bahamondes, P., Aghasadeghi, A., Stoyanovich, J.: Temporal regular path queries. In: Proc. of the 38th IEEE Int. Conf. on Data Engineering (ICDE), pp. 2412\u20132425. IEEE Computer Society (2022)","DOI":"10.1109\/ICDE53745.2022.00226"},{"key":"23_CR3","unstructured":"Arenas, M., Bahamondes, P., Stoyanovich, J.: Temporal regular path queries: Syntax, semantics, and complexity. CoRR Technical Report arXiv:2107.01241, arXiv.org e-Print archive (2021). https:\/\/arxiv.org\/abs\/2107.01241"},{"key":"23_CR4","volume-title":"Covering Orthogonal Polygons with Squares","author":"L Aupperle","year":"1988","unstructured":"Aupperle, L., Conn, H.E., Keil, J.M., O\u2019Rourke, J.: Covering Orthogonal Polygons with Squares. Johns Hopkins University, Department of Computer Science (1988)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6hlen, M.H., Dign\u00f6s, A., Gamper, J., Jensen, C.S.: Temporal data management \u2013 an overview. In: Tutorial Lectures of the 7th European Summer School on Business Intelligence and Big Data (eBISS). Lecture Notes in Business Information Processing, vol.\u00a0324, pp. 51\u201383. Springer (2017)","DOI":"10.1007\/978-3-319-96655-7_3"},{"key":"23_CR6","unstructured":"B\u00f6hlen, M.H., Snodgrass, R.T., Soo, M.D.: Coalescing in temporal databases. In: Proc. of the 22nd Int. Conf. on Very Large Data Bases (VLDB), pp. 180\u2013191 (1996)"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s00778-020-00639-0","volume":"30","author":"P Bouros","year":"2021","unstructured":"Bouros, P., Mamoulis, N., Tsitsigkos, D., Terrovitis, M.: In-memory interval joins. Very Large Database J. 30(4), 667\u2013691 (2021)","journal-title":"Very Large Database J."},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00778-017-0456-7","volume":"26","author":"F Cafagna","year":"2017","unstructured":"Cafagna, F., B\u00f6hlen, M.H.: Disjoint interval partitioning. Very Large Database J. 26(3), 447\u2013466 (2017)","journal-title":"Very Large Database J."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jagm.1994.1025","volume":"17","author":"JC Culberson","year":"1994","unstructured":"Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17(1), 2\u201344 (1994)","journal-title":"J. Algorithms"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Dign\u00f6s, A., B\u00f6hlen, M.H., Gamper, J.: Overlap interval partition join. In: Proc. of the 35th ACM Int. Conf. on Management of Data (SIGMOD), pp. 1459\u20131470 (2014)","DOI":"10.1145\/2588555.2612175"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00778-021-00692-3","volume":"31","author":"A Dign\u00f6s","year":"2022","unstructured":"Dign\u00f6s, A., B\u00f6hlen, M.H., Gamper, J., Jensen, C.S., Moser, P.: Leveraging range joins for the computation of overlap joins. Very Large Database J. 31(1), 75\u201399 (2022)","journal-title":"Very Large Database J."},{"issue":"6","key":"23_CR12","doi-asserted-by":"publisher","first-page":"639","DOI":"10.14778\/3311880.3311882","volume":"12","author":"A Dign\u00f6s","year":"2019","unstructured":"Dign\u00f6s, A., Glavic, B., Niu, X., Gamper, J., B\u00f6hlen, M.H.: Snapshot semantics for temporal multiset relations. Proc. VLDB Endowment 12(6), 639\u2013652 (2019)","journal-title":"Proc. VLDB Endowment"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Enderle, J., Hampel, M., Seidl, T.: Joining interval data in relational databases. In: Proc. of the 25th ACM Int. Conf. on Management of Data (SIGMOD), pp. 683\u2013694 (2004)","DOI":"10.1145\/1007568.1007645"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Graph-theoretic solutions to computational geometry problems. In: Revised Papers the 35th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG). LNCS, vol.\u00a05911, pp. 1\u201316 (2009)","DOI":"10.1007\/978-3-642-11409-0_1"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Francis, N., et al.: Cypher: An evolving query language for property graphs. In: Proc. of the 39th ACM Int. Conf. on Management of Data (SIGMOD), pp. 1433\u20131445 (2018)","DOI":"10.1145\/3183713.3190657"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00778-003-0111-3","volume":"14","author":"D Gao","year":"2005","unstructured":"Gao, D., Jensen, C.S., Snodgrass, R.T., Soo, M.D.: Join operations in temporal databases. Very Large Database J. 14(1), 2\u201329 (2005)","journal-title":"Very Large Database J."},{"key":"23_CR17","unstructured":"Harris, S., Seaborne, A.: SPARQL\u00a01.1 query language. W3C Recommendation, World Wide Web Consortium, March 2013. http:\/\/www.w3.org\/TR\/sparql11-query"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Snodgrass, R.T.: Bitemporal relation. In: Encyclopedia of Database Systems, 2nd edn. Springer (2018)","DOI":"10.1007\/978-1-4614-8265-9_1409"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., et al.: Timeline index: a unified data structure for processing queries on temporal data in SAP HANA. In: Proc. of the 34th ACM Int. Conf. on Management of Data (SIGMOD), pp. 1173\u20131184 (2013)","DOI":"10.1145\/2463676.2465293"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Keil, J.M.: Minimally covering a horizontally convex orthogonal polygon. In: Proc. of the 2nd Annual ACM SIGACT\/SIGGRAPH Symposium on Computational Geometry (SCG), pp. 43\u201351 (1986)","DOI":"10.1145\/10515.10520"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Piatov, D., Helmer, S., Dign\u00f6s, A.: An interval join optimized for modern hardware. In: Proc. of the 32th IEEE Int. Conf. on Data Engineering (ICDE), pp. 1098\u20131109. IEEE Computer Society (2016)","DOI":"10.1109\/ICDE.2016.7498316"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BFb0053704","volume-title":"Temporal Databases: Research and Practice","author":"D Toman","year":"1998","unstructured":"Toman, D.: Point-based temporal extensions of SQL and their efficient implementation. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Temporal Databases: Research and Practice. LNCS, vol. 1399, pp. 211\u2013237. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053704"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/11827405_66","volume-title":"Database and Expert Systems Applications","author":"X Zhou","year":"2006","unstructured":"Zhou, X., Wang, F., Zaniolo, C.: Efficient temporal coalescing query support in relational database systems. In: Bressan, S., K\u00fcng, J., Wagner, R. (eds.) DEXA 2006. LNCS, vol. 4080, pp. 676\u2013686. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11827405_66"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09527-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:30:08Z","timestamp":1761805808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09527-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"ISBN":["9783032095268","9783032095275"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09527-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"29 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"An extended version with proofs of our results is available online, at\u00a0\n                      \n                      .","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Supplemental Material Statement"}},{"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":"Nara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2025.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}