Add to ORKGWe propose a novel index structure, the A-tree (Approximation tree), for the similarity search of high-dimensional data. The basic idea of the A-tree is the introduction of Virtual Bounding Rectangles (VBRs) which contain and approximate MBRs or data objects. VBRs can be represented rather compactly, and thus affect the tree configuration both quantitatively and qualitatively. First, since tree nodes can contain a large number of VBR entries, fanout becomes large, which leads to fast search. More importantly, we have a free hand in arranging MBRs and VBRs in tree nodes. In the A-trees, a node contains an MBR and its children VBRs. Therefore, by fetching a node of an A-tree, we can obtain the information of the exact position of a parent MBR...
The nearest- or near-neighbor query problems arise in a large variety of database applications, usua...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
During the last decade, multimedia databases have become increasingly important in many application ...
Recently, similarity queries on feature vectors have been widely used to perform content-based retri...
We propose a file structure to index high-dimensionality data, typically, points in some feature spa...
Recently, similarity queries on feature vectors have been widely used to perform content-based retri...
In this paper, we propose a novel high-dimensional index method, the BM+-tree, to support efficient ...
Title: Tree-based Indexing Methods for Similarity Search in Metric and Nonmetric Spaces Author: Mgr....
In this work a novel hierarchical data structure for high dimensional data indexing is proposed. MKL...
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due...
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search o...
A selection query applied to a database often has the selection predicate imperfectly specified. We ...
Many computational applications need to look for informa-tion in a database. Nowadays, the predomina...
In this thesis, we study high dimensional approximate similarity search algorithms. High dimensional...
Similarity search in multimedia databases requires an effi-cient support of nearest-neighbor search ...
The nearest- or near-neighbor query problems arise in a large variety of database applications, usua...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
During the last decade, multimedia databases have become increasingly important in many application ...
Recently, similarity queries on feature vectors have been widely used to perform content-based retri...
We propose a file structure to index high-dimensionality data, typically, points in some feature spa...
Recently, similarity queries on feature vectors have been widely used to perform content-based retri...
In this paper, we propose a novel high-dimensional index method, the BM+-tree, to support efficient ...
Title: Tree-based Indexing Methods for Similarity Search in Metric and Nonmetric Spaces Author: Mgr....
In this work a novel hierarchical data structure for high dimensional data indexing is proposed. MKL...
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due...
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search o...
A selection query applied to a database often has the selection predicate imperfectly specified. We ...
Many computational applications need to look for informa-tion in a database. Nowadays, the predomina...
In this thesis, we study high dimensional approximate similarity search algorithms. High dimensional...
Similarity search in multimedia databases requires an effi-cient support of nearest-neighbor search ...
The nearest- or near-neighbor query problems arise in a large variety of database applications, usua...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
During the last decade, multimedia databases have become increasingly important in many application ...