Results 1  10
of
368
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 663 (38 self)
 Add to MetaCart
A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion
A Cost Model for Similarity Queries in Metric Spaces
, 1998
"... Wu consider tho problem of estimating CPU (distance computntlons) nnd I/O costs for processing range and knearest neighbors qucrics over metric spaces. Unlike the specific case of vector spaces, where information on data distribution has been exploited to derive cost models for predicting the per ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
model for the Mtree access method [lo]. Our results rely on the assumption that the indexed dataset comes from a metric space which is “homogeneous ” enough (in a probabilistic sense) to allow reliable cost estimations even if the distance distribution with respect to a specific query object is unknown
Indexing Metric Spaces with Mtree
 PROC. QUINTO CONVEGNO NAZIONALE SEBD
, 1997
"... Mtree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, symmetry, and triangle inequality postulates. The Mtree design fulfills typical requirements of multimedia applications, wh ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Mtree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, symmetry, and triangle inequality postulates. The Mtree design fulfills typical requirements of multimedia applications
Indexing Metric Spaces with Mtree
, 1997
"... Mtree is a dynamic access method suitable to index generic "metric spaces", where the function used to compute the distance between any two objects satisfies the positivity, symmetry, and triangle inequality postulates. The Mtree design fulfills typical requirements of multimedia applica ..."
Abstract
 Add to MetaCart
Mtree is a dynamic access method suitable to index generic "metric spaces", where the function used to compute the distance between any two objects satisfies the positivity, symmetry, and triangle inequality postulates. The Mtree design fulfills typical requirements of multimedia
Pivoting Mtree: A Metric Access Method for Efficient Similarity Search
, 2004
"... In this paper pivoting Mtree (PMtree) is introduced, a metric access method combining Mtree with the pivotbased approach. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper pivoting Mtree (PMtree) is introduced, a metric access method combining Mtree with the pivotbased approach.
Bulk loading the Mtree to enhance query performance
 In Proceedings of the 21st British National Conference on Databases, volume 3112 of Lecture Notes in Computer Science
, 2004
"... Abstract. The Mtree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the Mtree’s performance is largely dependent on the degree of overlap between spatial regions represented by nodes in the tree, and ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. The Mtree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the Mtree’s performance is largely dependent on the degree of overlap between spatial regions represented by nodes in the tree
Parallel Dynamic Batch Loading in the Mtree
"... Abstract—Although metric access methods (MAMs) proved their capabilities when performing efficient similarity search, their further performance improvement is needed due to extreme growth of data volumes. Since multi core processors become widely available, it is justified to exploit parallelism. Ho ..."
Abstract
 Add to MetaCart
. However, taking into account the Gustafson’s law [1], it is necessary to find tasks suitable for parallelization. Such a task could be Mtree construction. Unfortunately, parallelism during an object insertion in hierarchical index structures is limited by a node capacity. It is much less restrictive
New Dynamic Construction Techniques for Mtree
"... Since its introduction in 1997, the Mtree became a respected metric access method (MAM), while remaining, together with its descendants, still the only databasefriendly MAM, that is, a dynamic structure persisted in paged index. Although there have been many other MAMs developed over the last deca ..."
Abstract
 Add to MetaCart
Since its introduction in 1997, the Mtree became a respected metric access method (MAM), while remaining, together with its descendants, still the only databasefriendly MAM, that is, a dynamic structure persisted in paged index. Although there have been many other MAMs developed over the last
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access method, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a distance function satisfying the positivity, symmetry, and triangle inequality postulates. We detail algorithms for i ..."
Abstract
 Add to MetaCart
A new access method, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a distance function satisfying the positivity, symmetry, and triangle inequality postulates. We detail algorithms
ISBN 9788073780654 © MATFYZPRESS On Mtree Variants in Metric and Nonmetric Spaces
"... Abstract. Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is Mtree which meets the essential features important for large, persistent a ..."
Abstract
 Add to MetaCart
Abstract. Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is Mtree which meets the essential features important for large, persistent
Results 1  10
of
368