ADST: An order preserving scalable distributed data structure with constant access costs

DOI10.1007/3-540-45627-9_18MaRDI QIDQ4473987zbMATH OpenFDO

Authors Adriano di Pasquale, Enrico Nardelli

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2234/22340211.htm

zbMATH Keywords

message passing environmentmulti-dimensional searchscalable distributed data structure

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A very efficient order preserving scalable distributed data structure
• A Dynamic Distributed Data Structure for Top-k and k-Select Queries
• Compact and localized distributed data structures
• Distributed search trees: fault tolerance in an asynchronous environment
• Algorithms and Computation
• Structural Information and Communication Complexity
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
• The splay-list: a distribution-adaptive concurrent skip-list

Cited in

(2)

• ADST
• A very efficient order preserving scalable distributed data structure

This page was built for publication: ADST: An order preserving scalable distributed data structure with constant access costs

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