Sciweavers

Share
199 search results - page 1 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
PVLDB
2008
100views more  PVLDB 2008»
9 years 10 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
PVLDB
2008
122views more  PVLDB 2008»
9 years 10 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
JGTOOLS
2006
199views more  JGTOOLS 2006»
9 years 10 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
FUIN
2006
139views more  FUIN 2006»
9 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
VLDB
2005
ACM
139views Database» more  VLDB 2005»
10 years 4 months ago
Analyzing Plan Diagrams of Database Query Optimizers
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
Naveen Reddy, Jayant R. Haritsa
books