G. von Bultzingsloewen
Abstract
The optimization problem discussed in this paper is the translation of an SQL query into an efficient parallel execution plan for a multiprocessor database machine under the performance goal of reduced response times as well as increased throughput in a multiuser environment. We describe and justify the most important research problems which have to be solved to achieve this task, and we explain our approach to solve these problems.
Index Terms
- Optimizing SQL queries for parallel execution
Recommendations
Generating parallel execution plans with a partial-order planner
AIPS'94: Proceedings of the Second International Conference on Artificial Intelligence Planning SystemsMany real-world planning problems require generating plans that maximize the parallelism inherent in a problem. There are a number of partial-order planners that generate such plans; however, in most of these planners it is unclear under what conditions ...
Optimizing SQL Queries over Text Databases
ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data EngineeringText documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with information extraction systems, we can materialize a variety of structured "...
Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server
ICDE '08: Proceedings of the 2008 IEEE 24th International Conference on Data EngineeringAs mainstream data warehouses are growing into the multi-terabyte range, adequate performance for decision support queries remains challenging for database query processors. Proper choice of query plan is essential in data warehouses where fact tables ...
Comments