| Dealing with (un)structuredness in XML Data and Queries Using Relational Databases (2008) | |||||||||||||||
Abstract | |||||||||||||||
| An XML database can contain documents with varying degrees of schema information. The queries can also range from fully specified structured SQL like queries to partially specified regular path expression queries. Relational databases are widely used to store and query XML data and various schemes have been proposed to this end. They either use DTDs or assume schemaless data. We show how more advanced schema information (like XMLSchema), even if partially available, can be used effectively to answer queries. We also show how the interaction between the amount of schema information available and the query workload plays an important role in choosing a decomposition strategy into relational tables, suited to that workload. We propose a simple cost metric for this purpose. Our experiments indicate that this metric can provide a reasonable choice among the different alternatives. We also show that using the schema at query time, irrespective of the decomposition strategy, can benefit considerably in improving query response times. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||