Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network
IEEE Transactions on Software Engineering
Partition Strategy for Distributed Query Processing in Fast Local Networks
IEEE Transactions on Software Engineering
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query Optimization in Multidatabase Systems
Distributed and Parallel Databases
Outerjoin optimization in multidatabase systems
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Semantic Query Optimization for Tree and Chain Queries
IEEE Transactions on Knowledge and Data Engineering
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities
IEEE Transactions on Knowledge and Data Engineering
A Theory of Translation From Relational Queries to Hierarchical Queries
IEEE Transactions on Knowledge and Data Engineering
A Parallel Execution Method for Minimizing Distributed Query Response Time
IEEE Transactions on Parallel and Distributed Systems
Performance Issues in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
Basis of a Partially Informed Distributed Database
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Design issues in distributed multidatabase systems
SAC '86 Proceedings of the 1986 workshop on Applied computing
Multidatabase services: issues and architectural design
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Distributed/Heterogeneous Query Processing in Microsoft SQL Server
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient data distribution strategy for join query processing in the cloud
Proceedings of the third international workshop on Cloud data management
| Hi-index | 0.00 |
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.