ACM Home Page
Please provide us with feedback. Feedback
A complete axiomatization for a large class of dependencies in relational datatbases
Full text PdfPdf (533 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twelfth annual ACM symposium on Theory of computing table of contents
Los Angeles, California, United States
Pages: 117 - 122  
Year of Publication: 1980
ISBN:0-89791-017-6
Authors
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 15,   Citation Count: 18
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/800141.804659
What is a DOI?

ABSTRACT

Relational database theory has discovered complete axiomatizations for functional and multivalued dependencies. However, a database design system that makes use of dependencies declared by the user must deal with some more general kinds of dependencies than these— at least with embedded multivalued dependencies. Yet no axiomatization for embedded multivalued dependencies is known. In this paper, we define a more general class of dependencies, called “template dependencies” and give a complete axiomatization for these. We then discuss the interaction between functional dependencies and template dependencies.


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
Armstrong, W. W. {1974}. “Dependency structures of data base relationships,” Proc. 1974 IFIP Congress, pp. 580–583, North Holland, Amsterdam.
 
3
Beeri, C. {1977}. “On the membership problem for multivalued dependencies in relational databases,” TR229, Dept. of EECS, Princeton Univ., Princeton, N.J.
 
4
Beeri, C. {1979}. Private communication to J. D. Ullman, Dec., 1979.
5
6
7
8
9
10
 
11
Mendelzon, A. O. and D. Maier {1979}. “Generalized mutual dependencies and the decomposition of database relations,” Dept. of EECS, Princeton Univ., Princeton, N. J.
 
12
Nicolas, J. M. {1978}. “Mutual dependencies and some results on undecomposable relations, ” Proc. International Conference on Very Large Data Bases, pp. 360–367.
 
13
Papadimitriou, C.H. and M. Yannakakis {1980}. “Algebraic dependencies,” unpublished memorandum, Laboratory for Computer Science, M. I. T., Cambridge, Mass.
 
14
Paredaens, J. {1979}. “Transitive dependencies in a database scheme,” R387, MBLE, Brussels, Belguim.
 
15
Rissanen, J. {1978}. “Relations with functional and join dependencies and their representation by independent components,” IBM, San Jose, Calif.
16
 
17
Sagiv, Y. and S. Walecka {1979}. “Subset dependencies as an alternative to embedded multivalued dependencies,” UIUCDCS-R-79-980, Dept. of C. S., Univ. of Illinois, Urbana, Ill.
 
18
 
19

CITED BY  18

Collaborative Colleagues:
Fereidoon Sadri: colleagues
Jeffrey D. Ullman: colleagues