Sciweavers

574 search results - page 55 / 115
» Distributed Queries and Query Optimization in Schema-Based P...
Sort
View
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 10 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
FOCS
2000
IEEE
14 years 1 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
VLDB
1999
ACM
140views Database» more  VLDB 1999»
14 years 1 months ago
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
Arnd Christian König, Gerhard Weikum
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
14 years 1 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 10 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount