Query Decomposition and View Maintenance for Query Languages for Unstructured Data (1996)
Cached
Download Links
- [ftp.informatik.uni-trier.de]
- [www.research.att.com]
- [www.vldb.org]
- [www.acm.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of VLDB |
| Citations: | 28 - 1 self |
BibTeX
@INPROCEEDINGS{Suciu96querydecomposition,
author = {Dan Suciu},
title = {Query Decomposition and View Maintenance for Query Languages for Unstructured Data},
booktitle = {In Proceedings of VLDB},
year = {1996},
pages = {227--238}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recently, several query languages have been proposed for querying information sources whose data is not constrained by a schema, or whose schema is unknown. Examples include: LOREL (for querying data combined from several heterogeneous sources), W3QS (for querying the World Wide Web); and UnQL (for querying unstructured data). The natural data model for such languages is that of a rooted, labeled graph. Their main novelty is the ability to express queries which traverse arbitrarily long paths in the graph, typically described by a regular expression. Such queries however may prove difficult to evaluate in the case when the data is distributed on several sites, with many edges going between sites. A typical case is that of a collection of WWW sites, with links pointing freely from one site to another (even forming cycles). A naive query shipping strategy may force the query to migrate back and forth between the various sites, leading to poor performance (or even non-termination). We pre...
