2012 | OriginalPaper | Chapter
Using Functional Dependencies for Reducing the Size of a Data Cube
Authors : Eve Garnaud, Sofian Maabout, Mohamed Mosbah
Published in: Foundations of Information and Knowledge Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Functional dependencies (FD’s) are a powerful concept in data organization. They have been proven very useful in
e.g.,
relational databases for reducing data redundancy. Little work however has been done so far for using them in the context of data cubes. In the present paper, we propose to characterize the parts of a data cube to be materialized with the help of the FD’s present in the underlying data. For this purpose, we consider two applications: (i) how to choose the
best cuboids
of a data cube to materialize in order to guarantee a fixed performance of queries and, (ii) how to choose the
best tuples
, hence partial cuboids, in order to reduce the size of the data cube without loosing information. In both cases we show how FD’s are fundamental.