619 search results - page 32 / 124 » Query Planning in Infomaster |
106
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
VLDB
1995
ACM
15 years 5 months ago
1995
ACM
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
211
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
219
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
110
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused...