DBScholar

Back to papers

AITTI: Augmented Interval Tree for Temporal Indexing

Summary: AITTI revisits temporal indexing for modern in-memory workloads: an interval-tree backbone indexes validity time, while a novel per-node structure handles open-ended range filters on object attributes. Theoretical analysis and real-data experiments demonstrate efficient search and updates, outperforming prior indexes. (summarized by gpt-6-luna on Oct 22 2026)

Paper ID
h17baff38c5b494d6
Venue
SIGMOD
Year
2027
Pagerank
4.9605343e-05
Overall Rank
10,378 | 30.44%
DOI
10.1145/3837093
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{simatis_sigmod27,
        title = {{AITTI: Augmented Interval Tree for Temporal Indexing}},
        author = {Simatis, Panagiotis and Bouros, Panagiotis and Amagata, Daichi and Tsakalidis, Konstantinos and Mamoulis, Nikos},
        series = {{SIGMOD} '27},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3837093},
        url = {https://dl.acm.org/doi/10.1145/3837093},
        year = {2027}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0019892478
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011386412
8 The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes 1981 SIGMOD 0.00081207565
1,091 Managing Intervals Efficiently in Object-Relational Databases 2000 VLDB 0.0001205609
1,514 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) 1999 PODS 0.00010391649
2,012 Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data 2004 VLDB 9.1799412e-05
2,034 The Time Index: An Access Structure for Temporal Data 1990 VLDB 9.1378213e-05
2,069 Path Caching: A Technique for Optimal External Searching (Extended Abstract) 1994 PODS 9.0678883e-05
2,489 Timeline Index: A Unified Data Structure for Processing Queries on Temporal Data in SAP HANA 2013 SIGMOD 8.379041e-05
3,517 Coalescing in Temporal Databases 1996 VLDB 7.220733e-05
6,882 Computing Complex Temporal Join Queries Efficiently 2022 SIGMOD 5.6412354e-05
7,391 HINT: A Hierarchical Index for Intervals in Main Memory 2022 SIGMOD 5.5208477e-05
8,773 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 5.2682366e-05
9,619 Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases 2005 VLDB 5.1376962e-05
10,535 FIRAS: A Framework for Interval Range Search and Sampling 2026 SIGMOD 4.9605343e-05
10,602 Fast Indexing for Temporal Information Retrieval 2026 SIGMOD 4.9605343e-05
11,262 Relevance Queries for Interval Data 2025 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 2,857 Transaction Time Indexing with Version Compression 2008 VLDB
2 10,085 Adaptive Indexing of Objects with Spatial Extent 2023 VLDB
3 6,466 Just-In-Time Data Structures 2015 CIDR
4 3,742 The BT-Tree: A Branched and Temporal Access Method 2000 VLDB
5 5,609 Efficient Computation of Temporal Aggregates with Range Predicates 2001 PODS
6 8,773 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD
7 9,560 R-Tree Based Indexing of Now-Relative Bitemporal Data 1998 VLDB
8 9,619 Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases 2005 VLDB
9 10,602 Fast Indexing for Temporal Information Retrieval 2026 SIGMOD
10 2,034 The Time Index: An Access Structure for Temporal Data 1990 VLDB