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

DOI10.1007/s00453-014-9878-4zbMath1319.68061OpenAlexW2013335022MaRDI QIDQ494810

Kostas Tsichlas, Spyros Sioutas, Gerth Stølting Brodal, Christos D. 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)

Related Items (1)

D 3-Tree: A Dynamic Deterministic Decentralized Structure

Uses Software

• Chord
• BATON
• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic SkipNet
• D2-Tree: A New Overlay with Deterministic Bounds
• Know thy neighbor's neighbor
• The rainbow skip graph
• Optimal External Memory Interval Management
• Skip-webs
• A Distributed and Oblivious Heap
• Load balancing and locality in range-queriable data structures

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