MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  1

Download:
Download as a PDF | Download as a PS
by P. Ciaccia, M. Patella, F. Rabitti, P. Zezula
ftp://ftp-db.deis.unibo.it/pub/paolo/SEBD97/SEBD97.ps.gz
Add To MetaCart

Abstract:

Abstract. M-tree is a dynamic access method suitable to index generic "metric spaces", where the function used to compute the distance between any two objects satisfies the positivity, symmetry, and triangle inequality postulates. The M-tree design fulfills typical requirements of multimedia applications, where objects are indexed using complex features, and similarity queries can require application of time-consuming distance functions. In this paper we describe the basic search and management algorithms of M-tree, introduce several heuristic split policies, and experimentally evaluate them, considering both I/O and CPU costs. Results also show that M-tree performs better than R

Citations

1651 R-trees: A dynamic index structure for spatial searching – Guttman - 1984
1357 R.C.: Algorithms for clustering data – Jain, Dubes - 1988
452 The R ∗ -tree: An Efficient and Robust Access Method for Points and Rectangles – Beckmann, Kriegel, et al. - 1990
416 ªThe X-Tree: An Index Structure for High-Dimensional Data,º – Berchtold, Keim, et al. - 1996
347 Nearest Neighbor Queries – Roussopoulos, Kelley, et al. - 1995
311 Efcient similarity search in sequence databases – Agrawal, Faloutsos, et al. - 1993
309 et al., Fast subsequence matching in timeseries databases – Faloutsos - 1994
305 Comparing images using the Hausdorff distance – Huttenlocher, Klanderman, et al. - 1993
192 R+-tree: A dynamic index for multi-dimensional objects – Sellis, Roussopoulos, et al. - 1987
184 A:Pfeffer, Generalized Search Trees for Database Systems – Hellerstein - 1995
152 Contentbased classification, search and retrieval of audio – Wold, Blum, et al. - 1996
120 neighbor search in large metric spaces – Brin, Near - 1995
109 Satisfying general proximity/similarity queries with metric trees – Uhlmann - 1991
88 Distance-based indexing for high-dimensional metric spaces – Bozkaya, Ozsoyoglu - 1997
85 Content-based image retrieval systems – Gudivada, Raghavan - 1995
70 Content-based image indexing – Chiueh - 1994
25 The rd-tree: An index structure for sets – Hellerstein, Pfeffer - 1994
7 Dynamic inverted quadtrees - a structure for pictorial databases – Vassilakopoulos, Manolopoulos - 1995
5 Mtree: A dynamic index for similarity queries in multimedia databases – Zezula, Ciaccia, et al. - 1996
4 Performance of Mtree, an access method for similarity search in metric spaces – Ciaccia, Patella, et al. - 1997