Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Nowadays, business process management plays an important role in the management of organizations. More and more organizations… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2009
2009
We propose an incremental technique for discovering duplicates in large databases of textual sequences, i.e., syntactically… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
One of the challenges in the development of a content-based multimedia indexing and retrieval application is to achieve an… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Spatio-temporal, geo-referenced datasets are growing rapidly, and will be more in the near future, due to both technological and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper introduces a practical index for approximate similarity queries of large multi-dimensional data sets: the spatial… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The metric space model abstracts many proximity search problems, from nearest-neighbor classifiers to textual and multimedia… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we present WINDSURF (Wavelet-Based Indexing of Images Using Region Fragmentation), a new approach to content-based… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A new access method, called M-tree, is proposed to organize and search large data sets from a generic “metric space”, i.e. where… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?