DBScholar

Back to papers

Trie Memtables in Cassandra

Summary: Trie memtable for Cassandra; prefix trees and byte-comparable keys; DSE 6.8 in production, CEP-19. Faster updates/lookups, smaller footprint, and reduced GC via fixed-size blocks in large preallocated buffers; architecture and gains shown. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
13002
Venue
VLDB
Year
2022
Pagerank
5.1874949e-05
Overall Rank
9,965 | 31.64%
DOI
10.14778/3554821.3554828

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lambov_vldb22,
        title = {{Trie Memtables in Cassandra}},
        author = {Lambov, Branimir},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {12},
        pages = {3359--3371},
        doi = {10.14778/3554821.3554828},
        url = {https://doi.org/10.14778/3554821.3554828},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,368 Accelerating String-key Learned Index Structures via Memoization-based Incremental Training 2024 VLDB 5.6315363e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
880 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013432693
Previous Page 1 / 1 Next

Semantically Similar Papers