Sciweavers

2514 search results - page 12 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
14 years 7 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 7 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
AAAI
2007
13 years 9 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch