Inverse Tree-OLAP: Definition, Complexity and First Solution

Domenico Saccà; Edoardo Serra; Alfredo Cuzzocrea

Inverse Tree-OLAP: Definition, Complexity and First Solution

Domenico Saccà, Edoardo Serra, Alfredo Cuzzocrea

Computer Science Department

Research output: Contribution to journal › Conference article › peer-review

Abstract

Count constraint is a data dependency that requires the results of given count operations on a relation to be within a certain range. By means of count constraints a new decisional problem, called the Inverse OLAP, has been recently introduced: given a flat fact table, does there exist an instance satisfying a set of given count constraints? This paper focus on a special case of Inverse OLAP, called Inverse Tree-OLAP, for which the flat fact table key is modeled by a Dimensional Fact Model (DFM) with a tree structure.

Original language	American English
Journal	CEUR Workshop Proceedings
Volume	2161
State	Published - 2018
Event	26th Italian Symposium on Advanced Database Systems, SEBD 2018 - Castellaneta Marina (Taranto), Italy Duration: 24 Jun 2018 → 27 Jun 2018

EGS Disciplines

Computer Sciences

Access to Document

https://scholarworks.boisestate.edu/cs_facpubs/156/License: Other

Cite this

@article{ea2a7a12b91f47748eb04d3469644b8d,

title = "Inverse Tree-OLAP: Definition, Complexity and First Solution",

abstract = "Count constraint is a data dependency that requires the results of given count operations on a relation to be within a certain range. By means of count constraints a new decisional problem, called the Inverse OLAP, has been recently introduced: given a flat fact table, does there exist an instance satisfying a set of given count constraints? This paper focus on a special case of Inverse OLAP, called Inverse Tree-OLAP, for which the flat fact table key is modeled by a Dimensional Fact Model (DFM) with a tree structure.",

author = "Domenico Sacc{\`a} and Edoardo Serra and Alfredo Cuzzocrea",

year = "2018",

language = "American English",

volume = "2161",

}

TY - JOUR

T1 - Inverse Tree-OLAP

T2 - 26th Italian Symposium on Advanced Database Systems, SEBD 2018

AU - Saccà, Domenico

AU - Serra, Edoardo

AU - Cuzzocrea, Alfredo

PY - 2018

Y1 - 2018

N2 - Count constraint is a data dependency that requires the results of given count operations on a relation to be within a certain range. By means of count constraints a new decisional problem, called the Inverse OLAP, has been recently introduced: given a flat fact table, does there exist an instance satisfying a set of given count constraints? This paper focus on a special case of Inverse OLAP, called Inverse Tree-OLAP, for which the flat fact table key is modeled by a Dimensional Fact Model (DFM) with a tree structure.

AB - Count constraint is a data dependency that requires the results of given count operations on a relation to be within a certain range. By means of count constraints a new decisional problem, called the Inverse OLAP, has been recently introduced: given a flat fact table, does there exist an instance satisfying a set of given count constraints? This paper focus on a special case of Inverse OLAP, called Inverse Tree-OLAP, for which the flat fact table key is modeled by a Dimensional Fact Model (DFM) with a tree structure.

UR - https://www.scopus.com/pages/publications/85051873070

M3 - Conference article

SN - 1613-0073

VL - 2161

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

Y2 - 24 June 2018 through 27 June 2018

ER -

Inverse Tree-OLAP: Definition, Complexity and First Solution

Abstract

EGS Disciplines

Access to Document

Other files and links

Fingerprint

Cite this