Sciweavers

115 search results - page 6 / 23
» Predicate Migration: Optimizing Queries with Expensive Predi...
Sort
View
BTW
2009
Springer
132views Database» more  BTW 2009»
13 years 12 months ago
A Bayesian Approach to Estimating the Selectivity of Conjunctive Predicates
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
M. Heimel, Volker Markl, Keshava Murthy
IS
2002
13 years 7 months ago
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carl...
IJCAI
2003
13 years 8 months ago
Describing and Utilizing Constraints to Answer Queries in Data-Integration Systems
In data-integration systems, information sources often have various constraints such as “all houses stored at a source have a unique address.” These constraints are very usefu...
Chen Li
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 8 months ago
Unnesting Scalar SQL Queries in the Presence of Disjunction
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
Matthias Brantner, Norman May, Guido Moerkotte
PODS
2004
ACM
131views Database» more  PODS 2004»
14 years 7 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
Piero A. Bonatti