Reformulation of XML Queries and Constraints
Source: University of California
The authors state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies (materialized views, indexes and caches) to enhance performance. The correspondence between published and proprietary schemas is specified by views in both directions, and the same algorithm performs rewriting-with-views, composition-with-views, or the combined effect of both, unifying the Global-As-View and Local-As-View approaches to data integration. The authors prove a completeness theorem which guarantees that under certain conditions, the algorithm will find a minimal reformulation if one exists.