{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T20:10:06Z","timestamp":1760991006109,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","funder":[{"name":"Hong Kong RGC","award":["16208623"],"award-info":[{"award-number":["16208623"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,25]]},"DOI":"10.1145\/3748777.3748785","type":"proceedings-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:53:38Z","timestamp":1760442818000},"page":"207-217","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["TIDE: Indexing Time Intervals by Duration and Endpoint"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8968-4909","authenticated-orcid":false,"given":"Kai","family":"Wang","sequence":"first","affiliation":[{"name":"HKUST, Clearwater Bay, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4614-6940","authenticated-orcid":false,"given":"Moin Hussain","family":"Moti","sequence":"additional","affiliation":[{"name":"HKUST, Clearwater Bay, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5588-1026","authenticated-orcid":false,"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[{"name":"HKUST, Clearwater Bay, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2025,10,14]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"James\u00a0F Allen. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26 11 (1983) 832\u2013843.","DOI":"10.1145\/182.358434"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Lars Arge and Jeffrey\u00a0Scott Vitter. 1996. Optimal dynamic interval management in external memory. Annual Symposium on Foundations of Computer Science - ProceedingsMay (1996) 560\u2013569. doi:10.1109\/sfcs.1996.548515","DOI":"10.1109\/SFCS.1996.548515"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Lars Arge and Jeffrey\u00a0Scott Vitter. 2003. Optimal external memory interval management. SIAM J. Comput. 32 6 (2003) 1488\u20131508.","DOI":"10.1137\/S009753970240481X"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Norbert Beckmann Hans-Peter Kriegel Ralf Schneider and Bernhard Seeger. 1990. The R*-tree: An efficient and robust access method for points and rectangles. SIGMOD (1990) 322\u2013331.","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_3_2_6_2","series-title":"(SSTD \u201919)","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/3340964.3340965","volume-title":"Proceedings of the 16th International Symposium on Spatial and Temporal Databases","author":"Behrend Andreas","year":"2019","unstructured":"Andreas Behrend, Anton Dign\u00f6s, Johann Gamper, Philip Schmiegelt, Hannes Voigt, Matthias Rottmann, and Karsten Kahl. 2019. Period Index: A Learned 2D Hash Index for Range and Duration Queries. In Proceedings of the 16th International Symposium on Spatial and Temporal Databases (Vienna, Austria) (SSTD \u201919). Association for Computing Machinery, New York, NY, USA, 100\u2013109. doi:10.1145\/3340964.3340965"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Panagiotis Bouros Nikos Mamoulis Dimitrios Tsitsigkos and Manolis Terrovitis. 2021. In-Memory Interval Joins. The VLDB Journal 30 4 (April 2021) 667\u2013691. doi:10.1007\/s00778-020-00639-0","DOI":"10.1007\/s00778-020-00639-0"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585140"},{"key":"e_1_3_3_2_9_2","series-title":"(SSDBM \u201923)","volume-title":"Proceedings of the 35th International Conference on Scientific and Statistical Database Management","author":"Ceccarello Matteo","year":"2023","unstructured":"Matteo Ceccarello, Anton Dign\u00f6s, Johann Gamper, and Christina Khnaisser. 2023. Indexing Temporal Relations for Range-Duration Queries. In Proceedings of the 35th International Conference on Scientific and Statistical Database Management (Los Angeles, CA, USA) (SSDBM \u201923). Association for Computing Machinery, New York, NY, USA, Article 3, 12\u00a0pages. doi:10.1145\/3603719.3603732"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517873"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"George Christodoulou Panagiotis Bouros and Nikos Mamoulis. 2024. LIT: Lightning-fast In-memory Temporal Indexing. Proc. ACM Manag. Data 2 1 Article 20 (mar 2024) 27\u00a0pages. doi:10.1145\/3639275","DOI":"10.1145\/3639275"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Davide Costa Lucio La\u00a0Cava and Andrea Tagarelli. 2023. Unraveling the NFT economy: A comprehensive collection of Non-Fungible Token transactions and metadata. Data in Brief 51 (2023) 109749.","DOI":"10.1016\/j.dib.2023.109749"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/ICDE.2010.5447829","volume-title":"2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)","author":"Cudre-Mauroux Philippe","year":"2010","unstructured":"Philippe Cudre-Mauroux, Eugene Wu, and Samuel Madden. 2010. Trajstore: An adaptive storage system for very large trajectory data sets. In 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). IEEE, 109\u2013120."},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Victor\u00a0Teixeira De\u00a0Almeida and Ralf\u00a0Hartmut G\u00fcting. 2005. Indexing the trajectories of moving objects in networks. GeoInformatica 9 1 (2005) 33\u201360.","DOI":"10.1007\/s10707-004-5621-7"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12142"},{"key":"e_1_3_3_2_16_2","unstructured":"H Edelsbrunner. 1980. Dynamic rectangle intersection searching. Technical Report (1980) 47."},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/94362.94387"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Cheng\u00a0Hian Goh Hongjun Lu Beng-Chin Ooi and Kian-Lee Tan. 1996. Indexing temporal data using existing B+-trees. Data Knowl. Eng. 18 2 (March 1996) 147\u2013165. doi:10.1016\/0169-023X(95)00034-P","DOI":"10.1016\/0169-023X(95)00034-P"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517893"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/153850.153884"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Martin Kaufmann Amin\u00a0Amiri Manjili Panagiotis Vagenas Peter\u00a0Michael Fischer Donald Kossmann Franz F\u00e4rber and Norman May. 2013. Timeline index: a unified data structure for processing queries on temporal data in SAP HANA. SIGMOD (2013) 1173\u20131184.","DOI":"10.1145\/2463676.2465293"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Curtis\u00a0P. Kolovson and Michael Stonebraker. 1991. Segment indexes: dynamic indexing techniques for multi-dimensional interval data. SIGMOD Rec. 20 2 (April 1991) 138\u2013147. doi:10.1145\/119995.115807","DOI":"10.1145\/119995.115807"},{"key":"e_1_3_3_2_23_2","unstructured":"Hans-Peter Kriegel Marco P\u00f6tke and Thomas Seidl. 2000. Managing intervals efficiently in object-relational databases. VLDB (2000) 407\u2013418."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Sitaram Lanka and Eric Mays. 1991. Fully persistent B+-trees. ACM SIGMOD Record 20 2 (1991) 426\u2013435.","DOI":"10.1145\/119995.115861"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Chiang Lee and Te-Ming Tseng. 1998. Temporal Grid File: A file structure for interval data. Data & knowledge engineering 26 1 (1998) 71\u201397.","DOI":"10.1016\/S0169-023X(97)00027-X"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry algorithms and applications (3 ed.)","author":"Mark de\u00a0Berg","year":"2008","unstructured":"de\u00a0Berg Mark, Cheong Otfried, van\u00a0Kreveld Marc, and Overmars Mark. 2008. Computational geometry algorithms and applications (3 ed.). Spinger."},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/1007568.1007639","volume-title":"Proceedings of the 2004 ACM SIGMOD international conference on Management of data","author":"Patel Jignesh\u00a0M","year":"2004","unstructured":"Jignesh\u00a0M Patel, Yun Chen, and V\u00a0Prasad Chakka. 2004. STRIPES: an efficient index for predicted trajectories. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data. 635\u2013646."},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Betty Salzberg and Vassilis\u00a0J. Tsotras. 1999. Comparison of access methods for time-evolving data. ACM Comput. Surv. 31 2 (jun 1999) 158\u2013221. doi:10.1145\/319806.319816","DOI":"10.1145\/319806.319816"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"A. Segev and H. Gunadhi. 1993. Efficient Indexing Methods for Temporal Relations. IEEE Trans. on Knowl. and Data Eng. 5 3 (June 1993) 496\u2013509. doi:10.1109\/69.224200","DOI":"10.1109\/69.224200"},{"key":"e_1_3_3_2_30_2","series-title":"(VLDB \u201987)","first-page":"507","volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases","author":"Sellis Timos\u00a0K.","year":"1987","unstructured":"Timos\u00a0K. Sellis, Nick Roussopoulos, and Christos Faloutsos. 1987. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In Proceedings of the 13th International Conference on Very Large Data Bases(VLDB \u201987). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 507\u2013518."},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/645479.655127"},{"key":"e_1_3_3_2_32_2","series-title":"(MDM \u201903)","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-36389-0_25","volume-title":"Proceedings of the 4th International Conference on Mobile Data Management","author":"Song Zhexuan","year":"2003","unstructured":"Zhexuan Song and Nick Roussopoulos. 2003. SEB-tree: An Approach to Index Continuously Moving Objects. In Proceedings of the 4th International Conference on Mobile Data Management(MDM \u201903). Springer-Verlag, Berlin, Heidelberg, 340\u2013344."},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Jeffrey\u00a0Scott Vitter. 2001. External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv. 33 2 (June 2001) 209\u2013271. doi:10.1145\/384192.384193","DOI":"10.1145\/384192.384193"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2008.24"}],"event":{"name":"SSTD '25: 19th International Symposium on Spatial and Temporal Data","acronym":"SSTD '25","location":"Osaka Japan"},"container-title":["Proceedings of the 19th International Symposium on Spatial and Temporal Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748777.3748785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T19:39:08Z","timestamp":1760989148000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748777.3748785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,25]]},"references-count":33,"alternative-id":["10.1145\/3748777.3748785","10.1145\/3748777"],"URL":"https:\/\/doi.org\/10.1145\/3748777.3748785","relation":{},"subject":[],"published":{"date-parts":[[2025,8,25]]},"assertion":[{"value":"2025-10-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}