ACM Home Page
Please provide us with feedback. Feedback
Properties of acyclic database schemes
Full text PdfPdf (773 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirteenth annual ACM symposium on Theory of computing table of contents
Milwaukee, Wisconsin, United States
Pages: 355 - 362  
Year of Publication: 1981
Authors
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 33,   Citation Count: 41
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/800076.802489
What is a DOI?

ABSTRACT

There is a class of database descriptions, involving one “acyclic” join dependency and a collection of functional dependencies, and nothing else, that appears powerful enough to describe most any real-world body of data in relational database terms. Further, this class has many desirable properties. Some properties make operations like updates and the selection of joins to implement a query over a universal relation especially easy. Other properties of interest were studied by other researchers who described the same class in radically different terms, and found desirable properties in their own contexts. It is the purpose of this paper to define the class formally, to give its important properties and the equivalences with the other classes mentioned, and to explain the importance of each property. This paper is intended to summarize the results that will appear in more detail in [FMU] and [BFMY].


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
Beeri, C., P. A. Bernstein, and N. Goodman, "A sophisticate's introduction to database normalization theory," Proc. International Conference on Very Large Data Bases, pp. 113-124, 1978.
3
 
4
Beeri, C., R. Fagin, D. Maier, and M. Yannakakis, "On the desirable properties of acyclic database schemas," manuscript in preparation.
5
 
6
Beeri, C. and M. Y. Vardi, "On the properties of join dependencies," Proc. Workshop on Formal Bases for Databases, Toulouse, Dec., 1979.
7
 
8
Bernstein, P. A. and N. Goodman, "What does Boyce-Codd normal form do?," Proc. International Conference on Very Large Data Bases, 1980.
 
9
Bernstein, P. A and N. Goodman, "The theory of semijoins," TR CCA-79-27, Computer Corp. of America, Cambridge, Mass., 1979.
10
11
12
 
13
Fagin, R., A. O. Mendelzon, and J. D. Ullman, "A simplified universal relation assumption and its properties," RJ2900, IBM, San Jose, Calif., 1980.
 
14
Graham, M. H., "On the universal relation," technical report, Univ. of Toronto, Sept., 1979.
 
15
Honeyman, P., "Properties of the universal relation assumption," Ph. D. thesis, Princeton Univ., Princeton, N. J., 1980.
 
16
Honeyman, P., R. E. Ladner, and M. Yannakakis, "Testing the universal instance assumption," Inf. Proc. Letters, 10:1 (1980), pp. 14-19.
 
17
Kent, W., "Consequences of assuming a universal relation," IBM technical report, Dec., 1979, to appear in TODS.
 
18
Korth, H. F. and J. D. Ullman, "SYSTEM/U: a database system based on the universal relation assumption," Proc. XP1 Conference, Stonybrook, N. Y., June, 1980.
 
19
Lien, Y. E., "On the equivalence of database models," private communication, June, 1980.
 
20
 
21
Lien, Y.E., "Multivalued dependencies with null values in relational data bases," Proc. International Conference on Very Large Data Bases, pp. 61-66, 1979.
 
22
Maier, D., "Discarding the universal instance assumption: preliminary results," Proc. XP1 Conference, Stonybrook, N. Y., June, 1980.
23
 
24
Rissanen, J., "Theory of joins for relational databases—a tutorial survey," Proc. Seventh Symp. on Mathematical Foundations of Computer Science, Lecture Notes in CS, 64, Springer-Verlag, pp. 537-551.
25
 
26
Sciore, E., "Null values, updates, and normalization in relational databases," doctoral dissertation, Princeton Univ., Princeton, N. J., 1980.
 
27
Sciore, E., "Some observations on real-world data dependencies," Proc. XP1 Conference, Stonybrook, N. Y., June, 1980.
 
28
 
29
Vardi, M. Y., "Inferring multivalued dependencies from functional and join dependencies," Dept. of Applied Math., Weizmann Inst. of Science, Rehovot, Israel, 1980.
30
 
31
Walker, A., "Time and space in a lattice of universal relations with blank entries," Proc. XP1 Conference, Stonybrook, N. Y., June, 1980.
 
32

CITED BY  41

Collaborative Colleagues:
Catriel Beeri: colleagues
Ronald Fagin: colleagues
David Maier: colleagues
Alberto Mendelzon: colleagues
Jeffrey Ullman: colleagues
Mihalis Yannakakis: colleagues