Article

Free access

Functional and inclusion dependencies a graph theoretic approach

Authors:

Stavros S. Cosmadakis,

Paris C. KanellakisAuthors Info & Claims

PODS '84: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems

Pages 29 - 37

https://doi.org/10.1145/588011.588016

Published: 02 April 1984 Publication History

Abstract

We present a new graph theoretic approach to the implication problem for functional (FD) and inclusion (IND) dependencies. Using this methodology we prove decidability for the case of typed IND's and acyclic FD's. We provide new lower bounds for the implication of typed, acyclic IND's and FD's --- NP-hardness and PSPACE-hardness for bounded domains. Finally, we show that there is no k-ary complete axiomatization for implication of FD's, even when we have pairwise consistency, i.e., all possible typed IND's hold.

References

[1]

{CFP} M.A. Casanova, R. Fagin, C.H. Papadimitriou, "Inclusion Dependencies and their Interaction with Functional Dependencies", Proc. ACM SIGACT-SIGMOD PODS (1982). (also IBM RJ3380).

Digital Library

[2]

{CV} M.A. Casanova, V.M.P. Vidal, "Towards a Sound View Integration Methodology", Proc. ACM SIGACT-SIGMOD PODS (1983).

Digital Library

[3]

{Co} E.F. Codd, "Extending the Database Relational Model to Capture More Meaning", ACM TODS 4,4 (1980).

Digital Library

[4]

{ChV} A. Chandra and M.Y. Vardi, "The Implication Problem for Functional and Inclusion Dependencies is Undecidable", March 1983.

[5]

{D} C. Date, "Referential Integrity", Proc. VLDB (1981).

[6]

{F1} R. Fagin, "A Normal Form for Relational Databases that is Based on Domains and Keys", ACM TODS 6,3 (1981).

Digital Library

[7]

{F2} R. Fagin, private communication, August 1983.

[8]

{GJ} M.R. Garey, D.S. Johnson, "Computers and Intractability: a Guide to the Theory of NP-Completeness", Freeman (1979).

Digital Library

[9]

{JK} D.S. Johnson, A. Klug, "Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies", Proc. ACM SIGACT-SIGMOD PODS (1982).

Digital Library

[10]

{KCV} P.C. Kanellakis, S.S. Cosmadakis, M.Y. Vardi. "Unary Inclusion Dependencies have Polynomial Time Inference Problems". Proc. 15th ACM STOC (1983).

Digital Library

[11]

{K} P.C. Kanellakis, "On the Computational Complexity of Cardinality Constraints in Relational Databases", IPL 11,2 (1980).

[12]

{LMG} K. Laver, A.O. Mendelzon, M.H. Graham, "Functional Dependencies on Cyclic Database Schemes". Proc. ACM SIGMOD (1983).

Digital Library

[13]

{M} J.C. Mitchell. "The Implication Problem for Functional and Inclusion Dependencies", Proc. ACM SIGACT-SIGMOD PODS (1983).

Digital Library

[14]

{Sc} E. Sciore, "Inclusion Dependencies and the Universal Instance", Proc. ACM SIGACT-SIGMOD PODS (1983).

Digital Library

[15]

{SS} J.M. Smith, D.C.P. Smith, "Database Abstractions: Aggregation", CACM 20,6 (1977).

Digital Library

Cited By

Koehler HLink S(2017)Inclusion dependencies and their interaction with functional dependencies in SQLJournal of Computer and System Sciences10.1016/j.jcss.2016.11.00485:C(104-131)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1016/j.jcss.2016.11.004
Köhler HLink SBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Inclusion Dependencies ReloadedProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806539(1361-1370)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806539
Wang QWen XDesai BToyama M(2015)Propagating Dependencies under Schema MappingsProceedings of the 19th International Database Engineering & Applications Symposium10.1145/2790755.2790766(126-135)Online publication date: 13-Jul-2015
https://dl.acm.org/doi/10.1145/2790755.2790766
Show More Cited By

Recommendations

Inclusion dependencies and their interaction with functional dependencies
PODS '82: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems

Inclusion dependencies, or INDs (which can say, for example, that every manager is an employee) are studied, including their interaction with functional dependencies, or FDs. A simple complete axiomatization for INDs is presented, and the decision ...
Extending inclusion dependencies with conditions

This paper introduces a class of conditional inclusion dependencies (CINDs), which extends inclusion dependencies (INDs) by enforcing patterns of semantically related data values. We show that CINDs are useful not only in data cleaning, but also in ...
Inclusion dependencies and their interaction with functional dependencies in SQL

Driven by the SQL standard, we investigate simple and partial inclusion dependencies (INDs) with not null constraints. Implication of simple INDs and not null constraints is not finitely axiomatizable. We propose not null inclusion dependencies (NNINDs) ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '84: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems

April 1984

341 pages

ISBN:0897911288

DOI:10.1145/588011

Conference Chair:
Daniel Rosenkrantz
SUNY Albany, Albany, NY
,
Program Chair:
Ronald Fagin
IBM Research Laboratory, San Jose, California

Copyright © 1984 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 April 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODS '84

Sponsor:

PODS '84: Principles of database systems

April 2 - 4, 1984

Ontario, Waterloo, Canada

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
558
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)3

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Koehler HLink S(2017)Inclusion dependencies and their interaction with functional dependencies in SQLJournal of Computer and System Sciences10.1016/j.jcss.2016.11.00485:C(104-131)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1016/j.jcss.2016.11.004
Köhler HLink SBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Inclusion Dependencies ReloadedProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806539(1361-1370)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806539
Wang QWen XDesai BToyama M(2015)Propagating Dependencies under Schema MappingsProceedings of the 19th International Database Engineering & Applications Symposium10.1145/2790755.2790766(126-135)Online publication date: 13-Jul-2015
https://dl.acm.org/doi/10.1145/2790755.2790766
Cohen SGottlob GVan den Bussche J(2006)Equivalence of queries combining set and bag-set semanticsProceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1142351.1142362(70-79)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1142351.1142362
Golfarelli MLechtenbörger JRizzi SVossen G(2006)Schema versioning in data warehousesData & Knowledge Engineering10.1016/j.datak.2005.09.00459:2(435-459)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1016/j.datak.2005.09.004
Cosmadakis SKanellakis P(2005)Two applications of equational theories to database theoryRewriting Techniques and Applications10.1007/3-540-15976-2_5(107-123)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-15976-2_5
Zhang XOzsoyoglu Z(1997)Implication and Referential ConstraintsIEEE Transactions on Knowledge and Data Engineering10.1109/69.6493159:6(894-910)Online publication date: 1-Nov-1997
https://dl.acm.org/doi/10.1109/69.649315
Rosenthal AReiner D(1994)Tools and transformations—rigorous and otherwise—for practical database designACM Transactions on Database Systems10.1145/176567.17656819:2(167-211)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1145/176567.176568
Missaoui RGodin R(1990)The implication problem for inclusion dependenciesACM SIGMOD Record10.1145/382274.38240219:1(36-40)Online publication date: 1-Mar-1990
https://dl.acm.org/doi/10.1145/382274.382402
Cosmadakis SKanellakis PSedgewick R(1985)Equational theories and database constraintsProceedings of the seventeenth annual ACM symposium on Theory of computing10.1145/22145.22176(273-284)Online publication date: 1-Dec-1985
https://dl.acm.org/doi/10.1145/22145.22176

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents