{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:47:00Z","timestamp":1773190020649,"version":"3.50.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Hellenic Foundation for Research and Innovation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>We study the problem of temporal database indexing, i.e., indexing versions of a database table in an evolving database. With the larger and cheaper memory chips nowadays, we can afford to keep track of all versions of an evolving table in memory. This raises the question of how to index such a table effectively. We depart from the classic indexing approach, where both current (i.e., live) and past (i.e., dead) data versions are indexed in the same data structure, and propose LIT, a hybrid index, which decouples the management of the current and past states of the indexed column. LIT includes optimized indexing modules for dead and live records, which support efficient queries and updates, and gracefully combines them. We experimentally show that LIT is orders of magnitude faster than the state-of-the-art temporal indices. Furthermore, we demonstrate that LIT uses linear space to the number of record indexed versions, making it suitable for main-memory temporal data management.<\/jats:p>","DOI":"10.1145\/3639275","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:51:32Z","timestamp":1711479092000},"page":"1-27","source":"Crossref","is-referenced-by-count":5,"title":["LIT: Lightning-fast In-memory Temporal Indexing"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2104-565X","authenticated-orcid":false,"given":"George","family":"Christodoulou","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8846-4330","authenticated-orcid":false,"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Johannes Gutenberg University Mainz, Mainz, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3423-4895","authenticated-orcid":false,"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Ioannina, Ioannina, Greece"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/S007780050028"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340964.3340965"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00197"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00290"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--96655--7_3"},{"key":"e_1_2_1_7_1","volume-title":"Richard T. Snodgrass, and Michael D. Soo.","author":"Michael","year":"1996","unstructured":"Michael H. B\u00f6 hlen, Richard T. Snodgrass, and Michael D. Soo. 1996. Coalescing in Temporal Databases. In VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3--6, 1996, Mumbai (Bombay), India. Morgan Kaufmann, 180--191. http:\/\/www.vldb.org\/conf\/1996\/P180.PDF"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588919"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137644"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-020-00639-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526138"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517873"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00798-w"},{"key":"e_1_2_1_14_1","volume-title":"Overmars","author":"de Berg Mark","year":"2008","unstructured":"Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. 2008. Computational geometry: algorithms and applications, 3rd Edition. Springer.","edition":"3"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3311880.3311882"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839452"},{"key":"e_1_2_1_17_1","unstructured":"Herbert Edelsbrunner. 1980. Dynamic Rectangle Intersection Searching. Technical Report 47. Institute for Information Processing TU Graz Austria."},{"key":"e_1_2_1_18_1","volume-title":"16th International Conference on Very Large Data Bases, August 13--16","author":"Elmasri Ramez","year":"1990","unstructured":"Ramez Elmasri, Gene T. J. Wuu, and Yeong-Joon Kim. 1990. The Time Index: An Access Structure for Temporal Data. In 16th International Conference on Very Large Data Bases, August 13--16, 1990, Brisbane, Queensland, Australia, Proceedings. Morgan Kaufmann, 1--12. http:\/\/www.vldb.org\/conf\/1990\/P001.PDF"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-003-0111--3"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00068"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517893"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465293"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380389"},{"key":"e_1_2_1_26_1","volume-title":"Managing Intervals Efficiently in Object-Relational Databases. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10--14","author":"Kriegel Hans-Peter","year":"2000","unstructured":"Hans-Peter Kriegel, Marco P\u00f6 tke, and Thomas Seidl. 2000. Managing Intervals Efficiently in Object-Relational Databases. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10--14, 2000, Cairo, Egypt. Morgan Kaufmann, 407--418. http:\/\/www.vldb.org\/conf\/2000\/P407.pdf"},{"key":"e_1_2_1_27_1","unstructured":"Mateusz Loskot and Adam Wulkiewicz. 2019. https:\/\/github.com\/mloskot\/spatial_index_benchmark."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352122"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589132.3625609"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198403"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4614--8265--9_399"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4614--8265--9_1513"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00187"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--64367-0_7"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498316"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00778-020-00650--5"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/319806.319816"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1986.1663327"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319996"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00157"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807228"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375600"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00164showDOI"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:14:10Z","timestamp":1755789250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639275"],"URL":"https:\/\/doi.org\/10.1145\/3639275","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}