Incomplete Information in Relational Databases
Journal of the ACM (JACM)
A logical language for data and knowledge bases
A logical language for data and knowledge bases
The definition of Standard ML
Nested relations and complex objects in databases
Nested relations and complex objects in databases
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A relational algebra for complex objects based on partial information
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
Logical and computational aspects of programming with sets/bags/lists
Proceedings of the 18th international colloquium on Automata, languages and programming
A semantics for complex objects and approximate answers
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Notions of computation and monads
Information and Computation
Lower and upper power domain constructions commute on all cpos
Information Processing Letters
Using powerdomains to generalize relational databases
Theoretical Computer Science
Structural recursion as a query language
DBPL3 Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
ACM SIGMOD Record
Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Normalizing incomplete databases
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
About possibilistic queries against possibilistic databases
Proceedings of the 2002 ACM symposium on Applied computing
Using Constraints for Efficient Query Processing in Nondeterministic Databases
IEEE Transactions on Knowledge and Data Engineering
An Exploration of Relationships Among Exclusive Disjunctive Data
IEEE Transactions on Knowledge and Data Engineering
About Selections and Joins in Possibilistic Queries Addressed to Possibilistic Databases
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
From complete to incomplete information and back
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Containment of nested XML queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A logical account of uncertain databases based on linear logic
Proceedings of the 12th International Conference on Database Theory
Representing uncertain data: models, properties, and algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Or-sets were introduced by Imielinski, Naqvi and Vadaparty for dealing with limited forms of disjunctive information in database queries. Independently, Rounds used a similar notion for representing disjunctive and conjunctive information in the context of situation theory. In this paper we formulate a query language with adequate expressive power for or-sets. Using the notion of normalization of or-sets, queries at the “structural” and “conceptual” levels are distinguished. Losslessness of normalization is established for a large class of queries. We have obtained upper bounds for the cost of normalization. An approach related to that of Rounds is used to provide semantics for or-sets.