This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Query Processing in Distributed Database System
May 1979 (vol. 5 no. 3)
pp. 177-187
A.R. Hevner, Department of Computer Science, Purdue University
Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed.
Index Terms:
system modeling, Computer network, database, distributed database systems, distributed processing, distribution strategy, heuristic algorithms, query processing, redundant data, relational data model
Citation:
A.R. Hevner, S.B. Yao, "Query Processing in Distributed Database System," IEEE Transactions on Software Engineering, vol. 5, no. 3, pp. 177-187, May 1979, doi:10.1109/TSE.1979.234179
Usage of this product signifies your acceptance of the Terms of Use.