Adaptability in XML-to-relational mapping strategies
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Various models and approaches have been proposedfor mapping XML data into relational tables recently.Most of those approaches produce relational schema forgiven XML data, based on pre-defined rules, heuristics,and user specifications, without considering workload. Asthe result, the schema obtained is often not optimal withrespect to query performance. In this paper, we present acost-driven approach to generate a near-optimalrelational schema for a given XML data and expectedworkload, in the presence of space constraint. Anefficient heuristic algorithm based on Hill Climbing isproposed together with a set of state transformationoperations. Experimental study using the prototypesystem implementing the proposed algorithm, indicatesthat the produced schema can provide betterperformance than those well-known mapping approachespublished in the literature.