This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Query Processing in a Fragmented Relational Distributed System: Mermaid
August 1985 (vol. 11 no. 8)
pp. 795-810
C.T. Yu, Department of Electrical Engineering and Computer Science, University of Illinois
This paper describes the query optimizer of the Mermaid system which provides a user with a unified view of multiple preexisting databases which may be stored under different DBMS's. The algorithm is designed for databases which may contain replicated or fragmented relations and for users who are primarily making interactive, ad hoc queries. Although the implementation of the algorithm is a front-end system, not an integrated distributed DBMS, it should be applicable to a distributed DBMS also.
Index Terms:
semijoin, Algorithm, distributed query processing, dynamic estimation
Citation:
C.T. Yu, C.C. Chang, M. Templeton, D. Brill, E. Lund, "Query Processing in a Fragmented Relational Distributed System: Mermaid," IEEE Transactions on Software Engineering, vol. 11, no. 8, pp. 795-810, Aug. 1985, doi:10.1109/TSE.1985.232528
Usage of this product signifies your acceptance of the Terms of Use.