Two Birds, One Stone: A Fast, yet Lightweight, Indexing Scheme for Modern Database Systems

Summary: Hippo indexes page ranges, not tuple pointers, using lightweight histograms and distribution-based grouping to prune irrelevant pages. It delivers B+-Tree-like selective-query performance with up to 100× lower space and 1,000× lower maintenance overhead. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: hded90e62c868e9a3
Venue: VLDB
Year: 2017
Pagerank: 7.1788912e-05
Overall Rank: 3,597 | 75.82%
DOI: 10.14778/3025111.3025120

Incoming Non-self Citations Over Time

Authors

1. Jia Yu (Arizona State University)
2. Mohamed Sarwat (Arizona State University)

BibTeX Citation

@article{yu_vldb17,
        title = {{Two Birds, One Stone: A Fast, yet Lightweight, Indexing Scheme for Modern Database Systems}},
        author = {Yu, Jia and Sarwat, Mohamed},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {4},
        doi = {10.14778/3025111.3025120},
        url = {https://doi.org/10.14778/3025111.3025120},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
40	The Case for Learned Index Structures	2018	SIGMOD	0.00046284649
779	FITing-Tree: A Data-aware Index Structure	2019	SIGMOD	0.00014030069
2,238	Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations	2019	SIGMOD	8.7751619e-05
3,073	Pushing Data-Induced Predicates Through Joins in Big-Data Clusters	2020	VLDB	7.6777283e-05
8,199	Sieve: A Learned Data-Skipping Index for Data Analytics	2023	VLDB	5.3788727e-05
8,495	Provenance-based Data Skipping	2022	VLDB	5.3304338e-05
8,500	Tree-Encoded Bitmaps	2020	SIGMOD	5.3296886e-05
11,126	Dynamic Pruning for Recursive Joins	2025	SIGMOD	4.9793485e-05
12,178	HERMIT in Action: Succinct Secondary Indexing Mechanism via Correlation Exploration	2019	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
34	The Design Of Postgres	1986	SIGMOD	0.00049142315
216	Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing	1998	VLDB	0.00024485024
1,428	Knowing When You’re Wrong: Building Fast and Reliable Approximate Query Processing Systems	2014	SIGMOD	0.00010693831
1,510	BF-Tree: Approximate Tree Indexing	2014	VLDB	0.00010438563
1,529	Column Imprints: A Secondary Index Structure	2013	SIGMOD	0.00010348765
1,793	The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation	2000	VLDB	9.6235776e-05
1,916	The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing	2014	SIGMOD	9.3837729e-05
2,819	On the Performance of Bitmap Indices for High Cardinality Attributes	2004	VLDB	7.9715832e-05
3,750	NET-FLi: On-the-fly Compression, Archiving and Indexing of Streaming Network Traffic	2010	VLDB	7.0527908e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,064	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB
2	5,131	Holistic Indexing in Main-memory Column-stores	2015	SIGMOD
3	1,836	Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores	2011	VLDB
4	3,375	A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms	2016	SIGMOD
5	8,532	AirIndex: Versatile Index Tuning Through Data and Storage	2023	SIGMOD
6	5,537	Updatable Learned Indexes Meet Disk-Resident DBMS - From Evaluations to Design Choices	2023	SIGMOD
7	1,550	Updatable Learned Index with Precise Positions	2021	VLDB
8	8,378	Tuning Hierarchical Learned Indexes on Disk and Beyond	2022	SIGMOD
9	7,154	Adaptive Hybrid Indexes	2022	SIGMOD
10	971	Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes	2016	SIGMOD