Sciweavers

342 search results - page 10 / 69
» Conjunctive Queries over Trees
Sort
View
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
DLOG
2011
12 years 11 months ago
On (In)Tractability of OBDA with OWL 2 QL
We show that, although conjunctive queries over OWL 2 QL ontologies are reducible to database queries, no algorithm can construct such a reduction in polynomial time without changi...
Stanislav Kikot, Roman Kontchakov, Michael Zakhary...
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 9 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 8 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
FQAS
2009
Springer
202views Database» more  FQAS 2009»
14 years 2 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese