419 search results - page 55 / 84 » Improving Adaptable Similarity Query Processing by Using App... |
CIKM
2003
Springer
15 years 3 months ago
2003
Springer
Searchers can have problems devising queries that accurately express their, often dynamic, information needs. In this paper we describe an adaptive approach that uses unobtrusive ...
ADBIS
2006
Springer
15 years 4 months ago
2006
Springer
Database caching supports declarative query processing close to the application. Using a full-fledged DBMS as cache manager, it enables the evaluation of specific project-select-...
PAMI
2008
14 years 10 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
181
click to vote
SADM
2010
14 years 4 months ago
2010
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
EDBT
2010
ACM
15 years 3 months ago
2010
ACM
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution plan for a given query. Since the physical IO (PIO) is a costly operation to...