Sciweavers

360 search results - page 8 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
JEA
2008
112views more  JEA 2008»
13 years 8 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
EDBT
2008
ACM
103views Database» more  EDBT 2008»
14 years 8 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
ICIP
2010
IEEE
13 years 6 months ago
Dynamic selection of a feature-rich query frame for mobile video retrieval
In this paper, we focus on a new application of mobile visual search: snapping a photo with a mobile device of a video playing on a TV screen to automatically retrieve and stream ...
David M. Chen, Ngai-Man Cheung, Sam S. Tsai, Vijay...
VLDB
2005
ACM
149views Database» more  VLDB 2005»
14 years 8 months ago
Selectivity estimators for multidimensional range queries over real attributes
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...
Dimitrios Gunopulos, George Kollios, Vassilis J. T...
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 8 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch