Sciweavers

151 search results - page 9 / 31
» On the Containment Problem for Queries in Conjunctive Form w...
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
AMW
2009
13 years 8 months ago
Checking Containment of Schema Mappings (Preliminary Report)
In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target sc...
Andrea Calì, Riccardo Torlone
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
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