197 search results - page 13 / 40 » Efficiently approximating query optimizer plan diagrams |
ICDE
2006
IEEE
14 years 8 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...
SIGMOD
2009
ACM
14 years 7 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...
ICDCS
2008
IEEE
14 years 1 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...
ICDE
2003
IEEE
14 years 8 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, ...
ICDE
2006
IEEE
14 years 8 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...