ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Transactions and consistency in distributed database systems
ACM Transactions on Database Systems (TODS)
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
CONVERT: a high level translation definition language for data conversion
Communications of the ACM
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Implementation of a structured English query language
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
An algebra of quotient relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Formal definition of mappings in a data base
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Principles of Database Systems
Principles of Database Systems
Petri-Net-Based Modeling and Evaluation of Pipelined Processing of Concurrent Database Queries
IEEE Transactions on Software Engineering
Parallelizing a database programming language
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
The complexity of operations on a fragmented relation
ACM Transactions on Database Systems (TODS)
A detailed statistical model for relational query optimization
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Extending the Algebraic Framework of Query Processing to Handle Outerjoins
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Flexible Relations - Operational Support of Variant Relational Structures
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Maintenance of Placement Dependency in Distributed Multidatabase Systems
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Computers and Operations Research
Decision support in a distributed environment
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Computers and Operations Research
An execution environment for C-SPARQL queries
Proceedings of the 13th International Conference on Extending Database Technology
Minimal data sets vs. synchronized data copies in a schema and data versioning system
Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management
| Hi-index | 0.00 |
A major requirement of a Distributed DataBase Management System (DDBMS) is to enable users to write queries as though the database were not distributed (distribution transparency). The DDBMS transforms the user's queries into execution strategies, that is, sequences of operations on the various nodes of the network and of transmissions between them. An execution strategy on a distributed database is correct if it returns the same result as if the query were applied to a nondistributed database.This paper analyzes the correctness problem for query execution strategies. A formal model, called Multirelational Algebra, is used as a unifying framework for this purpose. The problem of proving the correctness of execution strategies is reduced to the problem of proving the equivalence of two expressions of Multirelational Algebra. A set of theorems on equivalence is given in order to facilitate this task.The proposed approach can be used also for the generation of correct execution strategies, because it defines the rules which allow the transformation of a correct strategy into an equivalent one. This paper does not deal with the problem of evaluating equivalent strategies, and therefore is not in itself a proposal for a query optimizer for distributed databases. However, it constitutes a theoretical foundation for the design of such optimizers.