HD tree: A novel data structure to support multi-dimensional range query for P2P networks

DOI10.1016/J.JPDC.2011.04.003zbMath1219.68046OpenAlexW2035937973MaRDI QIDQ635389

Yunfeng Gu, Azzedine Boukerche

Publication date: 19 August 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.04.003

zbMATH Keywords

DDMdata structuresrange querydistributedpeer-to-peerP2Poverlayassociative searchingdata space partitioningHD treemulti-dimensional

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Related Items (1)

HD tree: A novel data structure to support multi-dimensional range query for P2P networks

Cites Work

• HD tree: A novel data structure to support multi-dimensional range query for P2P networks
• Quad trees: A data structure for retrieval by composite keys
• Multidimensional binary search trees used for associative searching
• Viceroy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HD tree: A novel data structure to support multi-dimensional range query for P2P networks