Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
