Meghini C, Tzitzikas Y
Information Systems
In this study we address the problem of answering queries over information sources storing objects which are indexed by terms arranged in a taxonomy. We examine query languages of different expressivity and sources with different kinds of taxonomies. In the simplest kind, the taxonomy includes just term-to-term subsumption links. This case is used as a basis for further developments, in which we consider taxonomies consisting of term-to-queries links. An algorithm for query evaluation is presented for this kind of taxonomies, and it is shown that the addition of negation to the query language leads to intractability. Finally, query-to-query taxonomies are considered.
Publisher: Springer-Verlag
@inproceedings{oai:it.cnr:prodotti:43771, title = {Querying articulated sources}, author = {Meghini C and Tzitzikas Y}, publisher = {Springer-Verlag}, year = {2004} }