Incomplete Information in Relational Databases
Journal of the ACM (JACM)
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
Indefinite and maybe information in relational databases
ACM Transactions on Database Systems (TODS)
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
A foundation of CODD's relational maybe-operations
ACM Transactions on Database Systems (TODS)
On semantic issues connected with incomplete information databases
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
Null values in data base management a denotational semantics approach
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Incomplete information and dependencies in relational databases
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
On the equivalence of logical databases
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On Representing Indefinite and Maybe Information in Relational Databases
Proceedings of the Fourth International Conference on Data Engineering
Transactions in Relational Databases (Preliminary Report)
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Algebraic evaluation of disjunctive deductive databases
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Towards a relational model for exclusively disjunctive information
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Semantics of extended relational model for managing uncertain information
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Searching a minimal semantically-equivalent subset of a set of partial values
The VLDB Journal — The International Journal on Very Large Data Bases
An Exploration of Relationships Among Exclusive Disjunctive Data
IEEE Transactions on Knowledge and Data Engineering
Information Source Tracking Method: Efficiency Issues
IEEE Transactions on Knowledge and Data Engineering
Incomplete information in multidimensional databases
Multidimensional databases
Range search on multidimensional uncertain data
ACM Transactions on Database Systems (TODS)
Explicit and default negation in databases and logic programs
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
A logical account of uncertain databases based on linear logic
Proceedings of the 12th International Conference on Database Theory
Degrees of exclusivity in disjunctive databases
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
| Hi-index | 0.00 |
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.