D^3-tree: a dynamic deterministic decentralized structure

DOI10.1007/978-3-662-48350-3_82MaRDI QIDQ3452858zbMATH OpenOpenAlexFDO

Authors Spyros Sioutas, Efrosini Sourla, Kostas Tsichlas, Christos Zaroliagis

Publication date 19 November 2015

Published in Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48350-3_82

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05)

Recommendations

• \(D^2\)-tree: a new overlay with deterministic bounds
• \(D^{2}\)-tree: a new overlay with deterministic bounds
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Distributed search trees: fault tolerance in an asynchronous environment
• Balanced distributed search trees do not exist

Cites work

• \(D^2\)-tree: a new overlay with deterministic bounds
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• A Distributed and Oblivious Heap

Cited in

(6)

• \(D^{2}\)-tree: a new overlay with deterministic bounds
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• scientific article; zbMATH DE number 1755564 (Why is no real title available?)
• \(D^2\)-tree: a new overlay with deterministic bounds
• Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time
• The hyperring: a low-congestion deterministic data structure for distributed environments

Describes a project that uses

Uses Software

• Chord
• BATON

This page was built for publication: \(D^{3}\)-tree: a dynamic deterministic decentralized structure

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