Skip to main content

BCNF via Attribute Splitting

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7260))

Abstract

Boyce-Codd-Heath introduced criteria for good database design, which can be formulated in terms of FD’s only. Classical design decomposes relations iteratively using projections. BCNF can not be always achieved using projections alone. 3NF was introduced as a compromise. In this paper we summarize all the known characterizations of BCNF and formulate a new one. In [MR96], attribute splitting was suggested as a heuristics to achieve BCNF in case projections do not do the job. Here we show how attribute splitting can be used to restructure a database scheme iteratively such that the result will be in BCNF, is information preserving and preserves the functional dependencies.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Database. Addison Wesley (1994)

    Google Scholar 

  2. Arenas, M., Libkin, L.: A normal form for XML documents. ACM Transactions on Database Systems 29(1), 195–232 (2004)

    Article  Google Scholar 

  3. Arenas, M., Libkin, L.: An information-theoretic approach to normal forms for relational and XML data. Journal of ACM 52(2), 246–283 (2005)

    Article  MATH  Google Scholar 

  4. Bernstein, P.A., Goodman, N.: What does Boyce-Codd normal form do? In. In: Sixth Conference on VLDB, pp. 245–259 (1980)

    Google Scholar 

  5. Biskup, J.: Database Schema Design Theory: Achievements and Challenges. In: Bhalla, S. (ed.) CISMOD 1995. LNCS, vol. 1006, pp. 14–44. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  6. Biskup, J.: Grundlagen von Informationssystemen. Vieweg (1995)

    Google Scholar 

  7. Biskup, J.: Achievements of relational database schema design theory revisited. In: Thalheim, B., Libkin, L. (eds.) Semantics in Databases, pp. 29–54. Springer, Berlin (1998)

    Chapter  Google Scholar 

  8. Codd, E.F.: A relational model of large shared data banks. Communications of the ACM 13(2), 377–387 (1970)

    Article  MATH  Google Scholar 

  9. Codd, E.F.: Further normalization of the data base relational models. In: Rustin, R. (ed.) Data Base Systems, pp. 33–64. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  10. Codd, E.F.: Recent investigation in relational data base systems. In: IFIP Proceedings, pp. 1017–1021 (1974)

    Google Scholar 

  11. Fagin, R.: Normal forms and relational database operators. In: Proceedings of ACM-SIGMOD Conference on Management of Data, pp. 153–160 (1979)

    Google Scholar 

  12. Ferrarotti, F., Hartmann, S., Köhler, H., Link, S., Vincent, M.: The Boyce-Codd-Heath Normal Form for SQL. In: Beklemishev, L.D., de Queiroz, R. (eds.) WoLLIC 2011. LNCS, vol. 6642, pp. 110–122. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Heath, I.J.: Unacceptable file operations in a relational data base. In: Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access, and Control, San Diego, Ca., pp. 19–33 (1971)

    Google Scholar 

  14. Levene, M., Loizou, G.: Guided Tour of Relational Databases and Beyond. Springer, London (1999)

    Book  MATH  Google Scholar 

  15. Mannila, H., Räihä, K.J.: The Design of Relational Databases. Addison-Wesley (1992)

    Google Scholar 

  16. Makowsky, J.A., Ravve, E.: Translation Schemes and the Fundamental Problem of Database Design. In: Thalheim, B. (ed.) ER 1996. LNCS, vol. 1157, pp. 5–26. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  17. Makowsky, J.A., Ravve, E.V.: Dependency preserving refinement and the fundamental problem of database design. Data and Knowledge Engineering 24(3), 277–312 (1997)

    Article  MATH  Google Scholar 

  18. Liu, C., Vincent, M.W., Liu, J.: Strong functional dependencies and their application to normal forms in XML. ACM Transactions on Database Systems 29(3), 445–462 (2004)

    Article  Google Scholar 

  19. Schewe, K.-D.: Redundancy, dependencies and normal forms for xml databases. In: Dobbie, G., Williams, H. (eds.) Sixteenth Australasian Database Conference (ADC 2005). Conferences in Research and Practice in Information Technology, vol. 39, pp. 7–16. University of Newcastle, Newcastle (2005)

    Google Scholar 

  20. Sciore, E.: Comparing the universal instance and relational data models. In: Kanellakis, P.C., Preparata, F. (eds.) The Theory of Databases. Advances in Computing Research, vol. 3, pp. 139–163. JAI Press, Inc., Greenwich (1986)

    Google Scholar 

  21. Thalheim, B.: Entity-Relationship Modeling: Foundations of Database Technology. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  22. Trinh, D.-T.: XML Functional Dependencies based on Tree Homomorphisms. PhD thesis, Faculty of Mathematics/Informatics and Mechanical Engineering, Clausthal University of Technology, Clausthal, Germany (2009)

    Google Scholar 

  23. Ullman, J.D.: Principles of Database Systems, 2nd edn. Principles of Computer Science Series. Computer Science Press (1982)

    Google Scholar 

  24. Vincent, M.W.: The Semantic Justification of Normal Forms in Relational database Design. PhD thesis, Department of Computer Science, Monash University, Australia (1994)

    Google Scholar 

  25. Vincent, M.W.: Redundancy Elimination and a New Normal Form for Relational Database Design. In: Thalheim, B., Libkin, L. (eds.) Semantics in Databases 1995. LNCS, vol. 1358, pp. 247–264. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Vincent, M.W., Levene, M.: Restructuring partitioned normal form relations without information loss. In: Proceedings of International Conference on Management of Data (COMAD), Bombay, pp. 111–124 (1997)

    Google Scholar 

  27. Vincent, M.W., Srinivasan, B.: A note on relation schemes which are in 3NF but not in BCNF. Information Processing Letters 48, 281–283 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antje Düsterhöft Meike Klettke Klaus-Dieter Schewe

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Makowsky, J.A., Ravve, E.V. (2012). BCNF via Attribute Splitting. In: Düsterhöft, A., Klettke, M., Schewe, KD. (eds) Conceptual Modelling and Its Theoretical Foundations. Lecture Notes in Computer Science, vol 7260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28279-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28279-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28278-2

  • Online ISBN: 978-3-642-28279-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics