XML to Relational Conversion Using Theory of Regular Tree Grammars

  • Murali Mani
  • Dongwon Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2590)


In this paper, we study the different steps of translation from XML to relational models, while maintaining semantic constraints. Our work is based on the theory of regular tree grammars, which provides a useful formal framework for understanding various aspects of XML schema languages. We first study two normal form representations for regular tree grammars. The first normal form representation, called NF1, is used in the two scenarios: (a) Several document validation algorithms use the NF1 representation as the first step in the validation process for efficiency reasons, and (b) NF1 representation can be used to check whether a given schema satisfies the structural constraints imposed by the schema language. The second normal form representation, called NF2, forms the basis for conversion of a set of type definitions in a schema language L 1 that supports union types (e.g., XML-Schema), to a schema language L 2 that does not support union types (e.g., SQL), and is used as the first step in our XML to relational conversion algorithm.


Production Rule Relational Schema Collection Type Tree Automaton Semantic Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P.V. Biron and A. Malhotra (Eds). “XML Schema Part 2: Datatypes”. W3C Recommendation, May 2001. 89
  2. [2]
    P. Bohannon, J. Freire, P. Roy, and J. Simeon. “From XML Schema to Relations: A Cost-Based Approach to XML Storage”. In IEEE ICDE, San Jose, CA, Feb. 2002. 82, 83Google Scholar
  3. [3]
    P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. “Keys for XML”. In Int’l World Wide Web Conf. (WWW), Hong Kong, May 2001. 100Google Scholar
  4. [4]
    D. Chamberlin, D. Florescu, J. Robie, J. Siméon, and M. Stefanescu (Eds). “XQuery 1.0: An XML Query Language”. W3C Working Draft, Jun. 2001. 81
  5. [5]
    J. Clark and M. Murata (Eds). “RELAX NG Tutorial”. OASIS Working Draft, Jun. 2001. 81, 83
  6. [6]
    H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. “Tree Automata Techniques and Applications”, 1997. 81
  7. [7]
    A. Deutsch, M. F. Fernandez, and D. Suciu. “Storing Semistructured Data with STORED”. In ACM SIGMOD, Philadephia, PA, Jun. 1998. 82, 83Google Scholar
  8. [8]
    D. Florescu and D. Kossmann. “Storing and Querying XML Data Using an RDBMS”. IEEE Data Eng. Bulletin, 22(3):27–34, Sep. 1999. 82, 83Google Scholar
  9. [9]
    H. Hosoya and B.C. Pierce. “XDuce: A Typed XML Processing Language”. In Int’l Workshop on the Web and Databases (WebDB), Dallas, TX, May 2000. 81, 83Google Scholar
  10. [10]
    D. Lee and W.W. Chu. “CPI: Constraints-Preserving Inlining Algorithm for Mapping XML DTD to Relational Schema”. J. Data & Knowledge Engineering (DKE), 39(1):3–25, Oct. 2001. 82, 83, 90CrossRefMathSciNetGoogle Scholar
  11. [11]
    D. Lee, M. Mani, F. Chiu, and W.W. Chu. “Nesting-based Relational-to-XML Schema Translation”. In Int’l Workshop on the Web and Databases (WebDB), Santa Barbara, CA, May 2001. 82Google Scholar
  12. [12]
    D. Lee, M. Mani, F. Chiu, and W.W. Chu. “NeT & CoT: Translating Relational Schemas to XML Schemas using Semantic Constraints”. Technical report, UCLA Computer Science Dept., Feb. 2002. 82, 89, 102Google Scholar
  13. [13]
    M. Mani, D. Lee, and R.D. Muntz. “Semantic Data Modeling using XML Schemas”. In Int’l Conf. on Conceptual Modeling (ER), Yokohama, Japan, Nov. 2001. 81, 89Google Scholar
  14. [14]
    M. Murata, D. Lee, and M. Mani. “Taxonomy of XML Schema Languages using Formal Language Theory”. In Extreme Markup Languages, Montreal, Canada, Aug. 2001. 81, 82, 83, 84, 86, 87
  15. [15]
    J. Shanmugasundaram, K. Tufte, G. He, C. Zhang, D. DeWitt, and J. Naughton. “Relational Databases for Querying XML Documents: Limitations and Opportunities”. In VLDB, Edinburgh, Scotland, Sep. 1999. 82, 83, 98Google Scholar
  16. [16]
    M. Takahashi. “Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages”. Information and Control, 27(1):1–36, Jan. 1975. 81CrossRefMathSciNetzbMATHGoogle Scholar
  17. [17]
    H. S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn (Eds). “XML Schema Part 1: Structures”. W3C Recommendation, May 2001. 81

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Murali Mani
    • 1
  • Dongwon Lee
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaLos Angeles Los AngelesUSA

Personalised recommendations