作者: Robert Epstein , Michael Stonebraker , Eugene Wong
关键词: Base (topology) 、 Distributed database 、 Computer science 、 Relational model 、 Relational database 、 Heuristics 、 Distributed algorithm 、 Tuple 、 Distributed computing
摘要: In this paper we present a new algorithm for retrieving and updating data from distributed relational base. Within such base, any number of relations can be over sites. Moreover, user supplied distribution criteria optionally used to specify what site tuple belongs to.The is an efficient way process query by "breaking" the qualification into separate "pieces" using few simple heuristics. The cost considered are minimum response time communications traffic. addition, optimize separately two models communication network representing respectively ARPANET ETHERNET like networks. This being implemented as part INGRES base system.