Cart (Loading....) | Create Account
Close category search window
 

Distributed join processing using bipartite graphs

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

2 Author(s)
Scheuermann, P. ; Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA ; Eugene Inseok Chong

Distributed query processing algorithms usually perform data reduction by using a semijoin program but the problem with these approaches is that they still require an explicit join of the reduced relations an the final phase. We introduce an efficient algorithm for join processing in distributed database systems that makes use of bipartite graphs in order to reduce data communication costs and local processing costs. The bipartite graphs represent the tuples that can be joined in two relations taking into account also the reduction state of the relations. This algorithm fully reduces the relations at each site. We then present a partitioning algorithm for response time optimization that takes into account the system configuration, i.e., the additional resources available. We also report on the results of a set of experiments that show that our algorithms outperform a number of the recently proposed methods for total processing time and response time minimization

Published in:

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date of Conference:

30 May-2 Jun 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.