Finitely Specifiable Implicational Dependency Families

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Finitely Specifiable Implicational Dependency Families

Full text

Pdf (959 KB)

Source

Journal of the ACM (JACM) archive
Volume 31 , Issue 2 (April 1984) table of contents

Pages: 210 - 226

Year of Publication: 1984

ISSN:0004-5411

Author

Richard Hull

University of Southern California, Los Angeles, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 28, Citation Count: 10

Additional Information:

references cited by index terms review collaborative colleagues

Tools and Actions:	Request Permissions 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/62.2162 What is a DOI?

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	AHo, A. V., SAGJV, Y., AND ULLMAN, J. D. equivalence among relational expressions. SIAM ~. Comput. 8 (1979), 218-246.
	2	ARMSTRONG, W. W. Dependency structures of database relationships. In Proceedings oflFIP 74. Elsevier-North Holland, New York, 1974, pp. 580-583.
	3	Catriel Beeri , Ronald Fagin , John H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations, Proceedings of the 1977 ACM SIGMOD international conference on Management of data, August 03-05, 1977, Toronto, Ontario, Canada [doi>10.1145/509404.509414]
	4	BEERI, C., AND VARDI, M. Y. A proof procedure for data dependencies. Res. R~., Dept. of Computer Science, Hebrew Univ. of Jerusalem, Israel, Dec. 1980.
	5	Catriel Beeri , Moshe Y. Vardi, The Implication Problem for Data Dependencies, Proceedings of the 8th Colloquium on Automata, Languages and Programming, p.73-85, July 13-17, 1981
	6	CHAMBERLIN, O. D., GRAY, J. N., AND TRA1GER, i. L. Views, authorization and locking in a relational database system, in Proceedings of AFIPS National Computer Conference. AFIPS Press, Reston, *Ca., 1975, pp. 425-430.
	7	Covo, E. F. Further normalization of the database relational model. In Couram Computer Science Symposta. Vol. 6, Data Base Systems. Prentice-Hall, Englewood Cliffs, N. J., 1971, pp. 65-98.
	8	ESWAREN, K. P., AND CHAMBERLIN, D. D.Functional specifications of a subsystem for data base integrity. In Proceedings of I st International Conference on Very Large Databases (Framing, ham, Mass., Sept. 22-24). ACM, New York, 1975, pp. 48-68.
	9	Ronald Fagin, Multivalued dependencies and a new normal form for relational databases, ACM Transactions on Database Systems (TODS), v.2 n.3, p.262-278, Sept. 1977 [doi>10.1145/320557.320571]
	10	Ronald Fagin, Horn clauses and database dependencies, Journal of the ACM (JACM), v.29 n.4, p.952-985, Oct. 1982 [doi>10.1145/322344.322347]
	11	FiscrmR, P. C., Joo, J. H., AND TSOU, D. M. Succinctness in dependency systems. Tech. Rep., Dept. of Computer Science, Vanderbilt Univ., Nashville, Tenn., 1981, Presented at XP2 Conference on Relational Database Theory, Pennsylvania State Univ. (June 1981).
	12	GINSBURG, S., AND HULL, R.Characterizations for functional dependency and Boyce.-Codd normal fi)rm families. Theoret. Comp. Set 29 (1983), 243-286.
	13	Seymour Ginsburg , Sami Mohammed Zaiddan, Properties of functional-dependency families, Journal of the ACM (JACM), v.29 n.3, p.678-698, July 1982 [doi>10.1145/322326.322331]
	14	HAMMER, M. M., AND MCLEOD, D. J.Semantic integrity in a relational data base system. In Proceedings of 1st International Conference on Very Large Databases (Framingham, Mass., Sept. 22-24). ACM, New York, 1975, pp. 25-47.
	15	HULL, R. Non-finite specifiability of projections of functional dependency families. Tech. Pep. TR-83-209, Dept. of Computer Science, Univ. of Southern California, Los Angeles, Apr. 1983.
	16	David Maier , Alberto O. Mendelzon , Yehoshua Sagiv, Testing implications of data dependencies, ACM Transactions on Database Systems (TODS), v.4 n.4, p.455-469, Dec. 1979 [doi>10.1145/320107.320115]
	17	MAKOWSKY, J. A., AND VARDI, M. Y. On the expressive power of data dependencies (extended abstract). Unpublished report, Dept. of Computer Science, Stanford Univ., Stanford, Calif., Feb. 1983.
	18	RISSANEN, J.Theory of relations for databases---A tutorial survey, in Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 64. Springer-Verlag, New York, 1978, pp. 536-551.
	19	Fereidoon Sadri , Jeffrey D. Ullman, A complete axiomatization for a large class of dependencies in relational datatbases, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.117-122, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804659]
	20	STONIEBRAKER, IV. R. High level integrity assurance in relational database management systems. Electronic Research Lab. Rep. ERL-M473, Univ. of California, Berkeley, Aug. 1974.
	21	ZANIO~ O, C. Analysis and design of relational schemata for database systems. Tech. Rep. UCLA- ENG-7769, Dept. of Computer Science, Univ. of California, Los Angeles, July 1976.

CITED BY 10

	S. Hegner, Specification and implementation of programs for updating incomplete information databases, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.146-158, March 23-25, 1987, San Diego, California, United States
	Moshe Vardi, On the integrity of databases with incomplete information, Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.252-266, March 24-26, 1986, Cambridge, Massachusetts, United States
	T. Imielinski, Relative knowledge in a distributed database, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.197-209, March 23-25, 1987, San Diego, California, United States
	Victor Vianu, Dynamic functional dependencies and database aging, Journal of the ACM (JACM), v.34 n.1, p.28-59, Jan. 1987
	Richard Hull, Managing semantic heterogeneity in databases: a theoretical prospective, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.51-61, May 11-15, 1997, Tucson, Arizona, United States
	Tomasz Imielinski, Query processing in deductive databases with incomplete information, ACM SIGMOD Record, v.15 n.2, p.268-280, June 1986
	David Maier , Jeffrey D. Ullman , Moshe Y. Vardi, The revenge of the JD, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia
	Stephen J. Hegner, The complexity of embedded axiomatization for a class of closed database views, Annals of Mathematics and Artificial Intelligence, v.46 n.1-2, p.38-97, February 2006
	Stephen J. Hegner, An Order-Based Theory of Updates for Closed Database Views, Annals of Mathematics and Artificial Intelligence, v.40 n.1-2, p.63-125, January 2004
	Wenfei Fan, Dependencies revisited for improving data quality, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 09-12, 2008, Vancouver, Canada

INDEX TERMS

Classification:
H. Information Systems
H.2 DATABASE MANAGEMENT
H.2.1 Logical Design
Subjects: Schema and subschema; Data models

General Terms:
Design, Theory

REVIEW

"Don Goelman : Reviewer"

The setting of this paper is the theory of the design of relational databases. In particular, the author discusses certain types of data dependencies. These are kinds of constraints which must be satisfied for a relation to be cosidered valid. more...

Collaborative Colleagues:

Richard Hull: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player