Skip to main content

A Formalism of XML Restructuring Operations

  • Conference paper

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

Abstract

We present a set of primitive restructuring operators that, when combined, are sufficiently powerful to convert an XML document under a source schema into an XML document under an arbitrary target schema. We initially define the operators at the schema level, and then show how each operator induces a corresponding transformation on any XML document under the schema. Finally, we note that our operators can be implemented in a high level language such as XQuery, and thus our approach can be used as the basis for automating the conversion of one XML document to another XML document.

This research was supported by Australian Research Council’s Discovery Project DP0559288.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Colby, L.S.: A recursive algebra for nested relations. Information Systems 15, 567–582 (1990)

    Article  Google Scholar 

  2. Erwig, M.: Toward the automatic derivation of xml transformations. In: Jeusfeld, M.A., Pastor, Ó. (eds.) ER Workshops 2003. LNCS, vol. 2814, pp. 342–354. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Fankhauser, P., Fernndez, M., Malhotra, A., Rys, M., Simon, J., Wadler, P.: The xml query algebra. W3C Working Draft - (2001), http://www.w3.org/TR/2001/WD-query-algebra-20010215

  4. Fernandez, M., Simeon, J.: Growing xquery. In: Cardelli, L. (ed.) ECOOP 2003. LNCS, vol. 2743, pp. 405–430. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Jagadish, H.V., Lakshmanan, L.V.S., Srivastava, D., Thompson, K.: Tax: A tree algebra for xml. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, p. 149. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Liu, J., Park, H.-h., Vincent, M., Liu, C.: A formalism of xml restrucuring operations (2006), http://www.cis.unisa.edu.au/~cisjl/publications/restruwith-append.pdf

  7. Sartiani, C., Albano, A.: Yet another query algebra for xml data. In: IDEAS, pp. 106–115.

    Google Scholar 

  8. Su, H., Kuno, H., Rudensteiner, E.A.: Automating the transformation of xml documents. In: WIDM, p. 6875 (2001)

    Google Scholar 

  9. Zamboulis, L.: Xml data integration by graph restructuring. In: BNCOD, pp. 57–71 (2004)

    Google Scholar 

  10. Zamboulis, L., Poulovassilis, A.: Using automed for xml data transformation and integration. In: Third International Workshop on Data Integration over the Web (DIWeb), Latvia (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, J., Park, HH., Vincent, M., Liu, C. (2006). A Formalism of XML Restructuring Operations. In: Mizoguchi, R., Shi, Z., Giunchiglia, F. (eds) The Semantic Web – ASWC 2006. ASWC 2006. Lecture Notes in Computer Science, vol 4185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11836025_13

Download citation

  • DOI: https://doi.org/10.1007/11836025_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38329-1

  • Online ISBN: 978-3-540-38331-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics