Benchmarking Access Structures for High-Dimensional Multimedia Data (1999)
| Venue: | In Proc. IEEE Intl. Conf. on Multimedia and Expo (ICME’2000 |
| Citations: | 3 - 0 self |
BibTeX
@TECHREPORT{Colossi99benchmarkingaccess,
author = {Nathan G. Colossi and Nathan G. Colossi and Mario A. Nascimento and Mario A. Nascimento},
title = {Benchmarking Access Structures for High-Dimensional Multimedia Data},
institution = {In Proc. IEEE Intl. Conf. on Multimedia and Expo (ICME’2000},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In multimedia databases it is usual to map objects into feature vectors in high-dimensional spaces. In order to speed query processing access structures, or indices, are required. Unfortunately, in the case of similarity queries, which are in fact nearest neighbor queries, classical spatial access structures such as the R*-tree are bound to fail when the space dimensional is not low. Fortunately, on the other hand, several access structures for high dimensional spaces, e.g., the SS-tree, SR-tree and M-tree have been proposed. However, each of those structures have been benchmarked in a rather ad-hoc manner. This paper benchmarks and compares all above structures using a real dataset of 40,000 high-dimensional objects. All structures have been implemented on top of the GiST infrastructure to minimize the risk of implementation bias. Even though no structure can be claimed to be the undisputed winner, we have found that the SR-tree presents the best overall results. 1 Introducti...
