Demonstrating Indexing for Near-Sorted Data
Summary: Demonstrates how B+-trees waste work on pre-/near-sorted data, compared with tail-leaf optimization, SWARE, and QuIT. Interactive visualization exposes ingestion behavior and quantifies the performance gains from exploiting intrinsic order. (summarized by gpt-5.6-luna on Aug 28 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Aneesh Raman (Boston University)
- 2. Philip Chindris (Boston University)
- 3. Anwesha Saha (Boston University)
- 4. Teona Bagashvili (Boston University)
- 5. Manos Athanassoulis (Boston University)
BibTeX Citation
@article{raman_vldb26,
title = {{Demonstrating Indexing for Near-Sorted Data}},
author = {Raman, Aneesh and Chindris, Philip and Saha, Anwesha and Bagashvili, Teona and Athanassoulis, Manos},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {12},
pages = {4694--4697},
doi = {10.14778/3827998.3828099},
url = {https://doi.org/10.14778/3827998.3828099},
year = {2026}
}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 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 216 | Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing | 1998 | VLDB | 0.00024485024 |
| 1,510 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010438563 |
| 4,364 | An Evaluation of Generic Bulk Loading Techniques | 2001 | VLDB | 6.6343719e-05 |
| 4,971 | Efficient Bulk Updates on Multiversion B-trees | 2013 | VLDB | 6.3328967e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,821 | Making In-Memory Learned Indexes Efficient on Disk | 2024 | SIGMOD |
| 2 | 848 | Benchmarking Learned Indexes | 2021 | VLDB |
| 3 | 8,378 | Tuning Hierarchical Learned Indexes on Disk and Beyond | 2022 | SIGMOD |
| 4 | 6,578 | Workload-Aware Indexing of Continuously Moving Objects | 2009 | VLDB |
| 5 | 3,566 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD |
| 6 | 6,452 | Just-In-Time Data Structures | 2015 | CIDR |
| 7 | 3,697 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB |
| 8 | 2,064 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 9 | 7,970 | Efficient B-tree Based Indexing for Cloud Data Processing | 2010 | VLDB |
| 10 | 1,539 | Sorting And Indexing With Partitioned B-Trees | 2003 | CIDR |