Applied combinatorics
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The Fittest Survives: An Adaptive Approach to Query Optimization
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Evolution of Query Optimization Methods: From Centralized Database Systems to Data Grid Systems
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Optimizing joins in a map-reduce environment
Proceedings of the 13th International Conference on Extending Database Technology
ModParOpt: a modular query optimizer for multi-query parallel databases
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Efficient multi-way theta-join processing using MapReduce
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In this short note, we estimate the search space of optimizing multiway join queries in multiprocessor computer systems, i.e. the number of possible query execution plans that need to be considered.