16 search results - page 3 / 4 » Finding Irredundant Contained Rewritings of Tree Pattern Que... |
PODS
2000
ACM
13 years 9 months ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
WIDM
2003
ACM
13 years 10 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
PKDD
2000
Springer
13 years 9 months ago
2000
Springer
Data mining is a useful decision support technique, which can be used to find trends and regularities in warehouses of corporate data. A serious problem of its practical applicatio...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...