511 search results - page 27 / 103 » Approximate Selection Queries over Imprecise Data |
215
click to vote
ALT
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
145
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
160
click to vote
VLDB
2001
ACM
15 years 10 months ago
2001
ACM
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
257
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
242
click to vote
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...