Space-efficient B trees via load-balancing

DOI10.1007/978-3-031-06678-8_24OpenAlexW4285271432MaRDI QIDQ2169966

Dominik Köppl, Tomohiro I.

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_24

zbMATH Keywords

succinct data structureB treepredecessor data structure

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Uses Software

• DYNAMIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Succinct representation of dynamic trees
• Rank/select on dynamic compressed sequences and applications
• A compact data structure for representing a dynamic multiset
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Optimal implicit dictionaries over unbounded universes
• Organization and maintenance of large ordered indexes
• The string B-tree
• Compressed Data Structures for Dynamic Sequences
• Efficient Storage and Retrieval by Content and Address of Static Files
• Optimal Dynamic Sequence Representations
• Compressed Prefix Sums