Indexing For Near-Sorted Data in Action

Workload Parameters

N # of elements

K % out-of-order

L % max displacement

α Alpha

β Beta

Presets

SWARE Buffer-based

QuIT Tree-based

Tail Tree-based

lil Tree-based

B+ Tree Tree-based

Results

# Pages Manually Sorted

SWARE

QuIT

—

Avg Pages per Flush

SWARE

4.2

QuIT

—

# Pages Bulk Loaded

SWARE

QuIT

# Fast Inserts

SWARE

QuIT

# Top Inserts

SWARE

QuIT

# Fast Path Resets

SWARE

—

QuIT

For more details check our papers!

Aneesh Raman, Konstantinos Karatsenidis, Shaolin Xie, Matthaios Olma, Subhadeep Sarkar, Manos Athanassoulis
QuIT your B+-tree for the Quick Insertion Tree [PDF]
In Proceedings of the 28th International Conference on Extending Database Technology (EDBT), 2025.

Aneesh Raman, Andy Huynh, Jinqi Lu, Manos Athanassoulis
Benchmarking Learned and LSM Indexes for Data Sortedness [PDF]
In Proceedings of the 10th International Workshop on Testing Database Systems (DBTest), 2024.

Aneesh Raman, Subhadeep Sarkar, Matthaios Olma, Manos Athanassoulis
Indexing for Near-Sorted Data [PDF]
In Proceedings of the 39th IEEE International Conference on Data Engineering (ICDE), 2023.

Aneesh Raman, Konstantinos Karatsenidis, Subhadeep Sarkar, Matthaios Olma, Manos Athanassoulis
BoDS: A Benchmark on Data Sortedness [PDF]
In Performance Evaluation and Benchmarking - 14th TPC Technology Conference (TPCTC), 2022.

Meet The Team

Philip Chindris

High School Intern

Anwesha Saha

PhD Researcher

Teona Bagashvili

PhD Researcher

Aneesh Raman

PhD Reseacher

Manos Athanassoulis

Assistant Professor