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.
Copyright © 2018 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.
Saccà, Domenico; Serra, Edoardo; and Cuzzocrea, Alfredo. (2018). "Inverse Tree-OLAP: Definition, Complexity and First Solution". SEBD 2018: Proceedings of the 26th Italian Symposium on Advanced Database Systems, .