Memory-Efficient Search Trees for Database Management Systems

Summary: Memory-efficient, fast in-memory search trees for DBMSs facing DRAM–storage gaps, employing succinct structures for static, read-optimized trees. A hybrid index supports bounded amortized updates and an order-preserving compressor enables range queries on compressed keys. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6276
Venue: SIGMOD
Year: 2021
Pagerank: 4.3300131e-05
Overall Rank: 9,499 | 33.99%
DOI: 10.1145/3448016.3461470

Incoming Non-self Citations Over Time

Authors

1. Huanchen Zhang

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,779	From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads	2025	VLDB	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,160	Compression Aware Physical Database Design	2011	VLDB	5.1750659e-05
10,175	Improving LZ4 for Effective Compression and Efficient Query	2026	SIGMOD	4.1905499e-05
3,806	Distributing a Search Tree Among a Growing Number of Processors	1994	SIGMOD	6.7461245e-05
7,225	Efficient Search in Very Large Databases	1988	VLDB	4.7910249e-05
8,457	Efficient Searchable Encryption Through Compression	2018	VLDB	4.5018004e-05
235	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB	0.00031980259
1,134	Dictionary-based Order-preserving String Compression for Main Memory Column Stores	2009	SIGMOD	0.00013751593
1,098	Query Optimization In Compressed Database Systems	2001	SIGMOD	0.00014070252
5,847	Order-Preserving Key Compression for In-Memory Search Trees	2020	SIGMOD	5.3040014e-05
9,410	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD	4.3399748e-05