Algorithm for Term Linearizations of Aggregate Queries with Comparisons

Violeta Felea (1) , Victor Felea (2)

1 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)
2 Faculty of Computer Science [Iași]

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.

Domaines: Informatique ubiquitaire; Réseaux et télécommunications [cs.NI]; Calcul parallèle, distribué et partagé [cs.DC]

Violeta Felea, Victor Felea. Algorithm for Term Linearizations of Aggregate Queries with Comparisons. DEXA 2012, 23-rd Int. Conf. on Database and Expert System Applications, Jan 2012, Austria. pp.408--415. ⟨hal-00939904⟩