|
|
|
     |
                                     |
Return to Optimization
In this paper we consider general path constraints for semi- structured databases. Our general constraints do not suffer from the limitations of the path constraints previously studied in the literature. We investigate the containment of regular path queries under general path constraints. We show that when the path constraints and queries are expressed by words, as opposed to languages, the containment problem becomes equivalent to the word rewrite problem for a corresponding semi-Thue system. Consequently, if the corresponding semi-Thue system has an undecidable word problem, the word query containment problem will be undecidable too. Also, we show that there are word constraints, where the corresponding semi-Thue system has a decidable word rewrite problem, but the general query containment under these word constraints is undecidable. In order to overcome this, we exhibit a large, practical class of word constraints with a decidable general query containment problem. Based on the query containment under constraints, we reason about constrained rewritings - using views - of regular path queries. We give a constructive characterization for computing optimal constrained rewritings using views.
@inproceedings {DBLP:conf/pods/GrahneT03, author = {Gösta Grahne and Alex Thomo}, booktitle = {PODS}, title = {Query containment and rewriting using views for regular path queries under constraints.}, pages = {111-122}, year = {2003}, url = {db/conf/pods/pods2003.html#GrahneT03}, ee = {http://doi.acm.org/10.1145/773153.773165}, crossref = {conf/pods/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
