The M-tree is a well-known indexing method enabling efficient similarity search in metric spaces. Although the M-tree is an aging method nowadays, we believe it still offers an undiscovered potential. We present several approaches and directions that show how the original M-tree algorithms and structure can be improved. To allow more efficient query processing by the M-tree, we propose several new methods of (parallel) M-tree construction that achieve more compact M-tree hierarchies and preserve acceptable construction cost. We also demonstrate that the M-tree can be simply extended to a new indexing method - the NM-tree, which allows efficient nonmetric similarity search by use of the TriGen algorithm. All these experimentally verified imp...
© Springer-Verlag Berlin Heidelberg 2002.In this study, parallel implementation of M-tree to index h...
Metric indexing is a branch of search technology that is designed for search non-textual data. Examp...
Artículo de publicación ISIAn important research issue in multimedia databases is the retrieval of ...
The M-tree is a well-known indexing method enabling efficient similarity search in metric spaces. Al...
Title: Tree-based Indexing Methods for Similarity Search in Metric and Nonmetric Spaces Author: Mgr....
Title: Tree-based Indexing Methods for Similarity Search in Metric and Nonmetric Spaces Author: Mgr....
M-tree is a dynamic access method suitable to index generic "metric spaces", where the fun...
In this paper, we propose a new metric index, called M+-tree, which is a tree dynamically organized ...
Large multimedia repositories often call for a highly efficient index supported by external memories...
In this study, parallel implementation of M-tree to index high dimensional metric space has been ela...
Abstract. The M-tree is a dynamic data structure designed to index metric datasets. In this paper we...
Abstract. We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-t...
In this study, parallel implementation of M-tree to index high dimensional metric space has been ela...
The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce...
© Springer-Verlag Berlin Heidelberg 2002.In this study, parallel implementation of M-tree to index h...
© Springer-Verlag Berlin Heidelberg 2002.In this study, parallel implementation of M-tree to index h...
Metric indexing is a branch of search technology that is designed for search non-textual data. Examp...
Artículo de publicación ISIAn important research issue in multimedia databases is the retrieval of ...
The M-tree is a well-known indexing method enabling efficient similarity search in metric spaces. Al...
Title: Tree-based Indexing Methods for Similarity Search in Metric and Nonmetric Spaces Author: Mgr....
Title: Tree-based Indexing Methods for Similarity Search in Metric and Nonmetric Spaces Author: Mgr....
M-tree is a dynamic access method suitable to index generic "metric spaces", where the fun...
In this paper, we propose a new metric index, called M+-tree, which is a tree dynamically organized ...
Large multimedia repositories often call for a highly efficient index supported by external memories...
In this study, parallel implementation of M-tree to index high dimensional metric space has been ela...
Abstract. The M-tree is a dynamic data structure designed to index metric datasets. In this paper we...
Abstract. We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-t...
In this study, parallel implementation of M-tree to index high dimensional metric space has been ela...
The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce...
© Springer-Verlag Berlin Heidelberg 2002.In this study, parallel implementation of M-tree to index h...
© Springer-Verlag Berlin Heidelberg 2002.In this study, parallel implementation of M-tree to index h...
Metric indexing is a branch of search technology that is designed for search non-textual data. Examp...
Artículo de publicación ISIAn important research issue in multimedia databases is the retrieval of ...