OLAP Cube Approximation and Rule Generation in Data Warehouses

Sami Naouali, Rokia Missaoui


This paper presents a new approach toward approximate query answering in data warehouses. The approach is based on an adaptation of rough set theory to multidimensional data, and offers cube exploration and mining facilities. The objective of this work is to integrate approximation mechanisms and associated operators into data cubes in order to produce views that can then be explored using OLAP or data mining techniques. The integration of data approximation capabilities with OLAP techniques offers additional facilities for cube exploration and analysis. The proposed approach allows the user to work either in a restricted mode using a cube lower approximation or in a relaxed mode using cube upper approximation. The former mode is useful when the query output is large, and hence allows the user to focus on a reduced set of fully matching tuples. The latter is useful when a query returns an empty or small answer set, and hence helps relax the query conditions so that a superset of the answer is returned.


  • There are currently no refbacks.

Copyright (c) 2006 Sami Naouali, Rokia Missaoui

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 1114-8802 / ISBN 2665-7015

Last updated : February 27, 2021