Exclusive Disjunctions in Indefinite and Maybe Information in Relational Databases

Incorporating indefinite information into databases has been studied extensively. In this paper, we propose a structure called an E-table to represent maybe information and inclusive and exclusive disjunctions. We define the type of redundancies in E-tables and show how to eliminate them. Also we present an extended relational algebra to operate on E-tables. In this paper we expand the concepts and operations defined by Lin and Sunderraman [1] in order to accommodate exclusive disjunctions in relational databases.

Exclusive Disjunctions in Indefinite and Maybe Information in Relational Databases

Incorporating indefinite information into databases has been studied extensively. In this paper, we propose a structure called an E-table to represent maybe information and inclusive and exclusive disjunctions. We define the type of redundancies in E-tables and show how to eliminate them. Also we present an extended relational algebra to operate on E-tables. In this paper we expand the concepts and operations defined by Lin and Sunderraman [1] in order to accommodate exclusive disjunctions in relational databases.