Distributed query processing in a relational data base system
Robert S. Epstein, Michael R Stonebraker, Eugene Wong · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1978
In this paper we present a new algorithm for retrieving and updating data from a distributed relational data base. Within such a data base, any number of relations can be distributed over any number of sites. Moreover, a user supplied distribution criteria can optionally be used to specify what site a tuple belongs to.The algorithm is an efficient way to process any query by "breaking" the qualification into separate "pieces" using a few simple heuristics. The cost criteria considered are minimum response time and minimum communications traffic. In addition, the algorithm can optimize separately for two models of a communication network representing respectively ARPANET and ETHERNET like networks. This algorithm is being implemented as part of the INGRES data base system.
Cited by 205 works. doi:10.1145/509252.509292 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Ethernet
- Computer network development to achieve resource sharing
- The design and implementation of INGRES
- INGRES
- Implementation of integrity constraints and views by query modification
- Decomposition—a strategy for query processing
- A Distributed Data Base Version of INGRES.
- Relational Data-Base Management Systems
- An Overview of the Preliminary Design of SDD-1: A System for Distributed Databases.