Abstract
We consider the problem of rewriting queries based exclusively on views. Both queries and views can contain aggregate functions and include arithmetic comparisons. To study the equivalence of a query with its rewriting query, the so called "linearizations of a query" need to be computed. To find the linearizations of a query, the linearizations of terms from the query need to be generated. We propose an algorithm to find these term linearizations and give a bound for its time-complexity. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Felea, V., & Felea, V. (2012). Algorithm for term linearizations of aggregate queries with comparisons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7447 LNCS, pp. 408–415). https://doi.org/10.1007/978-3-642-32597-7_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
