Abstract — Commercial database systems expose query hints to address situations in which the optimizer chooses a poor plan for a given query. However, current query hints are not flexible enough to deal with a variety of non-trivial scenarios. In this paper, we introduce a hinting framework that enables the specification of rich constraints to influence the optimizer to pick better plans. We show that while our framework unifies previous approaches, it goes considerably beyond existing hinting mechanisms, and can be implemented efficiently with moderate changes to current optimizers. I
Although the declarative nature of SQL provides great util-ity to database users, its use in distrib...
A “plan diagram ” is a pictorial enumeration of the execution plan choices of a database query optim...
Modern database systems use a query optimizer to identify the most efficient strategy, called "plan"...
Abstract—The automated optimization of declarative SQL queries is a classical problem that has been ...
We consider the problem of query optimization in the presence of limitations on access patterns to t...
The query optimization phase within a database management system (DBMS) ostensibly finds the fastest...
Modern database systems use a query optimizer to identify the most efficient strategy, called “query...
Current database systems employ static heuristics for estimating the access time of a particular que...
Exploiting the relationships among data, such as primary and foreign keys, is a classical query opti...
Although the declarative nature of SQL provides great util-ity to database users, its use in distrib...
Constraint Databases, Edité par G. Kuper, L. Libkin et J. ParadaensThe optimization of queries over ...
In a previous paper we proposed a novel method for generating alternative query plans that uses chas...
ABSTRACT Enterprises are adapting large-scale data processing platforms, such as Hadoop, to gain act...
Classic query optimization in relational database systems relies on phases (algebraic, physical, cos...
We discuss a new heuristic optimization concept for query evaluation. It is based on the idea of as...
Although the declarative nature of SQL provides great util-ity to database users, its use in distrib...
A “plan diagram ” is a pictorial enumeration of the execution plan choices of a database query optim...
Modern database systems use a query optimizer to identify the most efficient strategy, called "plan"...
Abstract—The automated optimization of declarative SQL queries is a classical problem that has been ...
We consider the problem of query optimization in the presence of limitations on access patterns to t...
The query optimization phase within a database management system (DBMS) ostensibly finds the fastest...
Modern database systems use a query optimizer to identify the most efficient strategy, called “query...
Current database systems employ static heuristics for estimating the access time of a particular que...
Exploiting the relationships among data, such as primary and foreign keys, is a classical query opti...
Although the declarative nature of SQL provides great util-ity to database users, its use in distrib...
Constraint Databases, Edité par G. Kuper, L. Libkin et J. ParadaensThe optimization of queries over ...
In a previous paper we proposed a novel method for generating alternative query plans that uses chas...
ABSTRACT Enterprises are adapting large-scale data processing platforms, such as Hadoop, to gain act...
Classic query optimization in relational database systems relies on phases (algebraic, physical, cos...
We discuss a new heuristic optimization concept for query evaluation. It is based on the idea of as...
Although the declarative nature of SQL provides great util-ity to database users, its use in distrib...
A “plan diagram ” is a pictorial enumeration of the execution plan choices of a database query optim...
Modern database systems use a query optimizer to identify the most efficient strategy, called "plan"...