Recent work on semi-structured data has revitalized the interest in path queries, i.e., queries that ask for all pairs of objects in the database that are connected by a path conforming to a certain specification, in particular to a regular expression. Also, in semi-structured data, as well as in da
Expressive capabilities description languages and query rewriting algorithms
โ Scribed by Vasilis Vassalos; Yannis Papakonstantinou
- Book ID
- 104344550
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 673 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0743-1066
No coin nor oath required. For personal study only.
โฆ Synopsis
Information integration systems have to cope with a wide variety of dierent information sources, which support query interfaces with very varied capabilities. To deal with this problem, the integration systems need descriptions of the query capabilities of each source, i.e., the set of queries supported by each source. Moreover, the integration systems need algorithms for deciding how a query can be answered given the capabilities of the sources. Finally, they need to translate a query into the format that the source understands. We present two languages suitable for descriptions of query capabilities of sources and compare their expressive power. We also use one of the languages to automatically derive the capabilities description of the integration system itself, in terms of the capabilities of the sources it integrates. We describe algorithms for deciding whether a query ``matches'' the description and show their application to the problem of translating user queries into source-speciยฎc queries and commands. We propose new, improved algorithms for the problem of answering queries using these descriptions. Finally, we identify an interesting class of source capability descriptions, for which our algorithms are much more ecient.
๐ SIMILAR VOLUMES