Query optimization by simulated annealing
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Optimization of large join queries: combining heuristics and combinatorial techniques
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Tradeoffs in processing complex join queries via hashing in multiprocessor database machines
Proceedings of the sixteenth international conference on Very large databases
Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A Special Function Unit for Database Operations (SFU-DB): Design and Performance Evaluation
IEEE Transactions on Computers
Error-constrained COUNT query evaluation in relational databases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Data partitioning for multicomputer database systems: a cell-based approach
Information Systems
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Parallel query processing in DBS3
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Interconnecting shared-everything systems for efficient parallel query processing
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Query Processing in Parallel Relational Database Systems
Query Processing in Parallel Relational Database Systems
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Dynamic Load Balancing in Multicomputer Database Systems Using Partition Tuning
IEEE Transactions on Knowledge and Data Engineering
Utilizing Page-Level Join Index for Optimization in Parallel Join Execution
IEEE Transactions on Knowledge and Data Engineering
An Adaptive Data Placement Scheme for Parallel Database Computer Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Hash-Based Join Algorithms for Multiprocessor Computers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Optimization of Multi-Way Join Queries for Parallel Execution
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Multi-Join Optimization for Symmetric Multiprocessors
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Load Balancing in Pipelined Processing of Multi-Join Queries
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
A Query-Driven Approach to the Design and Management of Flexible Database Systems
Journal of Management Information Systems
Throughput-optimized, global-scale join processing in scientific federations
NETB'07 Proceedings of the 3rd USENIX international workshop on Networking meets databases
Query simplification: graceful degradation for join-order optimization
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Selection of nodes for distributing relations in parallel database
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
Efficient multi-way theta-join processing using MapReduce
Proceedings of the VLDB Endowment
A new scale for attribute dependency in large database systems
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
| Hi-index | 0.01 |
Although many query tree optimization strategies have been proposed in the literature, there still is a lack of a formal and complete representation of all possible permutations of query operations (i.e., execution plans) in a uniform manner. A graph-theoretic approach presented in this paper provides a sound mathematical basis for representing a query and searching for an execution plan. In this graph model, a node represents an operation and a directed edge between two nodes indicates the order of executing these two operations in an execution plan. Each node is associated with a weight and so is an edge. The weight is an expression containing optimization required parameters, such as relation size, tuple size, join selectivity factors. All possible execution plans are representable in this graph and each spanning tree of the graph becomes an execution plan. It is a general model which can be used in the optimizer of a DBMS for interal query representation. On the basis of this model, we devise an algorithm that finds a near optimal execution plan using only polynomial time. The algorithm is compared with a few other popular optimization methods. Experiments show that the proposed algorithm is superior to the others under most circumstances.