skip to main content
article

Strong functional dependencies and their application to normal forms in XML

Authors Info & Claims
Published:01 September 2004Publication History
Skip Abstract Section

Abstract

In this article, we address the problem of how to extend the definition of functional dependencies (FDs) in incomplete relations to XML documents (called XFDs) using the well-known strong satisfaction approach.We propose a syntactic definition of strong XFD satisfaction in an XML document and then justify it by showing that, similar to the case in relational databases, for the case of simple paths, keys in XML are a special case of XFDs. We also propose a normal form for XML documents based on our definition of XFDs and provide a formal justification for it by proving that it is a necessary and sufficient condition for the elimination of redundancy in an XML document.

References

  1. Arenas, M. and Libkin, L. 2002. A normal form for XML documents. In Proceedings of the ACM PODS Conference. 85--96. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Arenas, M. and Libkin, L. 2003. An information-theoretic approach to normal forms for relational and XML data. In Proceedings of the ACM PODS Conference. 15--26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Atzeni, P. and DeAntonellis, V. 1993. Foundations of Databases. Benjamin Cummings, San Francisco, CA.Google ScholarGoogle Scholar
  4. Bray, T., Paoli, J., and Sperberg-McQueen, C. 1998a. Extensible Markup Language (XML) 1.0. Technical rep. Available online at http://www.w3.org/Tr/1998/REC-XML-19980819.Google ScholarGoogle Scholar
  5. Bray, T., Paoli, J., and Sperberg-McQueen, C. M. 1998b. XML-data. W3C Note, Available online at http://www.w3.org/Tr/1998/Note-XML-data.Google ScholarGoogle Scholar
  6. Buneman, P., Davidson, S., Fan, W., and Hara, C. 2001a. Reasoning about keys for XML. In International Workshop on Database Programming Languages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Buneman, P., Davidson, S., Fan, W., Hara, C., and Tan, W. 2003. Reasoning about keys for XML. Inform. Syst. 28, 8, 1037--1063. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Buneman, P., Fan, W., Simeon, J., and Weinstein, S. 2001b. Constraints for semistructured data and XML. ACM SIGMOD Rec. 30, 1, 45--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Buneman, P., Fan, W., and Weinstein, S. 1998. Path constraints on structured and semistructured data. In Proceedings of the ACM PODS Conference. 129--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Cover, T. and Thomas, J. 1991. Elements of Information Theory. Wiley-Interscience, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Fagin, R. 1979. Normal forms and relational database operators. In ACM SIGMOD International Conference on the Management of Data. 123--134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Fan, W. and Libkin, L. 2002. On XML integrity constraints in the presence of DTDs. J. ACM 49, 3, 368--406. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Fan, W. and Simeon, J. 2003. Integrity constraints for XML. J. Comput. Syst. Sci. 66, 1, 254--291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. LeHors, A., LeHgaret, P., Wood, L., Nicol, G., Robie, J., Champion, M., and Byrne, S. 2003. Document object model (dom) level 3 core specifications. Technical rep. Available online at http://www.w3.org/TR/2003/WD-DOM-Level-3-Core-20030609/.Google ScholarGoogle Scholar
  15. Levene, M. and Vincent, M. W. 2000. Justification for inclusion dependency normal form. IEEE Trans. Knowl. Data Eng. 12, 281--291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Thompson, H. S., Beech, D., Maloney, M., and Mendelsohn, N. 2001. XML schema part 1:structures. W3C Working Draft. Available online at http://www.w3.org/Tr/1998/XMLschema-1.Google ScholarGoogle Scholar
  17. Vincent, M., Liu, J., and Liu, C. 2003a. The implication problem for unary functional dependencies in XML. Submitted for publication.Google ScholarGoogle Scholar
  18. Vincent, M., Liu, J., and Liu, C. 2003b. Strong functional dependencies and a redundancy free normal form for XML. Research rep. ACRC-03-011. School of Computer and Information Science, University of South Australia, Mawson Lakes, Adelaide, Australia. Available online at http://www.cis.unisa.edu.au/ cismwv/papers/index.html.Google ScholarGoogle Scholar
  19. Vincent, M. W. 1994. Semantic foundations of normal forms in relational database design. Ph.D. dessirtation. Department of Computer Science, Monash University, Melbourne, Victoria, Australia.Google ScholarGoogle Scholar
  20. Vincent, M. W. 1997. A corrected 5NF definition for relational database design. Theoret. Comput. Sci. 185, 379--391. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Vincent, M. W. 1998. A new redundancy free normal form for relational database design. In Database Semantics, B. Thalheim and L. Libkin, Eds. Springer Verlag, Berlin, Germany, 247--264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Vincent, M. W. 1999. Semantic foundations of 4NF in relational database design. Acta Informatica 36, 1--41.Google ScholarGoogle ScholarCross RefCross Ref
  23. Widom, J. 1999. Data management for XML---research directions. IEEE Data Eng. Bull. 22, 3, 44--52.Google ScholarGoogle Scholar

Index Terms

  1. Strong functional dependencies and their application to normal forms in XML

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Database Systems
            ACM Transactions on Database Systems  Volume 29, Issue 3
            September 2004
            136 pages
            ISSN:0362-5915
            EISSN:1557-4644
            DOI:10.1145/1016028
            Issue’s Table of Contents

            Copyright © 2004 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: 1 September 2004
            Published in tods Volume 29, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader