Abstract
In this study we address the problem of answering queries over information sources storing objects which are indexed by terms ar ranged in a taxonomy. We examine query languages of di®erent expres sivity and sources with di®erent 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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the third International Conference on Ontologies, Databases and Applications of Semantics for Large Scale Information Systems, ODBASE'2004 |
| Pages | 945-962 |
| Number of pages | 18 |
| Volume | 3291 |
| Publication status | Published - 2004 |