Efficient progressive processing of skyline queries in peer-to-peer systems
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Peer-to-peer similarity search in metric spaces
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Popularity adaptive search in hybrid P2P systems
Journal of Parallel and Distributed Computing
A P2P strategy for QoS discovery and SLA negotiation in Grid environment
Future Generation Computer Systems
Large-scale indexing of spatial data in distributed repositories: the SD-Rtree
The VLDB Journal — The International Journal on Very Large Data Bases
Utilizing XML Clustering for Efficient XML Data Management on P2P Networks
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Distributed and Parallel Databases
Efficient range query processing in metric spaces over highly distributed data
Distributed and Parallel Databases
A flabellate overlay network for multi-attribute search
Journal of Parallel and Distributed Computing
P2P-based multidimensional indexing methods: A survey
Journal of Systems and Software
Searching the video: an efficient indexing method for video retrieval in peer to peer network
MMM'07 Proceedings of the 13th International conference on Multimedia Modeling - Volume Part II
Metric-Based similarity search in unstructured peer-to-peer systems
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Elastic and effective spatio-temporal query processing scheme on Hadoop
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. For example, a P2P auction network for real estate frequently needs to answer queries such as "select five available buildings closest to the airport". Such queries are not efficiently supported in current P2P systems. Towards an efficient and scalable P2P system capable of processing complex multi-dimensional queries, we first propose a comprehensive framework for sharing, indexing, and querying multi-dimensional data, where (i) peers with more computational power coordinate indexing and query processing, and (ii) other peers participate in part of the computation in order to achieve scalability and load-balance. Based on this framework, we propose Network-R-tree (NR-tree), a P2P adaptation of the dominant spatial index - R*-tree. NR-tree, indexing spatial data at clustered peers, is capable of processing complex queries such as range queries and k-nearest neighbor queries. We propose query processing algorithms for range and k-nearest neighbor queries and experimentally prove the effectiveness of proposed techniques with real data.