[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1007/11827252_11guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Relationship design using spreadsheet reasoning for sets of functional dependencies

Published: 03 September 2006 Publication History

Abstract

Entity-Relationship and other common database modeling tools have restricted capabilities for designing a relationship of higher arity. Although a complete and unambiguous specification can be achieved by traditional functional dependencies for relational schemata, use of the traditional formal notation in practice is rare. We propose an alternative way: designing or surveying the properties of a non-binary relationship among object classes or attributes is considered by spreadsheet reasoning methods for functional dependencies. Another representation by the semilattice of closed attribute sets can also be used in parallel due to convenient conversion facilities.

References

[1]
S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases. Addison-Wesley, Reading, MA, 1995.
[2]
M. Albrecht, E. Buchholz, A. Düsterhöft, and B. Thalheim. An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. In Proc. Semantics in Databases, LNCS 1358, pages 1-28. Springer, Berlin, 1998.
[3]
W. W. Armstrong. Dependency structures of data base relationships. In J. L. Rosenfeld, editor, Information Processing 74, Proceedings of IFIP Congress 74, pages 580-583, Stockholm, Aug. 5-10, 1974, 1974. North-Holland, Amsterdam.
[4]
J. Biskup. Boyce-codd normal forma and object normal forms. Information Processing Letters, 32(1):29-33, 1989.
[5]
J. Biskup. Foundations of information systems. Vieweg, Wiesbaden, 1995. In German.
[6]
J. Biskup, J. Demetrovics, L. O. Libkin, and M. Muchnik. On relational database schemes having a unique minimal key. J. of Information Processing, 27:217-225, 1991.
[7]
J. Biskup and T. Polle. Decomposition of database classes under path functional dependencies and onto contraints. In Proc. FoIKS'2000, LNCS 1762, pages 31-49. Springer, 2000, 2000.
[8]
G. Burosch, J. Demetrovics, G. O. H. Katona, D. J. Kleitman, and A. A. Sapozhenko. On the number of databases and closure operations. TCS, 78(2):377- 381, 1991.
[9]
R. Camps. From ternary relationship to relational tables: A case against common beliefs. ACM SIGMOD Record, 31(2), pages 46-49, 2002.
[10]
N. Caspard and B. Monjardet. The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics, 127:241-269, 2003.
[11]
Chen & Associates, Baton Rouge, LA. ER-designer reference manual, 1986-1989.
[12]
P. P. Chen. The entity-relationship model: Toward a unified view of data. ACM TODS, 1(1):9-36, 1976.
[13]
P. P. Chen, editor. Proc. 1st Int. ER Conf., ER'79: Entity-Relationship Approach to Systems Analysis and Design, Los Angeles, USA, 1979, 1980. North-Holland, Amsterdam.
[14]
E. F. Codd. A relational model for large shared data banks. CACM, 13(6):197-204, 1970.
[15]
J. Demetrovics and N. X. Huy. Translations of relation schemes and representations of closed sets. PU.M.A.Ser. A, 1(3-4):299-315, 1990.
[16]
J. Demetrovics, L. O. Libkin, and I. B. Muchnik. Functional dependencies and the semilattice of closed classes. In Proc. MFDBS'89, LNCS 364, pages 136-147, 1989
[17]
J. Demetrovics, A. Molnar, and B. Thalheim. Graphical and spreadsheet reasoning for sets of functional dependencies. Technical Report 0404, Kiel University, Computer Science Institute, http://www.informatik.uni-kiel.de/reports/ 2004/0404.html, 2004.
[18]
J. Demetrovics, A. Molnar, and B. Thalheim. Graphical reasoning for sets of functional dependencies. In Proceedings of ER 2004, Lecture Notes in Computer Science 3288, pages 166-179. Springer Verlag, 2004.
[19]
N. Habib and L. Nourine. The number of moore families on n=6. Discrete Mathematics, 294(3):291-296, 2005.
[20]
A. Higuchi. Note: Lattices of closure operators. Discrete Mathematics, 179:267- 272, 1998.
[21]
B. Thalheim. Entity-relationship modeling - Foundations of database technology. Springer, Berlin, 2000. See also http://www.informatik.tu-cottbus.de/~thalheim/ HERM.htm.

Cited By

View all
  • (2012)Foundations for a fourth normal form over SQL-Like databasesConceptual Modelling and Its Theoretical Foundations10.5555/2184207.2184215(85-100)Online publication date: 1-Jan-2012
  1. Relationship design using spreadsheet reasoning for sets of functional dependencies

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    ADBIS'06: Proceedings of the 10th East European conference on Advances in Databases and Information Systems
    September 2006
    447 pages
    ISBN:3540378995
    • Editors:
    • Yannis Manolopoulos,
    • Jaroslav Pokorný,
    • Timos K. Sellis

    Sponsors

    • Altec: Altec
    • Ministry of National Education and Religious Affairs: Ministry of National Education and Religious Affairs
    • G-net: G-net

    Publisher

    Springer-Verlag

    Berlin, Heidelberg

    Publication History

    Published: 03 September 2006

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 03 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2012)Foundations for a fourth normal form over SQL-Like databasesConceptual Modelling and Its Theoretical Foundations10.5555/2184207.2184215(85-100)Online publication date: 1-Jan-2012

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media