Conceptual design of data warehouses from E/R schemes

Golfarelli, Matteo; Maio, Dario; Rizzi, Stefano

doi:10.1109/hicss.1998.649228

Cited by 160 publications

(102 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This phase of design necessarily depends on the user requirements and cannot be carried out automatically; since it has already been investigated (for instance in [2]), it is considered to be outside the scope of this paper. Finally, after the designer has selected dimensions and measures among the vertices of the DG, a logical schema can be immediately derived from it.…”

Section: From Xml Schema To Multidimensional Schemamentioning

confidence: 99%

“…Finally, attribute USAddress is renamed into customer in order to clarify its role. The final steps of building a multidimensional schema include the choice of dimensions and measures as described in [2]. In the purchase order example, USPrice and quantity are chosen as measures, while orderDate, partNum, shipToCustomer, and billToCustomer are the dimensions.…”

Section: Creating the Logical Schemementioning

confidence: 99%

See 1 more Smart Citation

Designing Web Warehouses from XML Schemas

Vrdoljak

Banek

Rizzi

2003

Data Warehousing and Knowledge Discovery

View full text Add to dashboard Cite

Abstract. Web warehousing plays a key role in providing the managers with up-to-date and comprehensive information about their business domain. On the other hand, since XML is now a standard de facto for the exchange of semi-structured data, integrating XML data into web warehouses is a hot topic. In this paper we propose a semi-automated methodology for designing web warehouses from XML sources modeled by XML Schemas. In the proposed methodology, design is carried out by first creating a schema graph, then navigating its arcs in order to derive a correct multidimensional representation. Differently from previous approaches in the literature, particular relevance is given to the problem of detecting shared hierarchies and convergence of dependencies, and of modeling many-to-many relationships. The approach is implemented in a prototype that reads an XML Schema and produces in output the logical schema of the warehouse.

show abstract

Section: From Xml Schema To Multidimensional Schemamentioning

confidence: 99%

Section: Creating the Logical Schemementioning

confidence: 99%

Designing Web Warehouses from XML Schemas

Vrdoljak

Banek

Rizzi

2003

Data Warehousing and Knowledge Discovery

View full text Add to dashboard Cite

show abstract

“…Golfarelli, Maio and Rizzi propose a semi-automated methodology to build a dimensional data warehouse model from the pre-existing E/R schemes that represent operational databases (see [5]). Goal-Driven Methodologies: Böhnlein and Ulbrich-vom Ende present an approach that is based on the SOM (Semantic Object Model) process modelling technique in order to derive the initial data warehouse structure (see [1]).…”

Section: Related Workmentioning

confidence: 99%

A Comparison of Data Warehouse Development Methodologies Case Study of the Process Warehouse

List

Bruckner

Machaczek

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Building a data warehouse is a very challenging issue because compared to software engineering it is quite a young discipline and does not yet offer well-established strategies and techniques for the development process. Current data warehouse development methods can fall within three basic groups: data-driven, goal-driven and user-driven. All three development approaches have been applied to the Process Warehouse that is used as the foundation of a process-oriented decision support system, which aims to analyse and improve business processes continuously. In this paper we evaluate all three development methodologies by various assessment criteria. The aim is to establish a link between the methodology and the requirement domain.

show abstract

“…The schema consists of a finite set of dimensions, a finite set of F-tables, and a finite set of level descriptions of the dimensions. Golfarelli et al [8] presented a graphical conceptual model (Dimensional Fact model) for data warehouses and a semi-automated methodology to construct a tree-structured fact schema from an Entity-Relation schema. Marotta et al [15] provided a set of transformation rules to trace the mapping between source logical schema and data warehouse logical schema.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, practitioners and researches have strived to propose methodologies to design multidimensional models from existing ER diagrams [3,5,8,9,[14][15][16][19][20][21]. Even though [12,16,20] acknowledged the importance of grain consistence, they provide only vague guidelines for the mapping and do not specify any concrete algorithms to perform task.…”

Section: Introductionmentioning

confidence: 99%

An Efficient and Grain Preservation Mapping Algorithm: From ER Diagram to Multidimensional Model

Chen

Hsu

2005

Advanced Distributed Systems

View full text Add to dashboard Cite

Abstract. Many practitioners and researchers advocate that the designs of the data models of the data warehouses should incorporate the source data as much as possible to answer the finest levels of queries. On the other hand, the source data are very likely to come from systems designed with ER Diagrams. Therefore, many researches have been devoted to design methodologies to build multidimensional model based on corresponding source ER diagrams. However, to the best of our knowledge, no algorithm has been proposed to systematically translates an entire ER Diagram into a multidimensional model with hierarchical snowflake structures. The algorithm proposed in the paper promised to do so with two characteristics, namely, grain preservation and minimal distance from each table to the fact table. Grain preservation characteristic guarantees that translated multidimensional model has cohesive granularity among entities. The minimal distance characteristics guarantees that if an entity can be connected to the fact table in the derived model with more than one paths, the one with the shortest hops will always be chosen. The first characteristic is achieved by translating problematic relationships between entities with weight factor attributes in bridging tables and enhancing fact tables with unique primary keys. The second characteristic is achieved by including a revised shortest path algorithm in the translating algorithm with the distance being calculated as the number of relationships required between entities.

show abstract

Conceptual design of data warehouses from E/R schemes

Cited by 160 publications

References 9 publications

Designing Web Warehouses from XML Schemas

Designing Web Warehouses from XML Schemas

A Comparison of Data Warehouse Development Methodologies Case Study of the Process Warehouse

An Efficient and Grain Preservation Mapping Algorithm: From ER Diagram to Multidimensional Model

Contact Info

Product

Resources

About