Sciweavers

651 search results - page 63 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
MOBIDE
2010
ACM
13 years 9 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
COMPGEOM
2006
ACM
14 years 3 months ago
The predicates for the Voronoi diagram of ellipses
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...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 3 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
ICDE
2006
IEEE
134views Database» more  ICDE 2006»
14 years 10 months ago
ISOMER: Consistent Histogram Construction Using Query Feedback
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...
Utkarsh Srivastava, Peter J. Haas, Volker Markl, M...
DKE
2006
123views more  DKE 2006»
13 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...