Sciweavers

121 search results - page 11 / 25
» On Containment of Conjunctive Queries with Negation
Sort
View
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 8 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
RR
2010
Springer
13 years 6 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
ICDE
1997
IEEE
127views Database» more  ICDE 1997»
14 years 9 months ago
A Generic Query-Translation Framework for a Mediator Architecture
A mediator is a domain-speci c tool to support uniform access to multiple heterogeneous information sources and to abstract and combine data from different but related databases t...
Jacques Calmet, Sebastian Jekutsch, Joachim Sch&uu...
ICASSP
2011
IEEE
12 years 11 months ago
Handling verbose queries for spoken document retrieval
1 Query-by-example information retrieval provides users a flexible but efficient way to accurately describe their information needs. The query exemplars are usually long and in th...
Shih-Hsiang Lin, Ea-Ee Jan, Berlin Chen