By Topic

Supporting Multi-attribute Queries in Peer-to-Peer Data Management Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Min Yu ; Northwestern Polytech. Univ., Xi''an ; Zhanhuai Li ; Longbo Zhang

Supporting relational query processing or dealing with spatial objects in peer-to-peer(P2P) data management systems needs multi-attribute exact match query processing and multi-attribute range query processing. A scheme to support these queries in P2P data management systems is proposed. By using a multi-attribute order-preserving hash mapping based on a virtual partition tree and indexing the generated keys of the multi-attribute data using P-Grid, data are partitioned dynamically among the dynamic set of peers. After that, a multi-attribute exact match query algorithm and two multi-attribute range query algorithms based on this partitioning strategy are proposed. Finally, two load balancing mechanisms are designed to ensure load balancing when the scheme works in a situation where data distribution in the multi-attribute data space is extremely skewed. Initial analysis shows that this work is effective and efficient.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2007. PDCAT '07. Eighth International Conference on

Date of Conference:

3-6 Dec. 2007