Querying Articulated Sources

Yannis Tzitzikas; Carlo Meghini

Querying Articulated Sources

Yannis Tzitzikas, Carlo Meghini

Faculte d'informatique

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférence › Article dans les actes d'une conférence/un colloque

18 Téléchargements (Pure)

Résumé

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.

langue originale	Anglais
titre	Proceedings of the third International Conference on Ontologies, Databases and Applications of Semantics for Large Scale Information Systems, ODBASE'2004
Pages	945-962
Nombre de pages	18
Volume	3291
Etat de la publication	Publié - 2004

Accès au document

ODBASE 2004 P2P

Contient cette citation

@inproceedings{528d0f8aa0724b4fa107902cf907b32e,

title = "Querying Articulated Sources",

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{\textregistered}erent expres sivity and sources with di{\textregistered}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.",

author = "Yannis Tzitzikas and Carlo Meghini",

year = "2004",

language = "English",

volume = "3291",

pages = "945--962",

booktitle = "Proceedings of the third International Conference on Ontologies, Databases and Applications of Semantics for Large Scale Information Systems, ODBASE'2004",

}

Querying Articulated Sources. / Tzitzikas, Yannis; Meghini, Carlo.
Proceedings of the third International Conference on Ontologies, Databases and Applications of Semantics for Large Scale Information Systems, ODBASE'2004. Vol 3291 2004. p. 945-962.

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférence › Article dans les actes d'une conférence/un colloque

TY - GEN

T1 - Querying Articulated Sources

AU - Tzitzikas, Yannis

AU - Meghini, Carlo

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

M3 - Conference contribution

VL - 3291

SP - 945

EP - 962

BT - Proceedings of the third International Conference on Ontologies, Databases and Applications of Semantics for Large Scale Information Systems, ODBASE'2004

ER -

Querying Articulated Sources

Résumé

Accès au document

Empreinte digitale

Contient cette citation