ACM Home Page
Please provide us with feedback. Feedback
On semantic issues connected with incomplete information databases
Full text PdfPdf (2.36 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 4 ,  Issue 3  (September 1979) table of contents
Pages: 262 - 296  
Year of Publication: 1979
ISSN:0362-5915
Author
Witold Lipski, Jr.  Polish Academy of Sciences, Warsaw, Poland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 65,   Citation Count: 78
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/320083.320088
What is a DOI?

ABSTRACT

Various approaches to interpreting queries in a database with incomplete information are discussed. A simple model of a database is described, based on attributes which can take values in specified attribute domains. Information incompleteness means that instead of having a single value of an attribute, we have a subset of the attribute domain, which represents our knowledge that the actual value, though unknown, is one of the values in this subset. This extends the idea of Codd's null value, corresponding to the case when this subset is the whole attribute domain. A simple query language to communicate with such a system is described and its various semantics are precisely defined. We emphasize the distinction between two different interpretations of the query language—the external one, which refers the queries directly to the real world modeled in an incomplete way by the system, and the internal one, under which the queries refer to the system's information about this world, rather than to the world itself. Both external and internal interpretations are provided with the corresponding sets of axioms which serve as a basis for equivalent transformations of queries. The technique of equivalent transformations of queries is then extensively exploited for evaluating the interpretation of (i.e. the response to) a query.


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
CHAMBERLIN, D.D., ASTRAHAN, M.M., ESWARAN, K.P., GRIFFITHS, P.P., LORIE, R.A., MEHL, J.W., REISNER, P., AND WADE, B.W. SEQUEL 2: A unified approach to data definition, manipulation, and control. IBM J. Res. Develop. 20 (1976), 560-575.
2
 
3
CODD, E.F. Understanding relations (Installment #7). FDT Bull. of ACM-SIGMOD 7, 3-4 (1975), 23-28.
 
4
GRANT, J. Null values in a relational data base. Inform. Process. Lett. 5 (1977), 156-157.
 
5
HAJEK, P. Automatic listing of important observational statements III. Kybernetika 10 (1974), 95-124.
 
6
HAJEK, P., BENDOV~., K., AND F~ENC, Z. The GUHA method and the three-valued logic. Kyber. netika 7 (1971), 421-435.
 
7
J AEGERMANN, M. Information storage and retrieval systems with incomplete information. I. Fund. Inform. 2 (1978), 17-41. (A preliminary version available as CC PAS Rep. 214, Warsaw, Poland, 1975.)
 
8
KLEENE, S.C. Introduction to Metamathematics. Noah-Holland Pub. Co., Amsterdam, 1952.
 
9
KONIKOWSKA, B. Data bases with incomplete information: On queries involving binary descriptors. To appear.
 
10
KONIKOWSKA, B., LIPSKI, W., MICHALEWICZ, Z., AND SENDOVA, E. An implementation of a data base with incomplete information I. To appear.
 
11
LIPSKI, W. On data bases with incomplete information. To appear.
 
12
LIPSKI, W. Informational systems with incomplete information. Proc. 3rd Int. Syrup. on Automata, Languages and Programming, Edinburgh, Scotland, 1976, pp. 120-130.
 
13
LIPSKI, W. On the logic of incomplete information. Proc. 6th Int. Symp. on Math. Foundations of Comptr. Sci., Tatransk~ Lomnica, Czechoslovakia, Sept. 1977, pp. 374-381.
 
14
LIPSKI, W. Informational systems: Semantic issues related to incomplete information, Part I. CC PAS Rep. 275, Warsaw, Poland, 1977.
 
15
LIPSKI, W., LODI, E., LuccIo, F., MUGNAI, C., AND PAGLI, L. 0n two dimensional data organization II. Fund. Inform. To appear.
 
16
LIPSKI, W., AND MAREK, W. On information storage and retrieval systems. In Mathematical Foundations of Computer Science, A. Mazurkiewicz and Z. Pawlak, Eds., Banach Center Publications, Vol. 2, Polish Scientific Publishers, Warsaw, Poland, 1977, pp. 215-259.
 
17
LIPSKI, W., AND MAREK, W. Information systems: On queries involving cardinalities. Inform. Syst. To appear.
 
18
LODI, E., LuccIo, F., MUGNAI, C., AND PAGLI, L. On two dimensional data organization I. Fund. Inform. To appear.
 
19
MAREK, W., AND PAWLAK, Z. Information storage and retrieval systems: Mathematical foundations. Theoret. Comptr. Sci. 1 (1976), 331-354.
 
20
MASEK, W. J. Some NP-complete set covering problems. Comptr. Sci. Lab., M.I.T., Cambridge, Mass., May 1978.
 
21
RASmWA, H., AND SIKORSKI, R. The Mathematics of Metamathematics. Polish Scientific Publishers, Warsaw, Poland, 1963.

CITED BY  78
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 


Peer to Peer - Readers of this Article have also read: