Type inference and the Algebra of qualified relations

D Eichmann

doi:10.1109/SPDP.1990.143564

Back

Conference proceeding

Type inference and the Algebra of qualified relations

D Eichmann

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp.352-356

1990

DOI: 10.1109/SPDP.1990.143564

View Online

Abstract

The algebra of qualified relations proposed by Ceri and Pelagatti supports pruning of distributed database queries, minimizing the number of sites involved in evaluation. Domain interval typing in the framework of formal type inference subsumes this approach, pruning not only unsatisfiable subqueries involving fragmentation predicates, but also unsatisfiable subqueries mentioning any relation attribute.< >

Computer science

Algebra

Inference mechanisms

Query processing

Distributed databases

Statistical distributions

Relational databases

Database systems

Data models

Application software

Details

Title: Subtitle: Type inference and the Algebra of qualified relations
Creators: D Eichmann - Dept. of Stat. & Comput. Sci., West Virginia Univ., Morgantown, WV, USA
Resource Type: Conference proceeding
Publication Details: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp.352-356
DOI: 10.1109/SPDP.1990.143564
Publisher: IEEE Comput. Soc. Press
Language: English
Date published: 1990
Academic Unit: School of Library and Information Science
Record Identifier: 9984003006802771

Metrics

22 Record Views