| R. S. Epstein and M. Stonebraker, "Analysis of query processing strategies for distributed database systems." sixth international conference on very large databases, Montreal, October, 1980. |
....of partitioning cost with little penalty. For example, once one arrives at the set of joins that minimize the number of repartitionings, one can order these joins based on other criteria, such as size. For a discussion of other such criteria, see [JK84, U82] for reviews and original papers [AHY83, BGWRR81, ES80, GS81, GS82, HY79, Schk82, WY76]. 2. Terminology A relation scheme R is a finite set of attributes A 1 , A n . Associated with each attribute A i is a domain denoted dom(A i ) A relation instance r on scheme R is a finite set of mappings t 1 , t m from R to the set of domains such that for each t r, t(A ....
R. S. Epstein and M. Stonebraker, "Analysis of query processing strategies for distributed database systems." sixth international conference on very large databases, Montreal, October, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC