Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
B-treeBall treeBounding volume hierarchyEnvironment for DeveLoping KDD-Applications Supported by Index-Structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Hierarchical Cellular Tree: An Efficient Indexing Scheme for Content-Based Retrieval on Multimedia Databases
One of the challenges in the development of a content-based multimedia indexing and retrieval application is to achieve an… 
2007
2007
CM-tree: A dynamic clustered index for similarity search in metric databases
2006
2006
Visual Mapping of Text Collections through a Fast High Precision Projection Technique
This paper introduces least square projection (LSP), a fast technique for projection of multi-dimensional data onto lower… 
Highly Cited
2005
Highly Cited
2005
Fast approximate similarity search in extremely high-dimensional data sets
This paper introduces a practical index for approximate similarity queries of large multi-dimensional data sets: the spatial… 
Highly Cited
2003
Highly Cited
2003
D-Index: Distance Searching Index for Metric Data Sets
In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query… 
2003
2003
Cell Histograms Versus Color Histograms for Image Representation and Retrieval
Abstract.This paper presents a new approach for content-based image retrieval, which is based on the well-known and widely used… 
2003
2003
Revisiting M-Tree Building Principles
The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce two dynamic techniques of… 
2002
2002
Image indexing and retrieval using signature trees
Highly Cited
1999
Highly Cited
1999
Windsurf: region-based image retrieval using wavelets
In this paper we present WINDSURF (Wavelet-Based Indexing of Images Using Region Fragmentation), a new approach to content-based… 
Highly Cited
1997
Highly Cited
1997
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)