A polymorphic relational algebra and its optimization

D Eichmann; D Alton

doi:10.1109/ICDE.1991.131517

Back

Conference proceeding

A polymorphic relational algebra and its optimization

D Eichmann and D Alton

[1991] Proceedings. Seventh International Conference on Data Engineering, pp.680-689

1991

DOI: 10.1109/ICDE.1991.131517

View Online

Abstract

The notion of a polymorphic database and the optimization of polymorphic queries-specifically, optimization of queries under the Morpheus data model-is addressed. The notion of query optimization through type inference, applicable both to polymorphic databases and traditional monomorphic databases, is introduced. The Morpheus data model and its type inference rules are reviewed and a polymorphic relational algebra is characterized. It is shown how the inference rules can be used for static optimization of a few sample queries. It is concluded that type inference provides a formal mechanism for optimizing a very rich extension to the relational algebra. The approach retains the basic framework that lead to the wide acceptance of the relational model, while enriching it with the structural expressiveness of the object-oriented approaches of recent years.< >

Computer science

Algebra

Object oriented databases

Object oriented modeling

Query processing

Lattices

Relational databases

Database systems

Data models

Statistics

Details

Title: Subtitle: A polymorphic relational algebra and its optimization
Creators: D Eichmann - Dept. of Stat. & Comput. Sci., West Virginia Univ., Morgantown, WV, USA
D Alton
Resource Type: Conference proceeding
Publication Details: [1991] Proceedings. Seventh International Conference on Data Engineering, pp.680-689
DOI: 10.1109/ICDE.1991.131517
Publisher: IEEE Comput. Soc. Press
Language: English
Date published: 1991
Academic Unit: School of Library and Information Science
Record Identifier: 9984003174202771

Metrics

44 Record Views