Distributed search trees: fault tolerance in an asynchronous environment

DOI10.1007/S00224-003-1121-7MaRDI QIDQ1762993zbMATH OpenOpenAlexFDO

Authors Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer

Publication date 11 February 2005

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

Full work available at URL http://hdl.handle.net/20.500.11850/53343

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Optimization of distributed tree queries
• scientific article; zbMATH DE number 3990855
• A distributed algorithm for computing the node search number in trees
• scientific article; zbMATH DE number 2006661
• Distributing a \(B^+\)-tree in a loosely coupled environment
• scientific article; zbMATH DE number 936823
• Fault-tolerant computation of distributed regular path queries
• Distributed tree comparison with nodes of limited memory

Cited in

(6)

• Nagging: A scalable fault-tolerant paradigm for distributed search
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• scientific article; zbMATH DE number 2080920 (Why is no real title available?)
• Balanced distributed search trees do not exist
• Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time

This page was built for publication: Distributed search trees: fault tolerance in an asynchronous environment

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