By Topic

A dynamic interquery optimization method for achieving data sharing among concurrent queries

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)
Mikkilineni, K. ; Honeywell Corp. Syst. Dev. Div., Golden Valley, MN, USA ; Su, S.

A method, called dynamic interquery optimization, for identifying and sharing the intermediate/final results produced by the relational algebraic operations of concurrent database queries is presented. This method determines if any portion of a new query will produce results that are identical to, or are a subset of, the results that have already been produced or are being produced by any executing query operation. Query tree matching and merging algorithms are also given. The computational overhead of the proposed method is analyzed, and cost formulas for calculating the matching time required for establishing different types of matches are provided. The complexity of matching and merging of query trees is compared with the execution-time savings resulting from the elimination of redundant operations. The results verify the benefits of intermediate data sharing

Published in:

Distributed Computing Systems in the 1990s, 1988. Proceedings., Workshop on the Future Trends of

Date of Conference:

14-16 Sep 1988