Partition semantics for incomplete information in relational databases

Authors:
D. Laurent;N. Spyratis
Affiliations:
LIFO, University of Orléans, BP 6759, 45067 Orléans Cedex 2, France;LRI, University of Paris-Sud, 91405 Orsay, France
Venue:
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Year:
1988

Citing 8
Cited 3

A sound and sometimes complete query evaluation algorithm for relational databases with null values

Journal of the ACM (JACM)
Partition semantics for relations

Journal of Computer and System Sciences
Query processing in deductive databases with incomplete information

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The partition model: a deductive database model

ACM Transactions on Database Systems (TODS)
On semantic issues connected with incomplete information databases

ACM Transactions on Database Systems (TODS)
On Databases with Incomplete Information

Journal of the ACM (JACM)
Incorporating Functional Dependencies in Deductive Query Answering

Proceedings of the Third International Conference on Data Engineering
Theory of Relational Databases

Theory of Relational Databases

A Partition Model Approach to Updating Universal Scheme Interfaces

IEEE Transactions on Knowledge and Data Engineering
Extracting Decision Correlation Rules

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Lossless reduction of datacubes

DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define partition semantics for databases with incomplete information and we present an algorithm for query processing in the presence of incomplete information and functional dependencies. We show that Lipski's model for databases with incomplete information can be seen as a special case of our model.