In this context, various kinds of OLAP solutions are proposed
by Thomsen et al. [5]. Several data cubes can be built from the same database for different
analysis needs. On the other hand, in relational DBMS, the multidimensional model of the data
warehouse is mapped in most cases through star schemes as explained by Kimball [6] consisting
of a set of dimension tables and a central fact table. Dimension tables are strongly de-normalized
and then they are used to select the facts of interest based on the user queries. The fact table
stores fact attributes; its key is defined by importing the keys of the dimension tables. Different
versions of these base schemes have been proposed by Barquin and Edelstein [7] in order to
improve the overall performances. In case of queries performed on very large databases, response
time should be small and query optimization is alsoa critical task. The user views the data in the
form of multi-dimensional data cube. Materialization of cells is the most powerful query
optimization technique. Harinarayan et al. [8] presented the applications of greedy algorithms to
materialize the cells of data cubes. Mining of stream data, social networks data, spatial and
multimedia data came in the category of new mining topics. Mining techniques for these complex
data and algorithms are discussed by Han and Kamber [9]. Saxena et al.