[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/582192.582208acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free access

Functional dependencies on cyclic database schemes

Published: 01 May 1983 Publication History

Abstract

We study how functional dependencies affect the cyclicity of a database scheme; in particular, when does a set of functional dependencies make a cyclic database scheme behave like an acyclic one.A database scheme is fd-acyclic if every pairwise-consistent database state that satisfies the fd's is join-consistent. We give a simple characterization of fd-acyclicity over a restricted class of database schemes. We then give a tableau-based characterization for the general case that leads to an algorithm for testing fd-acyclicity. This algorithm actually solves the more general problem of query equivalence under functional dependencies and typed inclusion dependencies.

References

[1]
{ASU} Aho, A., Sagiv, Y., Ullman, J., "Equivalences Among Relational Expressions", SIAM J. Comp. 8,2 (1979), pp. 218--246.
[2]
{B+} Beeri, C., Fagin, R., Maier, D., Mendelzon, A.O., Ullman, J.D., Yannakakis, M., "Properties of Acyclic Database Schemes", Proc. 13th Ann. ACM Symp. Theory of Comp., (1981).
[3]
{BFMY} Beeri, C., Fagin, R., Maier, D., Yannakakis, M., "On The Desirable Properties of Acyclic Database Schemas", IBM Report RJ3131, San Jose, Calif., 1981.
[4]
{BG} Bernstein, P.A., Goodman, N., "The Power of Natural Semi-Joins", Siam J. of Comp., 10,4, (1981).
[5]
{CFP} Casanova, M.A., Fagin, R., Papadimitriou, C.H., "Inclusion Dependencies and Their Interaction with Functional Dependencies", Proc. First ACM SIGACT-SIGMOD Conf. on Principles of Database Systems (1982), pp. 171--176.
[6]
{CM} Chan, E., Mendelzon, A.O., "Separable and Independent Database Schemes", to appear, Second ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, 1983.
[7]
{F1} Fagin, R., "Horn Clauses and Data Dependencies", JACM 29, 4 (1982), pp. 952--985.
[8]
{F2} Fagin, R., "Multivalued Dependencies and a New Normal Norm for Relational Databases", ACM Trans. Database Syst., 2,3 (1977), pp. 262--278.
[9]
{FMU} Fagin, R., Mendelzon, A.O., Ullman, J.D., "A Simplified Universal Relation Assumption and its Properties", ACM Trans. Database Syst., 7,3 (1982), pp. 343--360.
[10]
{G} Graham, M.H., "Satisfying Database States", Ph.D. thesis, University of Toronto, Dept. of Computer Science, 1981.
[11]
{GM} Graham, M., Mendelzon, A.O., "Strong Equivalence of Relational Expressions Under Dependencies", Infor. Proc. Letters, 14,2, (1982), pp. 57--62.
[12]
{GS} Goodman, N., Shmueli, O., "Tree Queries: A Simple Class of Relational Queries", ACM Trans. Database Syst., 7,4 (1982), pp. 653--677.
[13]
{GS2} Goodman, N., Shmueli, O., "Limitations of the Chase", Infor. Proc. Letters, 13,4 (1982), pp. 154--157.
[14]
{GY} Graham, M., Yannakakis, M., "Independent Database Schemes", Proc. First ACM SIGACT-SIGMOD Conf. on Principles of Database Systems (1982), pp. 199--205.
[15]
{H} Honeyman, P., "Testing Satisfaction of Functional Dependencies", JACM 29,3 (1982), pp. 668--677.
[16]
{JK} Johnson, D.S., Klug,A., "Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies", Proc. First ACM SIGACT-SIGMOD Conf. on Principles of Database Systems (1982), pp. 164--169.
[17]
{K} Katsumo, H., "A Desirable Class of Sets Of FD's and MVD's", NTT Technical Report, Japan, (1982).
[18]
{L} Laver, K., Forthcoming Ph.D. dissertation, Univ. of Toronto.
[19]
{MMS} Maier, D., Mendelzon, A.O., Sagiv, Y., "Testing Implications of Data Dependencies", ACM Trans. Database Syst., 4,4 (1979), pp. 455--469.
[20]
{S} Sagiv, Y., "Can we use the universal instance assumption without using nulls?", Proc. ACM-SIGMOD 1981 International Conf. on Management of Data (1981), pp. 108--120.
[21]
{U} Ullman, J.D., "Principles of Database Systems", Computer Science Press, 2nd ed., (1982).
[22]
{V} Vassiliou, Y., "A Formal Treatment of Imperfect Information in Database Management", Ph.D thesis, Univ. of Toronto, (1980).

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '83: Proceedings of the 1983 ACM SIGMOD international conference on Management of data
May 1983
252 pages
ISBN:0897911040
DOI:10.1145/582192
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: 01 May 1983

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)89
  • Downloads (Last 6 weeks)17
Reflects downloads up to 11 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2005)The theory of data dependencies — An overviewAutomata, Languages and Programming10.1007/3-540-13345-3_1(1-22)Online publication date: 28-May-2005
  • (1993)Solving queries by tree projectionsACM Transactions on Database Systems10.1145/155271.15527718:3(487-511)Online publication date: 1-Sep-1993
  • (1985)Sagiv,Y-On finite FD-acyclicityProceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/6012.15422(173-182)Online publication date: 1-Jun-1985
  • (1985)The equivalence of solving queries and producing tree projections (extended abstract)Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/6012.15413(160-172)Online publication date: 1-Jun-1985
  • (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
  • (1984)Functional and inclusion dependencies a graph theoretic approachProceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/588011.588016(29-37)Online publication date: 2-Apr-1984
  • (1984)Properties of database schemata with functional dependenciesProceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/588011.588015(19-28)Online publication date: 2-Apr-1984
  • (1984)On the recognition and design of acyclic databasesProceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/588011.588013(1-8)Online publication date: 2-Apr-1984
  • (1990)Elements of Relational Database TheoryFormal Models and Semantics10.1016/B978-0-444-88074-1.50022-6(1073-1156)Online publication date: 1990
  • (1986)Invited Paper referencesRelational Databases10.1016/B978-0-08-034094-4.50022-X(273-289)Online publication date: 1986

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media