Article

Free access

Unary inclusion dependencies have polynomial time inference problems

Authors:

Paris C. Kanellakis,

Stavros S. Cosmadakis,

Moshe Y. VardiAuthors Info & Claims

STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing

Pages 264 - 277

https://doi.org/10.1145/800061.808756

Published: 01 December 1983 Publication History

Abstract

We study the interaction between unary inclusion dependencies (UIND's) and other known classes of dependencies, in the context of both unrestricted and finite implication. We provide complete axiomatizations for unrestricted and finite implication of UIND's and functional dependencies, and polynomial-time algorithms for the inference problems. The inference problem becomes, however, NP-hard, if we require that some attribute have a bounded domain. We show that for unrestricted implication, the interaction between UIND's and unary functional dependencies completely characterizes the interaction between UIND's and embedded implicational dependencies. Also, for finite implication, the interaction between UIND's and unary functional dependencies completely characterizes the interaction between UIND's and full implicational dependencies (but not UIND's and embedded implicational dependencies).

References

[1]

A.V. Aho, C. Beeri, J.D. Ullman, "The Theory of Joins in Relational Databases", ACM TODS 4, (1979).

Digital Library

[2]

A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley (1974).

Digital Library

[3]

W.W. Armstrong, "Dependency Structures of Database Relationships", Proc. IFIP 74, (1974).

[4]

C. Beeri, P.A. Bernstein, "Computational Problems Related to the Design of Normal Form Relational Schemas", ACM TODS 4,1 (March 1979).

Digital Library

[5]

C. Beeri, R. Fagin, and J.H. Howard, "A complete axiomatization for functional and multivalued dependencies in database relations", Proc. ACM-SIGMOD International Conference on Management of Data, (August 1977).

Digital Library

[6]

F. Bancilhon, and N. Spyratos, "Update semantics of relational views", ACM TODS 6. 4, (December 1981).

Digital Library

[7]

C. Beeri, M.Y. Vardi, "A Proof Procedure for Data Dependencies", Technical Report, Department of Computer Science, The Hebrew University of Jerusalem, (December 1980).

[8]

C. Beeri, M.Y. Vardi, "On Acyclic Database Decompositions", to appear.

[9]

C. Beeri, M.Y. Vardi, "Formal Systems for Tuple and Equality Generating Dependencies", Hebrew Univ. of Jerusalem Technical Report (April 1981), to appear in SICOMP.

[10]

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

Digital Library

[11]

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

Digital Library

[12]

S.S. Cosmadakis, and C.H. Papadimitriou, "Updates of relational views", Proc. 2ndACM SIGACT-SIGMOD PODS

Digital Library

[13]

A. Chandra and M.Y. Vardi, Private communication, 1983.

[14]

B. Dreben, W.B. Godfarb, "The Decision Problem - Solvable classes of quantificational formulas", Addison-Wesley, (1979).

[15]

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

Digital Library

[16]

R. Fagin, "Multivalued Dependencies and a New Normal Form for Relational Databases", ACM TODS 2,3 (1977).

Digital Library

[17]

R. Fagin, "Horn Clauses and Database Dependencies", Proc. ACM SIGACT STOC (1980).

Digital Library

[18]

R. Fagin, M.Y. Vardi, "Armstrong Databases for Functional and Inclusion Dependencies", IBM Technical Report RJ3500 (1982), to appear in IPL.

[19]

Z. Galil, "An almost linear-time algorithm for computing a dependency basis in a relational database", JACM 29, 1, (January 1982).

Digital Library

[20]

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

Digital Library

[21]

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

Digital Library

[22]

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

[23]

J.C. Mitchell, "The Implication Problem for Functional and Inclusion Dependencies", to appear (1983).

[24]

D. Maier, A.O. Mendelzon, Y. Sagiv, "Testing Implications of Data Dependencies", ACM TODS 2 (1977).

Digital Library

[25]

Y. Sagiv, C. Delobel, D. Stott Parker Jr., and R. Fagih, "An equivalence between database dependencies and a fragment of propositional logic", JACM 28, 3, (July 1981).

Digital Library

[26]

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

Digital Library

[27]

M.Y. Vardi, "The Implication Problem for Data Dependencies in Relational Databases", Ph.D. Thesis, The Hebrew University of Jerusalem, (1981).

[28]

M.Y. Vardi, "On decomposition of relational databases", Proc. 23rdFOCS Conference, (1982).

Digital Library

[29]

M. Yannakakis, C.H. Papadimitriou, "Algebraic Dependencies", Proc. 21st IEEE FOCS (1980).

Cited By

Zykin S(2024)Minimal coverage of generalized typed inclusion dependencies in databasesModeling and Analysis of Information Systems10.18255/1818-1015-2024-1-78-8931:1(78-89)Online publication date: 28-Mar-2024
https://doi.org/10.18255/1818-1015-2024-1-78-89
Zykin S(2023)Generalization of typed include dependencies with null values in databasesModeling and Analysis of Information Systems10.18255/1818-1015-2023-3-192-20130:3(192-201)Online publication date: 17-Sep-2023
https://doi.org/10.18255/1818-1015-2023-3-192-201
Zykin VZykin S(2019)Analysis of Typed Inclusion Dependences with Null ValuesAutomatic Control and Computer Sciences10.3103/S014641161807025852:7(638-646)Online publication date: 4-Mar-2019
https://doi.org/10.3103/S0146411618070258
Show More Cited By

Index Terms

Unary inclusion dependencies have polynomial time inference problems
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages
      1. Relational database query languages

Recommendations

Polynomial-time implication problems for unary inclusion dependencies

Unary inclusion dependencies are database constraints expressing subset relationships. The decidability of implication for these dependencies together with embedded implicational dependencies, such as functional dependencies, are investigated. As shown ...
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) ...
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 ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing

December 1983

487 pages

ISBN:0897910990

DOI:10.1145/800061

Copyright © 1983 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
63
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zykin S(2024)Minimal coverage of generalized typed inclusion dependencies in databasesModeling and Analysis of Information Systems10.18255/1818-1015-2024-1-78-8931:1(78-89)Online publication date: 28-Mar-2024
https://doi.org/10.18255/1818-1015-2024-1-78-89
Zykin S(2023)Generalization of typed include dependencies with null values in databasesModeling and Analysis of Information Systems10.18255/1818-1015-2023-3-192-20130:3(192-201)Online publication date: 17-Sep-2023
https://doi.org/10.18255/1818-1015-2023-3-192-201
Zykin VZykin S(2019)Analysis of Typed Inclusion Dependences with Null ValuesAutomatic Control and Computer Sciences10.3103/S014641161807025852:7(638-646)Online publication date: 4-Mar-2019
https://doi.org/10.3103/S0146411618070258
Biskup J(2005)Achievements of relational database schema design theory revisitedSemantics in Databases10.1007/BFb0035004(29-54)Online publication date: 23-Jun-2005
https://doi.org/10.1007/BFb0035004
Biskup J(2005)Database schema design theory: Achievements and challengesInformation Systems and Data Management10.1007/3-540-60584-3_22(14-44)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-60584-3_22
Thalheim B(2005)Fundamentals of cardinality constraintsEntity-Relationship Approach — ER '9210.1007/3-540-56023-8_3(7-23)Online publication date: 28-May-2005
https://doi.org/10.1007/3-540-56023-8_3
Coburn NWeddell G(2005)Path constraints for graph-based data models: Towards a unified theory of typing constraints, equations, and functional dependenciesDeductive and Object-Oriented Databases10.1007/3-540-55015-1_17(312-331)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-55015-1_17
Weddell GCoburn N(2005)A theory of specialization constraints for complex objectsICDT '9010.1007/3-540-53507-1_80(229-244)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-53507-1_80
Heuer A(2005)Equivalent schemes in semantic, nested relational, and relational database modelsMFDBS 8910.1007/3-540-51251-9_16(237-253)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-51251-9_16
Heuer A(2005)A data model for complex objects based on a semantic database model and nested relationsNested Relations and Complex Objects in Databases10.1007/3-540-51171-7_33(297-312)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-51171-7_33
Show More Cited By

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