Typed Abstract State Machines for data-intensive applications

Authors:
Klaus-Dieter Schewe;Jane Zhao
Affiliations:
Massey University, Information Science Research Centre, Private Bag 11 222, Palmerston North, New Zealand;Massey University, Information Science Research Centre, Private Bag 11 222, Palmerston North, New Zealand
Venue:
Knowledge and Information Systems
Year:
2008

Citing 8
Cited 1

Research problems in data warehousing

CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Integrating database and dialogue design

Knowledge and Information Systems
Olap Solutions: Building Multidimensional Information Systems

Olap Solutions: Building Multidimensional Information Systems
A Foundation for Multi-dimensional Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Maintaining views in object-relational databases

Knowledge and Information Systems
ASM-based design of data warehouses and on-line analytical processing systems

Journal of Systems and Software - Special issue: Quality software
Refinements in typed abstract state machines

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
View integration and cooperation in databases, data warehouses and web information systems

Journal on Data Semantics IV

A service-oriented approach to web warehousing

Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on extensions of Abstract State Machines (ASMs) for the benefit of a refinement calculus in the area of data-intensive applications, in particular data warehouses and on-line analytical processing. The extensions lead to a typed version of ASMs and a more specific notion of strong data refinement, which incorporates the preservation of information content by means of schema dominance. Each typed ASM can be effectively translated into an equivalent ordinary one. Providing typed ASMs helps to exploit the existing logical formalisms used in data-intensive applications to define a ground model. Furthermore, strong data refinement helps to set up a refinement-based development method that uses provably correct standard refinement rules.