By Topic

A generalized relational model for indefinite and maybe information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liu, K.-C. ; AT&T Bell Lab., Naperville, IL, USA ; Sunderraman, R.

A generalized relational model which is capable of representing and manipulating disjunctive and maybe kinds of information is presented. A data structure, called M-table, is defined, and the information contained in the M-table is precisely stated. Redundant information in M-tables is characterized, and an operator to remove this redundant information is presented. The relational algebra is suitably generalized to deal with M-tables. Additional operators, R-projection and merge, are presented. Queries can be expressed as a combination of the various generalized relational algebraic operators. The M-table accurately models the two bounds on the external interpretation of a query. The sure component of an M-table corresponds to one of the bounds which is the set of objects which belong to the external interpretation of the query. The maybe component of an M-table corresponds to the other bound which is the set of objects for which the possibility of belonging to the external interpretation of the query cannot be ruled out

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:3 ,  Issue: 1 )