2514 search results - page 37 / 503 » On the Computation of Approximations of Database Queries |
398
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
178
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
262
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 ...
179
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...