Skip to main content
SpringerLink
Log in

The fundamental problem of database design

  • Invited Papers
  • Conference paper
  • First Online:
SOFSEM'97: Theory and Practice of Informatics (SOFSEM 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1338))

Abstract

We introduce a new point of view into database schemes by applying systematically an old logical technique: translation schemes, and their induced formula and structure transformations. This allows us to re-examine the notion of dependency preserving decomposition and its generalization refinement. We have previously demonstrated the usefulness of this approach by recasting the theory of vertical and horizontal decompositions in our terminology.

The most important aspect of this approach, however, lies in laying the groundwork for a formulation of the Fundamental Problem of Database Design, namely to exhibit desirable differences between translation equivalent presentations of data and to examine refinements of data presentations in a systematic way. The emphasis in this paper is not on results. The main line of thought is an exploration of the use of an old logical tool in addressing the Fundamental Problem.

Partially supported by a Grant of the German-Israeli Foundation and by the Fund for Promotion of Research of the Technion-Israeli Institute of Technology

Partially supported by a Grant of the German-Israeli Foundation

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Database. Addison Wesley, 1994.

    Google Scholar 

  2. F. Bancilhon and N. Spyratos. Update semantics of relational views. ACM Transactions on Database Systems, 6(4):557–575, 1981.

    Google Scholar 

  3. K.J. Compton and C.W. Henson. A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48:1–79, 1990.

    Google Scholar 

  4. B. Courcelle. Monadic second order graph transductions: A survey. Theoretical Computer Science, 126:53–75, 1994.

    Google Scholar 

  5. E. Dahlhaus. Reductions to NP-complete problems by interpretations. In E. Börger et. al., editor, Logic and Machines: Decision Problems and Complexity, volume 171, pages 357–365. Springer Verlag, 1983.

    Google Scholar 

  6. A. Dawar. Feasible Computation Through Model Theory. PhD thesis, Department of Computer Science, University of Maryland, 1993.

    Google Scholar 

  7. H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic, 2nd edition. Undergraduate Texts in Mathematics. Springer-Verlag, 1994.

    Google Scholar 

  8. R. Fagin. A normal form for relational databases that is based on domains and keys. ACM Transactions on Database Systems, 6(3):387–415, 1981.

    Google Scholar 

  9. R. Fagin and M. Vardi. The theory of data dependencies. In M. Anshel and W. Gewirtz, editors, Proceedings of Symposia in Applied Mathematics, volume 34 of American Mathematical Society, pages 19–71. RI, 1986.

    Google Scholar 

  10. D. Hilbert and P. Bernays. Grundlagen der Mathematik, I, volume 40 of Die Grundleheren der mathematischen Wissenschaften in Einzeldarstellungn. Springer Verlag, Heidelberg, 2nd edition, 1970.

    Google Scholar 

  11. C. Herrmann. On the ubdecidability of implication between embedded multivalued database dependencies. Information and Computation, 122:221–235, 1995.

    Google Scholar 

  12. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, Aug 1987.

    Google Scholar 

  13. P.G. Kolaitis. Implicit definability on finite structures and unambiguous computations. In LiCS'90, pages 168–180. IEEE, 1990.

    Google Scholar 

  14. A. Keller and J.D. Ullman. On complementary and independent mappings on databases. Proceedings of ACM SIGMOD Annual Meeting on the Management of Data, 14(2):145–148, 1984.

    Google Scholar 

  15. D. Maier. The Theory of Relational Databases. Computer Science Press, 1983.

    Google Scholar 

  16. J.A. Makowsky. Capturing complexity classes with Lindström quantifiers. In MFCS'94, volume 841 of Lecture Notes in Computer Science, pages 68–71. Springer Verlag, 1994.

    Google Scholar 

  17. H. Mannila and K. J. Räihä. The Design of Relational Databases. Addison-Wesley, 1992.

    Google Scholar 

  18. J.A. Makowsky and E. Ravve. Dependency preserving refinement of database schemes. Technical Report, April 1996, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1996.

    Google Scholar 

  19. J.A. Makowsky and E. Ravve. Translation schemes and the fundamental problem of database design. In Conceptual Modeling-ER'96, volume 1157 of Lecture Notes in Computer Science, pages 5–26. Springer Verlag, 1996.

    Google Scholar 

  20. J.A. Makowsky and E. Ravve. Dependency preserving refinements and the fundamental problem of database design. In Data and Knowledge Engineering, to appear 1997.

    Google Scholar 

  21. J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht, editors. The Structure of the Relational Database Model, volume 17 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Heidelberg, 1989.

    Google Scholar 

  22. M.A. Rabin. A simple method for undecidability proofs and some applications. In Y. Bar Hillel, editor, Logic, Methodology and Philosophy of Science II, Studies in Logic, pages 58–68. North Holland, 1965.

    Google Scholar 

  23. E. Ravve. Ph.D. Thesis, Department of Computer Science, Technion-Israel Institute of Technology, to be completed in 1998.

    Google Scholar 

  24. B. Thalheim. Dependencies in Relational Databases, volume 126 of Teubner-Texte zur Mathematik. B.G. Teubner Verlagsgesellschaft, Leipzig, 1991.

    Google Scholar 

  25. B. Thalheim. Foundation of entity-relationship modeling. Annals of Mathematics and Artificial Intelligence, 7:197–256, 1993.

    Google Scholar 

  26. B. Thalheim. A survey on database constraints. Reine Informatik I-8/1994, Fakultät für Mathematik, Naturwissenschaften and Informatik, 1994.

    Google Scholar 

  27. J.D. Ullman. Principles of Database Systems. Principles of Computer Science Series. Computer Science Press, 2nd edition, 1982.

    Google Scholar 

  28. J. Ullman and J. Widom. A First Course in Databases System. Prentice-Hall, 1997.

    Google Scholar 

  29. M. Vardi. Fundamentals of dependency theory. In Trends in Theoretical Computer Science, pages 171–224. Computer Science Press, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel

    J. A. Makowsky & E. V. Ravve

Authors
  1. J. A. Makowsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. V. Ravve
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

František Plášil Keith G. Jeffery

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makowsky, J.A., Ravve, E.V. (1997). The fundamental problem of database design. In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-63774-5_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63774-5

  • Online ISBN: 978-3-540-69645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation