Count constraints for Inverse OLAP and aggregate data exchange

Domenico Saccà, Edoardo Serra, Antonella Guzzo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A classical problem in database theory is to verify whether there exists a relation (or database) instance satisfying a number of given dependency constraints but the issue of handling constraints on aggregate data has not been much investigated so far. This paper introduces a new type of data dependency, called count constraint, that requires the results of given count operations on a relation to be within a certain range. Count constraints are defined by a suitable extension of first order predicate calculus, based on set terms, and they are then used in a new decisional problem, the Inverse OLAP: given a fact table, does there exist an instance satisfying a set of given count constraints? Count constraints can also be used into a data exchange system context, where data from the source database are transferred to the target database using aggregate operations. Copyright (c) 2012 - Edizioni Libreria Progetto and the authors.

Original languageEnglish
Title of host publicationProceedings of the 20th Italian Symposium on Advanced Database Systems, SEBD 2012
Pages27-34
Number of pages8
StatePublished - 2012
Event20th Italian Symposium on Advanced Database Systems, SEBD 2012 - Venice, Italy
Duration: 24 Jun 201227 Jun 2012

Publication series

NameProceedings of the 20th Italian Symposium on Advanced Database Systems, SEBD 2012

Conference

Conference20th Italian Symposium on Advanced Database Systems, SEBD 2012
Country/TerritoryItaly
CityVenice
Period24/06/1227/06/12

Keywords

  • Count constraints
  • Data exchange
  • OLAP analysis

Fingerprint

Dive into the research topics of 'Count constraints for Inverse OLAP and aggregate data exchange'. Together they form a unique fingerprint.

Cite this