The problem of searching the elements of a set that are close to a given query element
under some similarity criterion has a vast number of applications in many branches of …

The area of similarity searching is a very hot topic for both research and c-mercial
applications. Current data processing applications use data with c-siderably less structure …

One of the common queries in many database applications is finding approximate matches
to a given query item from a collection of data items. For example, given an image database …

The combination of different text representations and search strategies has become a
standard technique for improving the effectiveness of information retrieval. combination, for …

In retrieval from image databases, evaluation of similarity, based both on the appearance of
spatial entities and on their mutual relationships, depends on content representation based …

In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a
query object q can be a very expensive task, because of the poor partitioning operated by …

Motivated by the urgent need to improve the efficiency of similarity queries, approximate
similarity retrieval is investigated in the environment of a metric tree index called the M-tree …

In this paper we present WINDSURF (Wavelet-Based Indexing of Images Using Region
Fragmentation), a new approach to content-based image retrieval. The method uses the …

Wu consider tho problem of estimating CPU (distance computntlons) nnd I/O costs for
processing range and k-nearest neighbors qucrics over metric spaces. Unlike the specific …

Novel database applications, such as multimedia, data mining, e-commerce, and many
others, make intensive use of similarity queries in order to retrieve the objects that better fit a …