Skip-webs, efficient distributed data structures for multi-dimensional data sets

DOI10.1145/1073814.1073827MaRDI QIDQ5177225zbMATH OpenOpenAlexFDO

Authors Lars Arge, David Eppstein, Michael T. Goodrich

Publication date 10 March 2015

Published in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1073814.1073827

zbMATH Keywords

distributed data structuresoctreespeer-to-peer networksquadtreesskip liststrapezoidal mapstries

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Algorithms and Computation
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• The skip quadtree
• A deterministic skip list for \(k\)-dimensional range search
• Distributed searching of multi-dimensional data: A performance evaluation study

Cited in

(6)

• Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets
• scientific article; zbMATH DE number 1755564 (Why is no real title available?)
• \(D^2\)-tree: a new overlay with deterministic bounds
• The skip quadtree
• Load balancing and locality in range-queriable data structures
• Algorithms and Computation

This page was built for publication: Skip-webs, efficient distributed data structures for multi-dimensional data sets

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