Multidimensional binary search trees used for associative searching
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Energy and quality aware query processing in wireless sensor database systems
Information Sciences: an International Journal
A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Skyframe: a framework for skyline query processing in peer-to-peer systems
The VLDB Journal — The International Journal on Very Large Data Bases
Skyline-based Peer-to-Peer Top-k Query Processing
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distributed routing in wireless sensor networks using energy welfare metric
Information Sciences: an International Journal
Topology-aware routing in structured peer-to-peer overlay networks
Future directions in distributed computing
An efficient mechanism for processing similarity search queries in sensor networks
Information Sciences: an International Journal
Top-k query evaluation in sensor networks under query response time constraint
Information Sciences: an International Journal
Information Sciences: an International Journal
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks
Information Sciences: an International Journal
An optimal time algorithm for minimum linear arrangement of chord graphs
Information Sciences: an International Journal
| Hi-index | 0.07 |
Nowadays, as the mobile services become widely used, there is a strong demand for mobile support in P2P search techniques. In this paper, we introduce a new cost model for searching multi-dimensional data in mobile P2P environment and propose a novel multi-dimensional mobile P2P search framework called MIME. MIME models the physical node layout in a two-dimensional plane and keeps records of the locations of the nodes to construct a proximity-aware P2P overlay. MIME is able to employ two different split schemes for the construction of the overlay. We propose query processing techniques for such P2P overlay. In addition, we employ a novel expanding method for tuning the performance of KNN queries in MIME. We also discuss two adaptive features incorporated into MIME to support mobility: an update algorithm that makes dynamic updates to the overlay, and a cache mechanism that reduces the load of data migration during the updates. The experimental results show that the proposed techniques are effective, and that MIME achieves significant performance improvements in Point, Range, and KNN queries compared to the conventional system.