Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Implementing imprecision in information systems
Information Sciences: an International Journal - Special issue on expert systems
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
On the representation and querying of sets of possible worlds
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A model-based approach to updating databases with incomplete information
ACM Transactions on Database Systems (TODS)
A sound and complete query evaluation algorithm for relational databases with null values
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Complexity of query processing in databases with OR-objects
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indefinite and maybe information in relational databases
ACM Transactions on Database Systems (TODS)
Imprecise information and uncertainty in information systems
ACM Transactions on Information Systems (TOIS)
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Semantic representations and query languages for or-sets
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics for null extended nested relations
ACM Transactions on Database Systems (TODS)
Answering heterogeneous database queries with degrees of uncertainty
Distributed and Parallel Databases
Database models for infinite and indefinite temporal information
Information Systems
Refining imprecise data by integrity constraints
Data & Knowledge Engineering
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)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Searching a minimal semantically-equivalent subset of a set of partial values
The VLDB Journal — The International Journal on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
A Generalized Relational Model for Indefinite and Maybe Information
IEEE Transactions on Knowledge and Data Engineering
The Management of Probabilistic Data
IEEE Transactions on Knowledge and Data Engineering
Incomplete Relational Database Models Based on Intervals
IEEE Transactions on Knowledge and Data Engineering
Relational Databases with Exclusive Disjunctions
Proceedings of the Eighth International Conference on Data Engineering
Dependency Satisfaction in Databases with Incomplete Information
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Theory of Relational Databases
Theory of Relational Databases
Database research at NTHU and ITRI
ACM SIGMOD Record
Degrees of exclusivity in disjunctive databases
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
| Hi-index | 0.00 |
In this paper, we elaborate on how to interpret the query answer on exclusive disjunctive databases and how to reduce the query answer into a more concise form. Exclusive disjunctive data are represented as a pair of value set and variable set in Pv-table which is an extension of the relational model. A value set corresponds to a finite set of possible values in which exactly one value is the true value. By variable sets, tuples may be related with certain relationships, namely disjunctive relationship and join relationship. Three kinds of tuple sets are classified according to these relationships, each possesses an important property, namely co-exist, co-nonempty, or co-instance. Based on these properties, the interpretation of Pv-tables can be formalized in a semantically meaningful way. Also, the redundant and mergeable tuples can be identified. After removing and merging tuples accordingly, a more concise Pv-table can thus provide a better understanding of the query result.