By Topic

A Method for Processing Distributed Database 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
$33 $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

1 Author(s)
William Perrizo ; Department of Computer Science, North Dakota State University, Fargo, ND 58105.

The efficient processing of distributed database queries is of great importance in a distributed database management system. The algorithm-S described in this research is very efficient and low in complexity. The algorithm assumes uniformly distributed data within the attributes of a relation and data independence across attributes. Natural data reductions which occur in nonjoining attributes with iow data multiplicity are recognized. The method can give far more efficient solutions than methods which ignore these reductions. The processing strategies generated exhibit low response time as well as low total transmission time regardless of the cost objective employed.

Published in:

IEEE Transactions on Software Engineering  (Volume:SE-10 ,  Issue: 4 )