Name
Abstract | ||
|---|---|---|
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 contribution of the paper is an algorithm for propagating min and max predicates while preserving query equivalence under certain monotonicity constraints. We show that the algorithm is correct and that the transformed query is often safe when the original one is not. Although in this paper we use logic rules, the technique presented can be used to optimize (possibly recursive) queries expressed using SQL3. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0306-4379(02)00006-6 | Inf. Syst. |
Keywords | Field | DocType |
query optimization,logic rule,optimization,aggregates,propagating min,databases,certain monotonicity constraint,main contribution,query equivalence,extrema aggregate,maximum predicate,equivalent query,max predicate,aggregates.,logic query | Query optimization,Data mining,Monotonic function,Computer science,Algorithm,Maxima and minima,Equivalence (measure theory),Predicate (grammar),Rule of inference,Database,Recursion | Journal |
Volume | Issue | ISSN |
27 | 5 | Information Systems |
Citations | PageRank | References |
6 | 0.60 | 32 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Filippo Furfaro | 1 | 326 | 17.77 |
| Sergio Greco | 2 | 1249 | 265.35 |
| Sumit Ganguly | 3 | 813 | 236.01 |
| Carlo Zaniolo | 4 | 4305 | 1447.58 |