Abstract
The authors present a generalization of the relational model to represent indefinite and maybe kinds of incomplete information. They introduce a data structure called M-table which is capable of representing disjunctive/indefinite and maybe facts. The notion of redundancy in the context of indefinite and maybe information is studied. The information content of an M-table is precisely defined. The relational algebra is then generalized in a semantically correct manner to operate on M-tables. Queries are posed in the same manner as in the conventional relational algebra; however, the user may now expect indefinite as well as maybe answers. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.