A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Query rewriting for semistructured data
1999
SIGMOD record
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set of semistructured views V, nds rewriting queries, i.e., queries that access the views and produce the same result as q. Our algorithm is based on appropriately generalizing containment mappings, the chase, and uni cation techniques that were developed for structured, relational data. We also develop an algorithm for
doi:10.1145/304181.304222
fatcat:gfvtf3nbgjcyvdhcaotkjv4qpi