Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Deriving Relation Keys from XML Keys

Wang, Q., Wu, H., Xiao, J., Zhou, A. and Zhou, J.

    Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much research work on constraints has been being done. In this paper, we consider an important class of constraints, XML keys, and try to find the relationship between XML keys and relation keys. Given XML data whose semantics are represented in XML keys, we use a simple transformation language to express a transformation from the XML data to a relational database. Then we provide a formal definition of a relation tree that represents a well-formed rule on a relation written in the transformation language. After all rules that make up the transformation have been written, we show the way how XML data is transformed into relations. Finally, we present an algorithm for deriving relation keys from XML keys. These keys should be specified on the transformed relations or their compatibility with the predefined schema should be verified.
Cite as: Wang, Q., Wu, H., Xiao, J., Zhou, A. and Zhou, J. (2003). Deriving Relation Keys from XML Keys. In Proc. Fourteenth Australasian Database Conference (ADC2003), Adelaide, Australia. CRPIT, 17. Schewe, K.-D. and Zhou, X., Eds. ACS. 227-235.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007