Set query optimization in distributed database systems
- 1 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 11 (3) , 265-293
- https://doi.org/10.1145/6314.6488
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Optimization of join operations in horizontally partitioned database systemsACM Transactions on Database Systems, 1986
- Distributed query processingACM Computing Surveys, 1984
- Optimization Algorithms for Distributed QueriesIEEE Transactions on Software Engineering, 1983
- Topological design of centralized computer networks—formulations and algorithmsNetworks, 1982
- Query processing in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1981
- Query Processing in Distributed Database SystemIEEE Transactions on Software Engineering, 1979
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Distributed query processing in a relational data base systemPublished by Association for Computing Machinery (ACM) ,1978
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Query-by-Example: A data base languageIBM Systems Journal, 1977