M-tree

M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle inequality for… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Since its introduction in 1997, the M-tree became a respected metric access method (MAM), while remaining, together with its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2003
2003
The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce two dynamic techniques of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
ÐMany recent database applications must deal with similarity queries. For such applications, it is important to measure the… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The M-tree is a dynamic paged structure that can be effectively used to index multimedia databases, where objects are represented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract. For some multimedia applications, it has been found that domain objects cannot be represented as feature vectors in a… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 7
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Motivated by the urgent need to improve the efficiency of similarity queries, approximate similarity retrieval is investigated in… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A new access method called M tree is pro posed to organize and search large data sets from a generic metric space i e where ob… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1997
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?