197 search results - page 13 / 40 » Efficiently approximating query optimizer plan diagrams |
170
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
160
Voted
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
89
Voted
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
165
Voted
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
157
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...