A Framework for the Investigation of Aggregate Functions in Database Queries

  title={A Framework for the Investigation of Aggregate Functions in Database Queries},
  author={Luca Cabibbo and Riccardo Torlone},
In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad definition of aggregate function, we address our investigation from two different perspectives. We first propose a declarative notion of uniform aggregate function that refers to a family of scalar functions uniformly constructed over a vocabulary of basic operators by a bounded Turing Machine. This notion yields an effective tool to study the effect of the… 

On the equivalence and rewriting of aggregate queries

A first-order language with real polynomial arithmetic and aggregation operators and the concept of cross isomorphic linear expansions, which generalizes isomorphim modulo a product, is introduced, and it is proved that the equivalence of aggregate queries such as for instance averages reduces to it.

Logics with aggregate operators

This work considers a database query language that expresses all the standard aggregates found in commercial query languages, and shows how it can be translated into the aggregate logic, thereby providing a number of expressivity bounds that do not depend on a particular class of arithmetic functions.

View materialization for nested GPSJ queries

This paper proposes an original approach to materialization in which the workload is characterized by the presence of complex queries which cannot be effectively described only by their aggregation pattern, and considers queries represented by nested GPSJ expressions.

Techniques for logical design and ef fi cient querying of data warehouses

This paper proposes an original approach to materialization in which the workload is characterized by the presence of complex queries represented by Nested Generalized Projection/Selection/Join expressions, in which sequences of aggregate operators may be applied to measures and selection predicates may be defined, at different granularities, on both dimensions and measures.

Spatiotemporal aggregate computation: a survey

A model is presented that reduces the evaluation of aggregate queries to the problem of selecting qualifying tuples and the grouping of these tuples into collections on which an aggregate function is to be applied.

On propositionalization for knowledge discovery in relational databases

A formal framework that allows for a unified description of approaches to propositionalization is presented and results that preserve more of the information contained in the original representations of learning examples and background knowledge are achieved.

Querying Multidimensional Data

  • L. Tininini
  • Computer Science
    Multidimensional Databases
  • 2003
This chapter focuses on the main languages proposed in the literature to express multidimensional queries, particularly those based on: (i) an algebraic approach, (ii) a declarative paradigm (calculus), and (iii) visual constructs and syntax.

APIC: An Efficient Algorithm for Computing Iceberg Datacubes

The approach turns out to an operational solution more efficient than previous proposals: the algorithm APIC, which enforces a lectic-wise traverse of the dimensional lattice and takes into account the critical problem of memory limitation.

Specifying Aggregation Functions in Multidimensional Models with OCL

The goal of this paper is to extend the Object Constraint Language (OCL) with a predefined set of aggregation functions that facilitates the definition of platform-independent queries as part of the specification of the conceptual multidimensional model of the data warehouse.

Summarizing time-evolving data

This dissertation presents effective and efficient solutions to the problem of summarizing time-evolving data from two different perspectives and proposes a new indexing paradigm called Skyline Index and a new and compact representation of time series called Self COntained Bit Encoding (SCoBE).



Low Complexity Aggregation in GraphLog and Datalog

Languages for relational databases over interpreted structures

A set of algorithms for eliminating unbounded quantifications in favor of bounded ones is given, and an elementary proof of the fact that parity test is not definable in the relational calculus with polynomial inequality constraints is obtained.

Query Languages for Bags and Aggregate Functions

Theoretical foundations for querying databases based on bags, and the expressive power of BQL and related languages, are investigated in depth and it is proved that these languages possess the conservative extension property.

New techniques for studying set languages, bag languages and aggregate functions

The bounded degree property which says that the number of distinct in- and out-degrees in the output of a graph query does not depend on the size of the input if the input is “simple” is studied.

Algebraic query optimisation for database programming languages

This paper investigates algebraic query optimisation techniques for DBPLs in the context of a purely declarative functional language that supports sets as first-class objects, and defines a small but powerful algebra of operators over the set data type and provides some key equivalences for expressions in these operators, and list transformation principles for optimising expressions.

Principles of Programming with Complex Objects and Collection Types

On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines

We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete

Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions

In this paper aggregate functions are precisely defined and it is shown that the languages so extended have eqmvalent expressive power.

Counting quantifiers, successor relations, and logarithmic space

  • K. Etessami
  • Philosophy, Computer Science
    Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
  • 1995
It is proved that it cannot express a property ORD in L, over structures with a successor relation, and it is shown that ORD is actually complete for L (via quantifier free projections), and this fact is of independent interest.

A recursive algebra for nested relations