Practical Predicate Placement (1994)
| Venue: | In Proceedings of the ACM SIGMOD International Conference on Management of Data |
| Citations: | 40 - 2 self |
BibTeX
@INPROCEEDINGS{Hellerstein94practicalpredicate,
author = {Joseph M. Hellerstein},
title = {Practical Predicate Placement},
booktitle = {In Proceedings of the ACM SIGMOD International Conference on Management of Data},
year = {1994},
pages = {325--335}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Recent work in query optimization has addressed the issue of placing expensive predicates in a query plan. In this paper we explore the predicate placement options considered in the Montage DBMS, presenting a family of algorithms that form successively more complex and effective optimization solutions. Through analysis and performance measurements of Montage SQL queries, we classify queries and highlight the simplest solution that will optimize each class correctly. We demonstrate limitations of previously published algorithms, and discuss the challenges and feasibility of implementing the various algorithms in a commercial-grade system. 1 Introduction Relational Database Management Systems have begun to allow user-defined data types and operators to be utilized in ad-hoc queries. Simultaneously, ObjectOriented DBMSs have begun to offer ad-hoc query facilities, allowing declarative access to objects and methods that were previously only accessible through handcoded, imperative appl...
