Title :
Type inference and the Algebra of qualified relations
Author_Institution :
Dept. of Stat. & Comput. Sci., West Virginia Univ., Morgantown, WV, USA
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;
Conference_Titel :
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2087-0
DOI :
10.1109/SPDP.1990.143564
