Query Processing in Distributed Database System
Alan R. Hevner, S. Bing Yao · IEEE Transactions on Software Engineering · 1979
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.
Cited by 212 works. doi:10.1109/tse.1979.234179
Authors
References
- A relational model of data for large shared data banks
- A relational model of data for large shared data banks
- The notions of consistency and predicate locks in a database system
- Decomposition—a strategy for query processing
- A Distributed Data Base Version of INGRES.
- A survey of research and development in distributed database management
- Distributed query processing in a relational data base system
- Optimization of query evaluation algorithms
- An Overview of the Preliminary Design of SDD-1: A System for Distributed Databases.
- Optimization of Data Access in Distributed Systems