DBScholar

Back to papers

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
6337
Venue
SIGMOD
Year
2021
Pagerank
5.2434488e-05
Overall Rank
9,635 | 33.90%
DOI
10.1145/3448016.3461470

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_sigmod21,
        title = {{Memory-Efficient Search Trees for Database Management Systems}},
        author = {Zhang, Huanchen},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3461470},
        url = {https://dl.acm.org/doi/10.1145/3448016.3461470},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,002 From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads 2025 VLDB 5.093636e-05
Previous Page 1 / 1 Next

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
Previous Page 1 / 1 Next

Semantically Similar Papers