Tree-Encoded Bitmaps

Summary: Tree-Encoded Bitmaps store 0/1 runs in a binary-tree: longer runs sit higher, shorter runs lower. It supports fast random access and intersections; experiments show gains over prior compression for dense or weakly clustered bitmaps, with up to 33% space savings on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5863
Venue: SIGMOD
Year: 2020
Pagerank: 5.4460774e-05
Overall Rank: 8,349 | 42.72%
DOI: 10.1145/3318464.3380588

Incoming Non-self Citations Over Time

Authors

1. Harald Lang (Technical University of Munich)
2. Alexander Beischl (Technical University of Munich)
3. Viktor Leis (Friedrich Schiller University of Jena)
4. Peter Boncz (Centrum Wiskunde & Informatica)
5. Thomas Neumann (Technical University of Munich)
6. Alfons Kemper (Technical University of Munich)

BibTeX Citation

@inproceedings{lang_sigmod20,
        title = {{Tree-Encoded Bitmaps}},
        author = {Lang, Harald and Beischl, Alexander and Leis, Viktor and Boncz, Peter and Neumann, Thomas and Kemper, Alfons},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3380588},
        url = {https://dl.acm.org/doi/10.1145/3318464.3380588},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,782	Cuckoo Index: A Lightweight Secondary Index Structure	2020	VLDB	6.5115802e-05
7,960	CUBIT: Concurrent Updatable Bitmap Indexing	2025	VLDB	5.5181056e-05
9,518	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD	5.256602e-05
11,702	LES3: Learning-based Exact Set Similarity Search	2021	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 21 of 21 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
104	Improved Query Performance with Variant Indexes	1997	SIGMOD	0.00033932213
227	Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing	1998	VLDB	0.00023958508
794	Bitmap Index Design and Evaluation	1998	SIGMOD	0.00013969303
870	BitWeaving: Fast Scans for Main Memory Data Processing	2013	SIGMOD	0.0001350293
880	SuRF: Practical Range Query Filtering with Fast Succinct Tries	2018	SIGMOD	0.00013432693
941	Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation	2016	SIGMOD	0.00013078348
970	Sybase IQ Multiplex – Designed For Analytics	2004	VLDB	0.00012882125
1,126	Adaptive Range Filters for Cold Data: Avoiding Trips to Siberia	2013	VLDB	0.00012078607
1,464	An Efficient Bitmap Encoding Scheme for Selection Queries	1999	SIGMOD	0.00010689981
1,507	Column Imprints: A Secondary Index Structure	2013	SIGMOD	0.0001054177
1,761	ByteSlice: Pushing the Envelop of Main Memory Data Processing with a New Storage Layout	2015	SIGMOD	9.8154969e-05
1,867	Performance Measurements of Compressed Bitmap Indices	1999	VLDB	9.5903618e-05
2,224	An Experimental Study of Bitmap Compression vs. Inverted List Compression	2017	SIGMOD	8.9183396e-05
2,773	On the Performance of Bitmap Indices for High Cardinality Attributes	2004	VLDB	8.1382209e-05
2,937	Column Sketches: A Scan Accelerator for Rapid and Robust Predicate Evaluation	2018	SIGMOD	7.9435581e-05
3,576	Two Birds, One Stone: A Fast, yet Lightweight, Indexing Scheme for Modern Database Systems	2017	VLDB	7.2936598e-05
3,597	Bit-Sliced Index Arithmetic	2001	SIGMOD	7.2721197e-05
4,988	UpBit: Scalable In-Memory Updatable Bitmap Indexing	2016	SIGMOD	6.4107392e-05
5,122	A Padded Encoding Scheme to Accelerate Scans by Leveraging Skew	2015	SIGMOD	6.3573169e-05
8,304	Lightweight Indexing of Observational Data in Log-Structured Storage	2014	VLDB	5.4571356e-05
9,765	Compressed Spatial Hierarchical Bitmap (cSHB) Indexes for Efficiently Processing Spatial Range Query Workloads	2015	VLDB	5.2233045e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,894	Optimizing Queries On Compressed Bitmaps	2000	VLDB
2	9,635	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD
3	2,773	On the Performance of Bitmap Indices for High Cardinality Attributes	2004	VLDB
4	1,464	An Efficient Bitmap Encoding Scheme for Selection Queries	1999	SIGMOD
5	6,246	Compact B-Trees	1979	SIGMOD
6	1,301	A Memory Efficient Reachability Data Structure Through Bit Vector Compression	2011	SIGMOD
7	1,867	Performance Measurements of Compressed Bitmap Indices	1999	VLDB
8	9,518	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD
9	2,224	An Experimental Study of Bitmap Compression vs. Inverted List Compression	2017	SIGMOD
10	5,472	Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps	2006	VLDB