Balanced distributed search trees do not exist

DOI10.1007/3-540-60220-8_50MaRDI QIDQ5057421zbMATHOpenAlexWikidataFDO

Authors Brigitte Kröll, Peter Widmayer

Publication date 16 December 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60220-8_50

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Height balance distribution of search trees
• Binary search trees: How low can you go?
• Randomized search trees
• Distributed search trees: fault tolerance in an asynchronous environment

Cites work

• Balanced distributed search trees do not exist

Cited in

(9)

• Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Distributing a \(B^+\)-tree in a loosely coupled environment
• Maintaining balanced trees for structured distributed streaming systems
• Balanced distributed search trees do not exist
• scientific article; zbMATH DE number 2006661 (Why is no real title available?)
• scientific article; zbMATH DE number 936823 (Why is no real title available?)
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• Maintaining balanced trees for structured distributed streaming systems

This page was built for publication: Balanced distributed search trees do not exist

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