Abstract: Similarity search in general metric spaces is a key aspect in many applica-tion fields. Metric space indexing provides a flexible indexing paradigm and is solely based on the use of a distance metric. No assumption is made about the representation of the database objects. Nowadays, ever-increasing data volumes require large-scale distributed retrieval architectures. Here, local and global indexing schemes are distinguished. In the local indexing approach, every resource administers a set of documents and indexes them locally. Resource descriptions providing the basis for resource selection can be dis-seminated to avoid all resources being contacted when answering a query. On the other hand, global indexing schemes are based on a s...
Database applications using large vector data are often supported by spatial index structures to loc...
The performance of similarity search in the unstructured databases largely depends on the employed s...
Abstract. A number of problems in computer science can be solved eciently with the so called memory ...
Similarity search is a very important operation in multimedia databases and other database applicati...
Abstract. In order to speedup retrieval in large collections of data, index structures partition the...
The emergence of complex data objects that must be indexed and queried in databases has created a ne...
In this paper, we focus on indexing and searching in high-dimensional data. To achieve the target we...
In this paper, we focus on indexing and searching in high-dimensional data. To achieve the target we...
Abstract. Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all...
International audienceSimilarity search in metric spaces refers to searching elements in data reposi...
Similarity search in metric spaces refers to searching elements in data repositories that are simila...
The problem of searching the elements of a set which are close to a given query element under some s...
This paper examines the problem of database organization and retrieval based on computing metric pai...
Similarity search has become one of the important parts of many applications including multimedia re...
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range...
Database applications using large vector data are often supported by spatial index structures to loc...
The performance of similarity search in the unstructured databases largely depends on the employed s...
Abstract. A number of problems in computer science can be solved eciently with the so called memory ...
Similarity search is a very important operation in multimedia databases and other database applicati...
Abstract. In order to speedup retrieval in large collections of data, index structures partition the...
The emergence of complex data objects that must be indexed and queried in databases has created a ne...
In this paper, we focus on indexing and searching in high-dimensional data. To achieve the target we...
In this paper, we focus on indexing and searching in high-dimensional data. To achieve the target we...
Abstract. Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all...
International audienceSimilarity search in metric spaces refers to searching elements in data reposi...
Similarity search in metric spaces refers to searching elements in data repositories that are simila...
The problem of searching the elements of a set which are close to a given query element under some s...
This paper examines the problem of database organization and retrieval based on computing metric pai...
Similarity search has become one of the important parts of many applications including multimedia re...
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range...
Database applications using large vector data are often supported by spatial index structures to loc...
The performance of similarity search in the unstructured databases largely depends on the employed s...
Abstract. A number of problems in computer science can be solved eciently with the so called memory ...