Add to ORKGHybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures are hybrid schemes, with the full features of dynamic spatial approximation trees and able of using the available memory to improve the query time. It has been shown that they compare favorably against alternative data structures in spaces of medium difficulty. In this paper we complete and improve hybrid dynamic spatial approximation trees, by presenting a new search alternative, an algorithm to remove objects from the tree, and an improved way of managing the available memory. The result is a fully dynamic and optimized d...
We propose a new data structure to search in metric spaces. A metric space is formed by a collectio...
Similarity search is a fundamental operation for applications that deal with unstructured data sourc...
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searchin...
Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in me...
Metric space searching is an emerging technique to address the problem of similarity searching in ma...
Metric space searching is an emerging technique to address the problem of e cient similarity searchi...
The Dynamic Spatial Approximation Tree (DSAT) is a data structure specially designed for searching i...
Abstract. The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searchi...
Many computational applications need to look for information in a database. Nowadays, the predominan...
This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searchin...
Querying large datasets by proximity, using a distance under the metric space model, has a large num...
Many computational applications need to look for informa-tion in a database. Nowadays, the predomina...
The concept of “approximate” searching has applications in a vast number of fields. Some examples ar...
We propose a new data structure to search in metric spaces. A metric space is formed by a collection...
The Dynamic Spatial Approximation Tree (dsa--tree) is a recently proposed data structure for searchi...
We propose a new data structure to search in metric spaces. A metric space is formed by a collectio...
Similarity search is a fundamental operation for applications that deal with unstructured data sourc...
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searchin...
Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in me...
Metric space searching is an emerging technique to address the problem of similarity searching in ma...
Metric space searching is an emerging technique to address the problem of e cient similarity searchi...
The Dynamic Spatial Approximation Tree (DSAT) is a data structure specially designed for searching i...
Abstract. The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searchi...
Many computational applications need to look for information in a database. Nowadays, the predominan...
This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searchin...
Querying large datasets by proximity, using a distance under the metric space model, has a large num...
Many computational applications need to look for informa-tion in a database. Nowadays, the predomina...
The concept of “approximate” searching has applications in a vast number of fields. Some examples ar...
We propose a new data structure to search in metric spaces. A metric space is formed by a collection...
The Dynamic Spatial Approximation Tree (dsa--tree) is a recently proposed data structure for searchi...
We propose a new data structure to search in metric spaces. A metric space is formed by a collectio...
Similarity search is a fundamental operation for applications that deal with unstructured data sourc...
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searchin...