Sciweavers

55 search results - page 9 / 11
» Processing Distance Join Queries with Constraints
Sort
View
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 6 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 7 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
ISCI
2007
141views more  ISCI 2007»
13 years 6 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
CVPR
2004
IEEE
14 years 9 months ago
Learning Distance Functions for Image Retrieval
Image retrieval critically relies on the distance function used to compare a query image to images in the database. We suggest to learn such distance functions by training binary ...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
VLDB
2009
ACM
182views Database» more  VLDB 2009»
14 years 7 months ago
Guessing the extreme values in a data set: a Bayesian method and its applications
For a largenumber of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smallest)...
Mingxi Wu, Chris Jermaine