Abstract | ||
---|---|---|
We propose an algorithm for pushing min and max aggregates into recursive predicates, while preserving query equivalence under certain monotonicity constraints. The transformed query is often safe when the original one is not, and more efficient than the original query when this is safe. |
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/BFb0056001 | FQAS |
Keywords | Field | DocType |
max predicates,logic queries | Query optimization,Dynamic programming,Monotonic function,Deductive database,Computer science,Algorithm,Equivalence (measure theory),Predicate (grammar),Recursion,Boolean conjunctive query | Conference |
ISBN | Citations | PageRank |
3-540-65082-2 | 2 | 0.38 |
References | Authors | |
18 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sergio Greco | 1 | 1249 | 265.35 |
Carlo Zaniolo | 2 | 4305 | 1447.58 |
Sumit Ganguly | 3 | 813 | 236.01 |