D^2-tree: a new overlay with deterministic bounds

DOI10.1007/S00453-014-9878-4MaRDI QIDQ494810zbMATH OpenOpenAlexFDO

Authors Spyros Sioutas, Kostas Tsichlas, Gerth Stølting Brodal, Christos Zaroliagis

Publication date 2 September 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-014-9878-4

zbMATH Keywords

decentralized systemdistributed data structureindexing schemeload-balancingoverlay

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• \(D^{2}\)-tree: a new overlay with deterministic bounds
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• Balanced binary trees for ID management and load balance in distributed hash tables
• Simple efficient load-balancing algorithms for peer-to-peer systems
• Global Computing

Cites work

• \(D^{2}\)-tree: a new overlay with deterministic bounds
• A Distributed and Oblivious Heap
• Deterministic SkipNet
• Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Load balancing and locality in range-queriable data structures
• Optimal External Memory Interval Management
• Skip-webs, efficient distributed data structures for multi-dimensional data sets
• The rainbow skip graph

Cited in

(4)

• \(D^{2}\)-tree: a new overlay with deterministic bounds
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure
• Balanced binary trees for ID management and load balance in distributed hash tables
• Self-stabilizing overlays for high-dimensional monotonic searchability

Describes a project that uses

Uses Software

• Chord
• BATON
• Pastry

This page was built for publication: \(D^2\)-tree: a new overlay with deterministic bounds

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