A novel three-level architecture for large data warehouses

Classical architectures proposed so far for data warehouses show some drawbacks when adopted to work over large numbers of heterogeneous operational sources. In this paper we propose a variant of a three-level architecture for data warehouses that overcomes these drawbacks. However, in the application context under consideration, having a suitable architecture may be not enough for the design purposes. Indeed, data warehouse design in very large operational environments can be a quite hard problem to attack with traditional manual methodologies. In this paper, automatic techniques are also illustrated that are capable to produce the data warehouse design according to the proposed architecture, with a limited human intervention.

[1]  Luigi Palopoli,et al.  Intensional and extensional integration and abstraction of heterogeneous databases , 2000, Data Knowl. Eng..

[2]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[3]  Luigi Palopoli,et al.  An automatic technique for detecting type conflicts in database schemes , 1998, CIKM '98.

[4]  Luigi Palopoli,et al.  Semi-automatic Extraction of Hyponymies and Overlappings from Heterogeneous Database Schemes , 2000, DEXA.

[5]  Peter C. Lockemann,et al.  System Guided View Integration for Object-Oriented Databases , 1992, IEEE Trans. Knowl. Data Eng..

[6]  Giorgio Terracina,et al.  A study on the interaction between interscheme property extraction and type conflict resolution , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[7]  James A. Larson,et al.  A Theory of Attribute Equivalence in Databases with Application to Schema Integration , 1989, IEEE Trans. Software Eng..

[8]  Surajit Chaudhuri,et al.  An overview of data warehousing and OLAP technology , 1997, SGMD.

[9]  Stefano Spaccapietra,et al.  View Integration: A Step Forward in Solving Structural Conflicts , 1994, IEEE Trans. Knowl. Data Eng..

[10]  Silvana Castano,et al.  Semantic dictionary design for database interoperability , 1997, Proceedings 13th International Conference on Data Engineering.

[11]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[12]  Maurizio Lenzerini,et al.  A Methodology for Data Schema Integration in the Entity Relationship Model , 1984, IEEE Transactions on Software Engineering.

[13]  Luigi Palopoli,et al.  A unified graph-based framework for deriving nominal interscheme properties, type conflicts and object cluster similarities , 1999, Proceedings Fourth IFCIS International Conference on Cooperative Information Systems. CoopIS 99 (Cat. No.PR00384).

[14]  Matteo Golfarelli,et al.  Conceptual design of data warehouses from E/R schemes , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[15]  Jennifer Widom,et al.  Research problems in data warehousing , 1995, CIKM '95.

[16]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.