LIT: Lightning-fast In-memory Temporal Indexing
Summary: LIT is a hybrid in-memory temporal index that decouples live and past versions to optimize updates and queries. Specialized modules for current vs past records deliver orders-of-magnitude speedups with linear space, outperforming prior temporal indices. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. George Christodoulou (Delft University of Technology)
- 2. Panagiotis Bouros (Johannes Gutenberg University Mainz)
- 3. Nikos Mamoulis (University of Ioannina)
BibTeX Citation
@inproceedings{christodoulou_sigmod24,
title = {{LIT: Lightning-fast In-memory Temporal Indexing}},
author = {Christodoulou, George and Bouros, Panagiotis and Mamoulis, Nikos},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3639275},
url = {https://dl.acm.org/doi/10.1145/3639275},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,244 | FIRAS: A Framework for Interval Range Search and Sampling | 2026 | SIGMOD | 5.093636e-05 |
| 10,315 | Fast Indexing for Temporal Information Retrieval | 2026 | SIGMOD | 5.093636e-05 |
| 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 5.093636e-05 |
| 10,776 | Relevance Queries for Interval Data | 2025 | SIGMOD | 5.093636e-05 |
| 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 468 | Fast Time Sequence Indexing for Arbitrary Lp Norms | 2000 | VLDB |
| 2 | 9,343 | R-Tree Based Indexing of Now-Relative Bitemporal Data | 1998 | VLDB |
| 3 | 1,811 | Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores | 2011 | VLDB |
| 4 | 4,988 | UpBit: Scalable In-Memory Updatable Bitmap Indexing | 2016 | SIGMOD |
| 5 | 2,115 | The Time Index: An Access Structure for Temporal Data | 1990 | VLDB |
| 6 | 10,378 | High Performance or Low Memory? An Updatable Learned Index Framework for Time-Space Tradeoff | 2026 | SIGMOD |
| 7 | 7,224 | LITS: An Optimized Learned Index for Strings | 2024 | VLDB |
| 8 | 964 | Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes | 2016 | SIGMOD |
| 9 | 6,429 | Just-In-Time Data Structures | 2015 | CIDR |
| 10 | 10,315 | Fast Indexing for Temporal Information Retrieval | 2026 | SIGMOD |