A very efficient order preserving scalable distributed data structure

DOI10.1007/3-540-44759-8_20MaRDI QIDQ4535443zbMATH OpenFDO

Authors Adriano di Pasquale, Enrico Nardelli

Publication date 16 June 2002

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/2113/21130186

zbMATH Keywords

message passing environmentmulti-dimensional searchScalable distributed data structure

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2080920
• Fully dynamic distributed search trees can be balanced in \(O(\lg^{2} N)\) time.
• Skip-webs, efficient distributed data structures for multi-dimensional data sets
• Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time
• \(D^{3}\)-tree: a dynamic deterministic decentralized structure

Cited in

(2)

• Distributed paged hash tables
• scientific article; zbMATH DE number 2080920 (Why is no real title available?)

Describes a project that uses

Uses Software

• ADST

This page was built for publication: A very efficient order preserving scalable distributed data structure

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