Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
M-tree
Description:
A balanced tree data structure used as a metric access method for indexing objects and supporting similarity searches.
Primary topic:
Data Management and Algorithms (53%)
Related topics:
Data Management and Algorithms (53%),
Image Retrieval and Classification Techniques (9%)
Wikidata ID:
wiki/Q3841143
OpenAlex ID:
keywords/m-tree
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
1997
·
Paolo Ciaccia
, Marco Patella
, et al.
·
Very Large Data Bases
·
1,844
Indexing large metric spaces for similarity search queries
1999
·
Tolga Bozkaya
, Meral Ozsoyoglu
·
ACM Transactions on Database Systems
·
296
PDF
A cost model for similarity queries in metric spaces
1998
·
Paolo Ciaccia
, Marco Patella
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
200
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
2000
·
Ada Wai-chee Fu
, Polly Mei-shuen Chan
, et al.
·
The VLDB Journal
·
169
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
2006
·
H.V. Jagadish
, Beng Chin Ooi
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
165
Approximate similarity retrieval with M-trees
1998
·
Pavel Zezula
, Pasquale Savino
, et al.
·
The VLDB Journal
·
116
DisC diversity: result diversification based on dissimilarity and coverage
2012
·
Marina Drosou
, Evaggelia Pitoura
·
Proceedings of the VLDB Endowment
·
114
PDF
Searching for similar trajectories in spatial networks
2008
·
E. Tiakas
, A.N. Papadopoulos
, et al.
·
Journal of Systems and Software
·
84
Unified framework for fast exact and approximate search in dissimilarity spaces
2007
·
Tomáš Skopal
·
ACM Transactions on Database Systems
·
83
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
1986
·
A Iqbal Ali
, Jeff L Kennington
·
Discrete Applied Mathematics
·
77
PM-tree: Pivoting Metric Tree for Similarity Search in Multimedia Databases.
2004
·
Tomáš Skopal
, Jaroslav Pokorný
, et al.
·
76
3D models retrieval by using characteristic views
2003
·
S. Mahmoudi
, M. Daoudi
·
75
Indexing Metric Spaces with M-Tree.
1997
·
Paolo Ciaccia
, Marco Patella
, et al.
·
SEBD
·
74
Bulk Loading the M-tree
·
Paolo Ciaccia
, Marco Patella
·
72
Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces
2005
·
D. Cantone
, A. Ferro
, et al.
·
IEEE Transactions on Knowledge and Data Engineering
·
66
Reverse k-nearest neighbor search in dynamic and general metric databases
2009
·
Elke Achtert
, Hans-Peter Kriegel
, et al.
·
International Conference on Extending Database Technology (EDBT)
·
63
PDF
Enabling Fast Lazy Learning for Data Streams
2011
·
Peng Zhang
, Byron J. Gao
, et al.
·
Proceedings
·
61
M + -tree: a new dynamical multidimensional index for metric spaces
2003
·
Xiangmin Zhou
, Guoren Wang
, et al.
·
Australasian Database Conference
·
61
Global control for partial deduction through characteristic atoms and global trees
1996
·
Michael Leuschel
, Bern Martens
·
Lecture notes in computer science
·
61
Nearest Neighbours Search Using the PM-Tree
2005
·
Tomáš Skopal
, Jaroslav Pokorný
, et al.
·
Lecture notes in computer science
·
58
A Triangle Inequality for Cosine Similarity
2021
·
Erich Schubert
·
Lecture notes in computer science
·
57
PDF
String Matching with Metric Trees Using an Approximate Distance
2002
·
Ilaria Bartolini
, Paolo Ciaccia
, et al.
·
Lecture notes in computer science
·
57
Processing complex similarity queries with distance-based access methods
1998
·
Paolo Ciaccia
, Marco Patella
, et al.
·
Lecture notes in computer science
·
54
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search.
2004
·
Tomáš Skopal
·
DATESO
·
49
Dynamic similarity search in multi-metric spaces
2006
·
Benjamin Bustos
, Tomáš Skopal
·
Multimedia Information Retrieval
·
44
Show more works
View as search
Works count:
298
Citation count:
5,670
Year
Topic
Type