Extension of the Relational Algebra to Probabilistic Complex Values

Conference item

We present a probabilistic data model for complex values. More precisely, we introduce probabilistic complex value relations, which combine the concept of probabilistic relations with the idea of complex values in a uniform framework. We then define an algebra for querying database instances, which comprises the operations of selection, projection, renaming, join, Cartesian product, union, intersection, and difference. We finally show that most of the query equivalences of classical relational algebra carry over to our algebra on probabilistic complex value relations. Hence, query optimization techniques for classical relational algebra can easily be applied to optimize queries on probabilistic complex value relations.

Authors: Eiter, T; Lukasiewicz, T; Walter, M

• Publisher: Springer
• Host title: Proceedings of the 1st International Symposium on the Foundations of Information and Knowledge Systems‚ FoIKS 2000‚ Burg‚ Germany‚ February 14−17‚ 2000
• Volume: 1762
• Publication date: 2000-01-01
• ISBN: 3540671005