Query Processing in a Fragmented Relational Distributed System: Mermaid

1 August 1985

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering

Vol. SE-11 (8) , 795-810
https://doi.org/10.1109/TSE.1985.232528

Abstract

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.

Keywords

QUERY PROCESSING
RELATIONAL DATABASES
TRANSACTION DATABASES
ALGORITHM DESIGN AND ANALYSIS
DELAY
SPATIAL DATABASES
COSTS
PARALLEL PROCESSING
ASSEMBLY
DATABASE LANGUAGES

This publication has 0 references indexed in Scilit: