The Community for Technology Leaders
Green Image
Issue No. 03 - May (1979 vol. 5)
ISSN: 0098-5589
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.
system modeling, Computer network, database, distributed database systems, distributed processing, distribution strategy, heuristic algorithms, query processing, redundant data, relational data model

S. Yao and A. Hevner, "Query Processing in Distributed Database System," in IEEE Transactions on Software Engineering, vol. 5, no. , pp. 177-187, 1979.
86 ms
(Ver 3.3 (11022016))