RAQ: A range-queriable distributed data structure

DOI10.1007/978-3-540-30577-4_30MaRDI QIDQ5711543zbMATH OpenOpenAlexFDO

Authors Hamid Nazerzadeh, Mohammad Ghodsi

Publication date 7 December 2005

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

Full work available at URL https://doi.org/10.1007/b105088

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• G-Grid: A class of scalable and self-organizing data structures for multi-dimensional querying and content routing in P2P networks
• Enhanced lookup queries for large-scale distributed data structures
• Algorithms and Computation
• HD tree: A novel data structure to support multi-dimensional range query for P2P networks
• Multidimensional data querying on tree-structured overlay

Cited in

(6)

• DAQV: Distributed Array Query and Visualization Framework
• Approaching neighbor proximity and load balance for range query in P2P networks
• Enhanced lookup queries for large-scale distributed data structures
• G-Grid: A class of scalable and self-organizing data structures for multi-dimensional querying and content routing in P2P networks
• Algorithms and Computation
• HD tree: A novel data structure to support multi-dimensional range query for P2P networks

This page was built for publication: RAQ: A range-queriable distributed data structure

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