In this paper, we have presented an uncertain database model based on possibility certainty. The idea is to associate every candidate value (or disjunction of such values) representing an ill-known piece of data with a degree expressing the extent to which the candidate value (or disjunction) is certain. We have extended relational algebra in this context and shown that the model constitutes a strong representation system for this set of operators. The only constraints concerns (i) the join which has to be based on an equality condition, (ii) the union, Cartesian product, and join operations which must take independent relations as arguments. An important result is that the data complexity of these operations is the same as in the classical database case.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.