DocumentCode :
970377
Title :
A Method for Processing Distributed Database Queries
Author :
Perrizo, William
Author_Institution :
Department of Computer Science, North Dakota State University, Fargo, ND 58105.
Issue :
4
fYear :
1984
fDate :
7/1/1984 12:00:00 AM
Firstpage :
466
Lastpage :
471
Abstract :
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.
Keywords :
Concurrent computing; Control systems; Costs; Data models; Database systems; Delay; Distributed computing; Distributed databases; Query processing; Relational databases; Attribute independence; distributed database system; distributed query processing; equijoin operation; relational data model; semijoin;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/TSE.1984.5010262
Filename :
5010262
Link To Document :
بازگشت