Skip to main content
SpringerLink
Log in

On the equivalence between FDs in XML and FDs in relations

  • Original article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

With the growing use of the eXtensible Markup Language (XML) in database technology as a format for the permanent storage of data, the topic functional dependencies in XML (XFDs) has assumed increased importance because of its central role in database design. Recently, two different approaches have been proposed for defining an XFD. The first uses the concept of a ‘tree tuple’, whereas the second uses the concept of a ‘closest node’. In general, the two approaches are not comparable, but are comparable when a Document Type Definition is present and there is no missing information in the XML document. The first contribution of this article shows that when the two XFD definitions are comparable, the definitions are equivalent, and so there is essentially a common definition of an XFD in complete XML documents. The second contribution is to provide justification for the definition of a ‘closest node’ XFD. We show that if a complete flat relation is mapped to an XML document by an arbitrary sequence of nest operations, the XML document satisfies a ‘closest node’ XFD if and only if the relation satisfies the corresponding functional dependency. The class of XML documents generated in this fashion is a subset of the class of XML documents for which the two definitions of XFDs coincide. Hence ‘tree tuple’ and ‘closest node’ XFDs both capture the semantics of FDs when a complete relation is mapped to an XML document via arbitrary nesting.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abiteboul S., Hull R. and Vianu V. (1996). Foundations of databases. Addison–Wesley, Reading

    Google Scholar 

  2. Arenas, M., Barcelo, P., Fagin, R., Libkin, L.: Locally consistent transformations and query answering in data exchange. In: PODS, pp. 229–240 (2004)

  3. Arenas, M., Libkin, L.: A normal form for XML documents. In: PODS, pp. 85–96 (2002)

  4. Arenas, M., Libkin, L.: An information-theoretic approach to normal forms for relational and XML data. In: ACM Principles of Databases Conference, pp. 15–26 (2003)

  5. Arenas M. and Libkin L. (2004). A normal form for XML documents. TODS 29(1): 195–232

    Article  Google Scholar 

  6. Arenas M. and Libkin L. (2005). An information-theoretic approach to normal forms for relational and XML data. JACM 52(2): 246–283

    Article  MathSciNet  Google Scholar 

  7. Atzeni P. and DeAntonellis V. (1993). Relational Database Theory. Benjamin Cummings, Reading

    MATH  Google Scholar 

  8. Beyer, K., Cochrane, R., Josifovski, V., Kleewein, J., Lapis, G., Lohman, G.: System RX: one part relational, one part XML. In: ACM SIGMOD Conference, pp. 347–358 (2005)

  9. Boag, S., Chamberlin, D., Fernandez, M.F., Florescu, D., Robie, J., Simeon, J.: XQuery 1.0: an XML query language (2005). http://www.w3.org/TR/2005/CR-xquery-20051103/

  10. Bray, T., Paoli, J., Sperberg-McQueen, C.: Extensible markup language (XML) 1.0. Technical report (1998). http://www.w3.org/Tr/1998/REC-XML-19980819

  11. Buneman P., Davidson S., Fan W., Hara C. and Tan W. (2003). Reasoning about keys for XML. Inf. Syst. 28(8): 1037–1063

    Article  Google Scholar 

  12. Buneman, P., Fan, W., Weinstein, S.: Path constraints on structured and semistructured data. In: ACM PODS Conference, pp. 129–138 (1998)

  13. Chen, Y., Davidson, S., Hara, C., Y.Zheng: RRXS:redundancy reducing XML storage in relations. In: VLDB, pp. 189–200 (2003)

  14. Cover T. and Thomas J. (1991). Elements of Information Theory. Wiley, New York

    MATH  Google Scholar 

  15. Davidson, S., Fan, W., Hara, C., , Qin, J.: Propagating XML constraints to relations. In: The 19th International Conference on Data Engineering (ICDE), pp. 543–554 (2003)

  16. Embley, D.W., Mok, W.Y.: Developing XML documents with guaranteed “good” properties. In: ER 2001, 20th International Conference on Conceptual Modeling, pp. 426 –441 (2001)

  17. Fagin, R.: Normal forms and relational database operators. In: ACM SIGMOD Conference, pp. 123–134 (1979)

  18. Fagin, R., Kolaitis, P., Popa, L., Tan, W.: Composing schema mappings: second-order dependencies to the rescue. In: ACM PODS Conference, pp. 83–94 (2004)

  19. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: International Conference on Database Theory, pp. 207–224 (2003)

  20. Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. In: ACM PODS conference, pp. 90–101 (2003)

  21. Fan, W.: XML constraints: Specification, analysis, and applications. In: DEXA Workshops 2005, pp. 805–809 (2005)

  22. Fan W. and Libkin L. (2002). On XML integrity constraints in the presence of DTDs. JACM 49(3): 368–406

    Article  MathSciNet  Google Scholar 

  23. Fan W. and Simeon J. (2003). Integrity constraints for XML. J. Comput. Syst. Sci. 66(1): 254–291

    Article  MATH  MathSciNet  Google Scholar 

  24. Gottlob, G., Schrefl, M., Stumptner, M.: On the interaction between transitive closure and functional dependencies. In: Second Symposium on Mathematical Fundamentals of Database Systems, pp. 187–206 (1989)

  25. Halverson, A., Josifovski, V., Lohman, G., Pirahesh, H., Mšrschel, M.: ROX: Relational over XML. In: VLDB Conference, pp. 264–275 (2005)

  26. Hartmann, S., T.T.: Axiomatising functional dependencies for XML with frequencies. In: FOIKS, pp. 159–178 (2006)

  27. Hartmann S., Link S. and Schewe K.D. (2005). Functional dependencies over XML documents with DTDs. Acta Cybern. 17(1): 153–171

    MATH  MathSciNet  Google Scholar 

  28. Klarlund, N., Schwentick, T., Suciu, D.: XML: Model, schemas, types, logics, and queries. In: Logics for Emerging Applications of Databases, pp. 1–41 (2003)

  29. Kolahi, S.: Dependency-preserving normalization of relational and XML data. In: DBPL, pp. 247–261 (2005)

  30. Lee, M., Ling, T., Low, W.L.: Designing functional dependencies for XML. In: EDBT Conference, pp. 124–141 (2002)

  31. Lenzerini, M.: Data integration: a theoretical perspective. In: ACM PODS Conference, pp. 233–246 (2002)

  32. Levene M. and Vincent M.W. (2000). Justification for inclusion dependency normal form. IEEE Trans. Knowl. Data Eng. 12: 281–291

    Article  Google Scholar 

  33. Libkin S. (2004). Elements of Finite Model Theory. Springer, Heidelberg

    MATH  Google Scholar 

  34. Lin T.W., Lee M.M. and Dobbie G. (2004). Semistructured Database Design. Springer, Heidelberg

    Google Scholar 

  35. Miller R.J., Hernndez M.A., Haas L.M., Yan L., Ho C.T.H., Fagin R. and Popa L. (2001). The clio project: Managing heterogeneity. SIGMOD Rec. 30(1): 78–83

    Article  Google Scholar 

  36. Moller, A., Schwartzbach, M.: Introduction to XML and Web Technologies. Addison–Wesley, Reading (2006)

  37. Schewe, K.D.: Redundancy, dependencies and normal forms for XML databases. In: ADC, pp. 7–16 (2005)

  38. Thomas, S., Fischer, P.: Nested relational structures. In: Kanellakis, P. (ed.) The Theory of Databases, pp. 269 –307. JAI Press, Greenwich, CT (1986)

  39. Thompson, H.S., Beech, D., Maloney, M., Mendelsohn, N.: XML Schema Part 1: Structures (2001). W3C Working Draft, http://www.w3.org/Tr/1998/XMLschema-1

  40. Velegrakis, Y., Miller, R.J., Mylopoulos, J.: Representing and querying data transformations. In: Proceedings of IEEE International Conference on Data Engineering, pp. 81–92 (2005)

  41. Vincent, M., Liu, J.: Multivalued dependencies and a 4NF for XML. In: CAISE, pp. 14–29 (2003)

  42. Vincent, M., Liu, J.: Multivalued dependencies in XML. In: BNCOD, pp. 4–18 (2003)

  43. Vincent, M., Liu, J., Liu, C.: Multivalued dependencies and a redundancy free 4NF for XML. In: XML Symposium, pp. 254–266 (2003)

  44. Vincent M., Liu J. and Liu C. (2004). Strong functional dependencies and their application to normal forms in XML. TODS 29(3): 445–462

    Article  Google Scholar 

  45. Vincent, M.W.: A new redundancy free normal form for relational database design. In: Database Semantics, pp. 247–264 (1998)

  46. Vincent M.W. (1999). Semantic foundations of 4NF in relational database design. Acta Inf. 36: 1–41

    Article  MathSciNet  Google Scholar 

  47. Vincent M.W. and Levene M. (2000). Restructuring partitioned normal relations without information loss. SIAM J. Comput. 39(5): 1550–1567

    Article  MathSciNet  Google Scholar 

  48. Wang, J., Topor, R.: Removing XML data redundancies using functional and equality-generating dependencies. In: ADC, pp. 65–74 (2005)

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Science, University of South Australia, Adelaide, SA, Australia

    Millist W. Vincent & Jixue Liu

  2. IBM Research Laboratories, New Delhi, India

    Mukesh Mohania

Authors
  1. Millist W. Vincent
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jixue Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mukesh Mohania
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Millist W. Vincent.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vincent, M.W., Liu, J. & Mohania, M. On the equivalence between FDs in XML and FDs in relations. Acta Informatica 44, 207–247 (2007). https://doi.org/10.1007/s00236-007-0048-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-007-0048-x

Keywords

Search

Navigation