|
ABSTRACT
Database integrity has two complementary components: validity, which guarantees that all false information is excluded from the database, and completeness, which guarantees that all true information is included in the database. This article describes a uniform model of integrity for relational databases, that considers both validity and completeness. To a large degree, this model subsumes the prevailing model of integrity (i.e., integrity constraints). One of the features of the new model is the determination of the integrity of answers issued by the database system in response to user queries. To users, answers that are accompanied with such detailed certifications of their integrity are more meaningful. First, the model is defined and discussed. Then, a specific mechanism is described that implements this model. With this mechanism, the determination of the integrity of an answer is a process analogous to the determination of the answer itself.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
LEVESQUE, H.J. The logic of incomplete databases. In On Conceptual Modelling: Perspectives from Artificial Intelligence Databases and Programing Languages, J. Mylopoluos, M. L. Brodie and J. W. Schmidt, Eds., Springer-Verlag, Berlin, 1984, pp. 165-186.
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
RE{TER, R. On closed world data bases. In Logic and Databases, H. Gallaire and J. Minker, Eds., Plenum Press, New York 1978, pp. 55-76.
|
| |
8
|
SunINGRES Manual Set. Release 5.0, Sun Microsystems, Mountain View, Calif., (Part Number 800-1644-01), 1987.
|
| |
9
|
|
| |
10
|
UNIFY Reference Manual. 3.0 edition, UNIFY Corp., Lake Oswego, Oreg., 1983
|
| |
11
|
ZLOOF, M. Query-by-Example: A database language. IBM Syst. J. 16, 4 (Dec. 1977), 324-343.
|
REVIEW
"Catherine Ann Meadows : Reviewer"
A class of integrity constraints on relational databases that can
be enforced using standard relational query techniques is defined.
Although this class of constraints is less powerful than the constraints
defined by first-order predicate calc
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|