Type inference and the Algebra of qualified relations

Author

Eichmann, D.

Author_Institution

Dept. of Stat. & Comput. Sci., West Virginia Univ., Morgantown, WV, USA

fYear

1990

fDate

9-13 Dec 1990

Firstpage

352

Lastpage

356

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

Keywords

data structures; database theory; distributed databases; information retrieval; query languages; relational databases; distributed database queries; domain interval typing; qualified relations; type inference; Algebra; Application software; Computer science; Data models; Database systems; Distributed databases; Inference mechanisms; Query processing; Relational databases; Statistical distributions;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-2087-0

Type

conf

DOI

10.1109/SPDP.1990.143564

Filename

143564

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3271178