Querying aggregate data
Authors:
Open Access
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 174-184
Abstract
We introduce a first-order language with real polynomial arithmetic and aggregation operators (count, iterated sum and multiply), which is well suited for the definition of aggregate queries involving complex statistical functions. It offers a good trade-off between expressive power and complexity, with a tractable data complexity. Interestingly, some fundamental properties of first-order with real arithmetic are preserved in the presence of aggregates. In particular, there is an effective...Keywords
This publication has 14 references indexed in Scilit:
- Deciding equivalences among aggregate queries1998
- Foundations of aggregation constraintsTheoretical Computer Science, 1998
- On the containment and equivalence of database queries with linear constraints (extended abstract)1997
- The aggregate data problemACM SIGMOD Record, 1996
- Query languages for bagsACM SIGACT News, 1996
- Implementing data cubes efficiently1996
- Mefisto: a functional model for statistical entitiesIEEE Transactions on Knowledge and Data Engineering, 1993
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Constraint query languages (preliminary report)1990
- Extending relational algebra and relational calculus with set-valued attributes and aggregate functionsACM Transactions on Database Systems, 1987