By Topic

Using combination of join and semijoin operations for distributed query processing

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)
Ming-Syan Chen ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Yu, P.S.

A combination of join and semijoin operations is applied to minimize the communication cost for distributed query processing. A formula is developed to estimate the cardinality of a relation resulting from join operations specified by a query graph. Two important concepts which occur with the use of join operations as reducers in query processing are studied and exploited, namely, gainful semijoins and pure join attributes. Some semijoins, though not profitable themselves, may benefit from the execution of subsequent joint operations and become profitable owing to the use of join operations as reducers. Such a semijoin is termed a gainful semijoin. Also, join attributes which are not part of the output attributes are referred to as pure join attributes. A formula to estimate the cardinality of a relation resulting from a projection operation is derived. The results show the attractiveness of the approach of applying a combination of joins and semijoins as reducers to distributed query processing

Published in:

Distributed Computing Systems, 1990. Proceedings., 10th International Conference on

Date of Conference:

28 May-1 Jun 1990