Using Multidimensional Canonical Partitioning (MCP) as a Supply-Driven Approach for Data Warehouses Design

Various information systems have been developed for decision support. But, they rely essentially on transactional methods. From data and transactional databases, we proposed a supply-driven approach to design data warehouses. The approach takes as input, a universal relation, applies vertical partitioning by a greedy type heuristic algorithm. Partitions obtained are transformed into dimensions using a matching algorithm. The other elements of the multidimensional annotation are deduced by guidelines, and the data warehouse schema is generated using a multidimensional conceptual pattern. The transformation of those transactional systems into decision support ones aims at facilitating the storage, exploitation and the representation of data using new databases generation technologies

The α\alpha-Arboricity of Complete Uniform Hypergraphs

International audience$\alpha$-Acyclicity is an important notion in database theory. The $\alpha$-arboricity of a hypergraph H is the minimum number of $\alpha$-acyclic hypergraphs that partition the edge set of H. The $\alpha$-arboricity of the complete 3-uniform hypergraph is determined completely