ACM Home Page
Please provide us with feedback. Feedback
Incomplete information and dependencies in relational databases
Full text PdfPdf (747 KB)
Source International Conference on Management of Data archive
Proceedings of the 1983 ACM SIGMOD international conference on Management of data table of contents
San Jose, California
SESSION: Database theory table of contents
Pages: 178 - 184  
Year of Publication: 1983
ISBN:0-89791-104-0
Also published in ...
Authors
Tomasz Imielinski  McGill University
Witold Lipski, Jr.  Polish Academy of Science
Sponsors
: ACM SIGBDP
: IEEE TC on Design Automation
: IEEE TC on Database Engineering
: IEEE TC on VLSI
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Citation Count: 12
Additional Information:

abstract   references   cited by   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/582192.582222
What is a DOI?

ABSTRACT

An incomplete information relational database combines two types of information about the real world modeled by the database: (a) the information represented by tables with null values ("value not known") allowed as entries, and (b) the data dependencies, which are known to be satisfied in the real world. We view the well known chase procedure as a process which transforms type (b) information into an "equivalent" type (a) form. Assuming that the data dependencies are arbitrary implicational dependencies, we show that this transformation is not quite equivalent, but the corruption of information introduced cannot be discovered if the query language uses the operations of projection, positive selection (i.e. no negation in selection condition), union, natural join and renaming of attributes. This result can be interpreted also as the new important property of chase.The influence of so-called view dependencies on the table with null values is also examined.


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
{BV} Beeri, C., Vardi, M.Y., Formal systems for tuple and equality generating dependencies. To appear in SIAM J. Comput.
 
2
 
3
{I} Imielinski, T., Problems of representing information in the relational database, Doctoral Thesis, Warsaw, 1981.
 
4
{IL1} Imielinski, T., Lipski, W., On representing incomplete information in a relational database, Proc. 7th Internat. Conf. on Very Large Data Bases, Cannes, France, Sept. 1981, pp. 388--397.
 
5
{IL2} Imielinski, T., Lipski, W., Incomplete information in relational data bases, ICS PAS Report 475, May, 1982.
6
 
7
{K} Kowalski, R., Logic for data description in logic and databases, eds. Gallaire, Minker, 1979.
8
 
9
{MMS} Maier, D., Mendelzon, A.O., Sagiv, Y., Testing implications of data dependencies, ACM Trans. on Database Syst. 2 (1977), 201--222.
 
10
 
11
{V} Vassiliou, Y., Functional dependencies and incomplete information, Proc 6 VLDB, Montreal, Canada, Oct. 1980, pp. 260--269.

CITED BY  12
 
 
 
 
 
 
 
 
Collaborative Colleagues:
Tomasz Imielinski: colleagues
Witold Lipski, Jr.: colleagues

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