A read/write balanced high-performance key-value store

DOI10.3969/J.ISSN.0253-2778.2020.06.015MaRDI QIDQ5017306zbMATH OpenFDO

Authors

Publication date 17 December 2021

Full work available at URL https://doi.org/10.3969/J.ISSN.0253-2778.2020.06.015

zbMATH Keywords

key-value separationlog-structured merge treerange querywrite amplification

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Recommendations

• Optimal Bloom filters and adaptive merging for LSM-trees
• The log-structured merge-tree (LSM-tree)
• Distributed secondary index based on LSM tree
• Primary key management in distributed log-structured database systems
• An efficient B\(^{+}\)-tree design for main-memory database systems with strong access locality

Cited in

(4)

• The log-structured merge-tree (LSM-tree)
• Distributed secondary index based on LSM tree
• Optimal Bloom filters and adaptive merging for LSM-trees
• Primary key management in distributed log-structured database systems

This page was built for publication: A read/write balanced high-performance key-value store

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017306)