By Topic

Processing Multi-Attribute Queries in Peer-to-Peer 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
$33 $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., Xian ; Zhanhuai Li ; Longbo Zhang

To process multi-attribute queries in peer-to-peer data management systems flexibly and efficiently, a scheme based on a trie-structured overlay is proposed. Putting concretely, first a mapping algorithm is designed based on a virtual partition tree, which is then used to map the multi-attribute values to their binary keys of different length according to the data distribution in the multi-attribute space without destroying their original order. Afterward, the keys are indexed with a trie-structured overlay named P-Grid. Furthermore, the algorithms processing one- dimensional data in P-Grid are extended to the multi- attribute situation. Qualitative analysis and comparison show that this scheme is closer to the goal of multi-attribute query processing in the peer-to-peer systems than the related work.

Published in:

Data, Privacy, and E-Commerce, 2007. ISDPE 2007. The First International Symposium on

Date of Conference:

1-3 Nov. 2007