Stanford InfoLab Publication Server

Query rewriting for semistructured data (extended version)

Papakonstantinou, Y. and Vassalos, V. (1998) Query rewriting for semistructured data (extended version). Technical Report. Stanford.

WarningThere is a more recent version of this item available.



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 ${\cal V}$, finds 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 query composition -- techniques that were developed for structured, relational data. We also develop an algorithm for equivalence checking of TSL queries. We show that the algorithm is sound and complete for TSL, i.e., it always finds every non-trivial TSL rewriting query of $q$, and we discuss its complexity. We extend the rewriting algorithm to use some forms of structural constraints (such as DTDs) and find more opportunities for query rewriting

Item Type:Techreport (Technical Report)
Uncontrolled Keywords:information integration, semistructured data, heterogeneneous databases, query rewriting,views
Subjects:Computer Science > Semistructured Data
Related URLs:Project Homepage
ID Code:302
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:29 Dec 2008 11:30

Available Versions of this Item

Download statistics

Repository Staff Only: item control page