6004 search results - page 559 / 1201 » Parallelizing query optimization |
180
click to vote
COMPGEOM
2006
ACM
16 years 16 days ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
155
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
When query optimizers erroneously assume that database columns are statistically independent, they can underestimate the selectivities of conjunctive predicates by orders of magni...
173
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
206
click to vote
BNCOD
2007
15 years 8 months ago
2007
Order is essential for XML query processing. Efficient XML processing with order consideration over relational storage is non-trivial, especially for complex nested XQuery expressi...
192
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Histograms have been widely used for fast estimation of query result sizes in query optimization. In this paper, we propose a new histogram method, called the Skew-Tolerant Histog...