ACM Computing Surveys (CSUR)
Optimization of join operations in horizontally partitioned database systems
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori
Fundamentals of Computer Alori
On the design of a query processing strategy in a distributed database environment
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Methodology for allocating resources for data quality enhancement
Communications of the ACM
Partition Strategy for Distributed Query Processing in Fast Local Networks
IEEE Transactions on Software Engineering
Models for the Combined Logical and Physical Design of Databases
IEEE Transactions on Computers
Dynamic distributed query processing techniques
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Optimizing equijoin queries in distributed databases where relations are hash partitioned
ACM Transactions on Database Systems (TODS)
Correcting execution of distributed queries
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Time-Constrained Query Processing in CASE-DB
IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Distributed Query Optimization
IEEE Transactions on Knowledge and Data Engineering
Performance Issues in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
An Iterative Method for Distributed Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A systematic approach to the integration of overlapping partitions in service-oriented data grids
Future Generation Computer Systems
| Hi-index | 0.02 |
This paper addresses the problem of optimizing queries that involve set operations (set queries) in a distributed relational database system. A particular emphasis is put on the optimization of such queries in horizontally partitioned database systems. A mathematical programming model of the set query problem is developed and its NP-completeness is proved. Solution procedures are proposed and computational results presented. One of the main results of the computational experiments is that, for many queries, the solution procedures are not sensitive to errors in estimating the size of results of set operations.