Space-efficient B trees via load-balancing

DOI10.1007/S00224-025-10238-7MaRDI QIDQ6905973zbMATH OpenFDO

Authors Tomohiro I, Dominik Köppl, Hiroshi Sakamoto, Sohei Yamaguchi

Publication date 5 November 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-025-10238-7

zbMATH Keywords

B-treepredecessor data structuresuccinct data structure

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• A compact data structure for representing a dynamic multiset
• A framework of dynamic data structures for string processing
• Compact representations of ordered sets
• Compressed Data Structures for Dynamic Sequences
• Compressed Prefix Sums
• Dynamic integer sets with optimal rank, select, and predecessor search
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Efficient Storage and Retrieval by Content and Address of Static Files
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 140457 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 2038723 (Why is no real title available?)
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• Optimal dynamic sequence representations
• Optimal implicit dictionaries over unbounded universes
• Rank/select on dynamic compressed sequences and applications
• Space-efficient B trees via load-balancing
• Succinct representation of dynamic trees
• The string B-tree
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Universal codeword sets and representations of the integers

This page was built for publication: Space-efficient B trees via load-balancing

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