By Topic

Processing of multiple processing queries in distributed databases

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)
Lu, A.Y. ; Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA ; Sheu, P.C.-Y.

A set of algorithms is described that can be used to reduce the complexity of evaluating multiple queries of a transaction in a distributed environment. With the consideration of conjunct sharing, it compiles a set of queries into a network based on the concept of semijoins. As some of the queries in a transaction may change the contents of a database, evaluation of the network corresponding to the transaction is synchronized into several phases so that the dependencies among the queries can be properly captured. It is shown how a transaction that includes database updates can be evaluated incrementally in multiple phases such that the states of the evaluation process can be saved and only part of the transaction which is affected by a change needs to be reevaluated. The algorithms described can be applied to relational databases with slight modifications

Published in:

Data Engineering, 1991. Proceedings. Seventh International Conference on

Date of Conference:

8-12 Apr 1991