|
ABSTRACT
We start with a very brief description of the many-valued logic approach to the formal treatment of null values in data bases and show some problems that are encountered. In the second part of the paper we present our approach, based on the Denotational Semantics Theory. An informal introduction to the theory is given and then the relational model is described in terms of the theory. Query evaluations are defined as continuous functions and several examples are presented. The formalization in the framework of Denotational Semantics allows for a better understanding of the semantic problems with null values. It also gives flexibility for alternatives in acceptable semantic interpretations. We conclude with a presentation of an algorithm for the evaluation of simple queries. This algorithm uses symbolic manipulations and it is more economical than the strict application of the definition of query evaluations.
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
|
ANSI/X3/SPARC Study Group on Data Base Management Systems, Interim Report, ANSI, February 1975.
|
| |
2
|
Codasyl Development Committee, An Information Algebra, Phase I Report, Communications of the ACM, 1962.
|
| |
3
|
Vassiliou, Y., DBMS Transaction Translation, Dept. of Computer Science, University of Toronto, to appear as a CSRG technical report, 1979.
|
| |
4
|
Zaniolo, C., Relational Views in a Data Base System --- Support for Queries, Sperry Research Center, Sudbury Mass., 1978.
|
 |
5
|
|
| |
6
|
|
| |
7
|
Rescher, Many Valued Logic, McGraw-Hill Inc., New York, 1969.
|
| |
8
|
Donahue, J., Scottery, Dept. of Computer Science, University of Toronto, July 1974.
|
| |
9
|
Mylopoulos, J., and Wong, H.K.T., A Denotational Semantics for TAXIS, AI memo, Dept. of Computer Science, University of Toronto, 1979.
|
| |
10
|
Levesque, H., private correspondence.
|
| |
11
|
Grant, J., Null Values in a Relational Data Base, information processing letters, 5(1977), pp.156--157.
|
| |
12
|
|
| |
13
|
|
| |
14
|
Vassiliou, Y., The Use of Denotational Semantics in DBMSs, Database-Memo, Dept. of Computer Science, University of Toronto, 1978.
|
| |
15
|
Lipski, W., Jr., On Semantic Issues Connected with Incomplete Data Bases (extended abstract), VLDB, 1977.
|
CITED BY 47
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Catriel Beeri , Ronald Fagin , David Maier , Alberto Mendelzon , Jeffrey Ullman , Mihalis Yannakakis, Properties of acyclic database schemes, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.355-362, May 11-13, 1981, Milwaukee, Wisconsin, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Qihua Wang , Ting Yu , Ninghui Li , Jorge Lobo , Elisa Bertino , Keith Irwin , Ji-Won Byun, On the correctness criteria of fine-grained access control in relational databases, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|