Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,941,468 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
B-tree
Ball tree
Bounding volume hierarchy
Environment for DeveLoping KDD-Applications Supported by Index-Structures
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Unsupervised classification of uncertain data objects in spatial databases using computational geometry and indexing techniques
Ramachandra Rao Kurada
arXiv.org
2013
Corpus ID: 17513737
Unsupervised classification called clustering is a process of organizing objects into groups whose members are similar in some…
Expand
2013
2013
Indexing Metric Spaces with Nested Forests of Topological Balls and Hyperplanes
José Martinez
,
Zineddine Kouahla
2013
Corpus ID: 6687800
Searching in a dataset for objects that are similar, with respect to a distance, to a given query object is a fundamental problem…
Expand
2010
2010
Symmetric M-tree
A. Sexton
,
R. Swinbank
arXiv.org
2010
Corpus ID: 6226604
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To…
Expand
2009
2009
A Kinematic Approach to Answering Similarity Queries on Complex Human Motion Data
Hyuck Han
,
Shin-gyu Kim
,
Hyungsoo Jung
,
H. Yeom
2009
Corpus ID: 55724523
Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion…
Expand
2008
2008
Combining metric features in large collections
Michal Batko
,
Petra Budíková
,
P. Zezula
IEEE 24th International Conference on Data…
2008
Corpus ID: 6690578
Current information systems are required to process complex digital objects, which are typically characterized by multiple…
Expand
2008
2008
On M-tree Variants in Metric and Non-metric Spaces
Jakub Lokoč
2008
Corpus ID: 10257589
index. Another approach how to improve similarity searching has been introduced with the TriGen algorithm [Skopal, 2006] which…
Expand
2007
2007
Speeding up Queries in a Leaf Image Database
Daozheng Chen
2007
Corpus ID: 5622581
We have an Electronic Field Guide which contains an image database with thousands of leaf images. We have a system which can take…
Expand
2007
2007
Efficient reverse k-nearest neighbor estimation
Elke Achtert
,
C. Böhm
,
Peer Kröger
,
Peter Kunath
,
A. Pryakhin
,
M. Renz
Informatik - Forschung und Entwicklung
2007
Corpus ID: 1080770
AbstractThe reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which…
Expand
2007
2007
Bulk-loading Dynamic Metric Access Methods
T. G. Vespa
,
C. Traina
,
A. Traina
Brazilian Symposium on Databases
2007
Corpus ID: 11478885
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering…
Expand
2004
2004
An extendible semantic-based content representation method for distributed image databases
Bo Yang
,
A. Hurson
IEEE Sixth International Symposium on Multimedia…
2004
Corpus ID: 14565895
This paper introduces a scheme for semantic-based image content representation in a distributed heterogeneous database…
Expand