A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
Applying an extended relational model to indefinite deductive databases
Proceedings of the Second International Symposium on Methodologies for intelligent systems
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)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Applications of Protected Circumscription
Proceedings of the 7th International Conference on Automated Deduction
Towards a relational model for exclusively disjunctive information
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Formal query languages for secure relational databases
ACM Transactions on Database Systems (TODS)
Semantics of extended relational model for managing uncertain information
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Implementing deductive databases by mixed integer programming
ACM Transactions on Database Systems (TODS)
Supporting valid-time indeterminacy
ACM Transactions on Database Systems (TODS)
Searching a minimal semantically-equivalent subset of a set of partial values
The VLDB Journal — The International Journal on Very Large Data Bases
A Generalized Relational Model for Indefinite and Maybe Information
IEEE Transactions on Knowledge and Data Engineering
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
A Hybrid Representation of Vague Collections for Distributed Object Management Systems
IEEE Transactions on Knowledge and Data Engineering
Incomplete Relational Database Models Based on Intervals
IEEE Transactions on Knowledge and Data Engineering
Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries
IEEE Transactions on Knowledge and Data Engineering
Domain Analysis and Queries in Context
NLDB '00 Proceedings of the 5th International Conference on Applications of Natural Language to Information Systems-Revised Papers
Astronomical Tables, 2-D Indexing, and Fuzzy-joins
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Incomplete information in multidimensional databases
Multidimensional databases
Approximate Selection Queries over Imprecise Data
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
Explicit and default negation in databases and logic programs
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
Generating efficient safe query plans for probabilistic databases
Data & Knowledge Engineering
A logical account of uncertain databases based on linear logic
Proceedings of the 12th International Conference on Database Theory
Tolerant division queries and possibilistic database querying
Fuzzy Sets and Systems
Representing uncertain data: models, properties, and algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Consistency enforcement in databases
Proceedings of the 2nd international conference on Semantics in databases
Degrees of exclusivity in disjunctive databases
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Combining intensional with extensional query evaluation in tuple independent probabilistic databases
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper extends the relational model to represent indefinite and maybe kinds of incomplete information. A data structure, called an I-table, which is capable of representing indefinite and maybe facts, is introduced. The information content of I-tables is precisely defined, and an operator to remove redundant facts is presented. The relational algebra is then extended in a semantically correct way to operate on I-tables. Queries are posed in the same way as in conventional relational algebra; however, the user may now expect indefinite as well as maybe answers.