ACM Home Page
Please provide us with feedback. Feedback
Information dependencies
Full text PdfPdf (270 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Dallas, Texas, United States
Pages: 245 - 253  
Year of Publication: 2000
ISBN:1-58113-214-X
Authors
Mehmet M. Dalkilic  Indiana University Computer Science, Lindley Hall 215, Bloomington, Indiana
Edward L. Roberston  Indiana University Computer Science, Lindley Hall 215, Bloomington, Indiana
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 39,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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/335168.336059
What is a DOI?

ABSTRACT

This paper uses the tools of information theory to examine and reason about the information content of the attributes within a relation instance. For two sets of attributes X and Y, an information dependency measure (InD measure) characterizes the uncertainty remaining about the values for the set Y when the values for the set X are known. A variety of arithmetic inequalities (InD inequalities) are shown to hold among InD measures; InD inequalities hold in any relation instance. Numeric constraints (InD constraints) on InD measures, consistent with the InD inequalities, can be applied to relation instances. Remarkably, functional and multivalued dependencies correspond to setting certain constraints to zero, with Armstrong's axioms shown to be consequences of the arithmetic inequalities applied to constraints. As an analog of completeness, for any set of constraints consistent with the inequalities, we may construct a relation instance that approximates these constraints within any positive &egr;. InD measures suggest many valuable applications in areas such as data mining.


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
R. G. Bartle. The Elements of Real Analysis Second Edition. John Wiley & Sons, Inc., New York, New York, 1976.
2
 
3
 
4
G. Piatetsky-Shapiro. Probabilistic data dependencies. In Machine Discovery Workshop (Aberdeen, Scotland), 1992.
 
5
 
6
S. Ginsburg and R. Hull. Characterizations for functional dependency and boyce-codd normal form families. In Theoretical Computer Science, volume 26, pages 243-286, 1983.
 
7
 
8
 
9
 
10
11
 
12
 
13
 
14
 
15

CITED BY  12

Collaborative Colleagues:
Mehmet M. Dalkilic: colleagues
Edward L. Roberston: colleagues