By Topic

The Partition Transform Algorithm of Join Query

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

4 Author(s)
Xianxia Zou ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha ; Weijia Jia ; Jiuhui Pan ; Wei Du

Distributed data processing and information integration system usually involve join queries which are based on base relations of the data source. These queries could be repeatedly used so the results of each join query could be very large. Therefore how to reduce the induced traffic will affect the overall performance of the distributed system or information integration system. The paper introduces the algorithm of partition-based on query definition in order to reduce communication costs inside the distributed system. Experiments show that the algorithm can reduce traffic and cut down the number of partition. In addition, our technique can be applied to simplify the definition of materialized view and improve the self-maintenance efficiency.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008