Issue No. 05 - May (2012 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.19
Benjamin Bustos , University of Chile, Santiago
Jakub Lokoč , Charles University, Prague
Tomáš Skopal , Charles University, Prague
The caching of accessed disk pages has been successfully used for decades in database technology, resulting in effective amortization of I/O operations needed within a stream of query or update requests. However, in modern complex databases, like multimedia databases, the I/O cost becomes a minor performance factor. In particular, metric access methods (MAMs), used for similarity search in complex unstructured data, have been designed to minimize rather the number of distance computations than I/O cost (when indexing or querying). Inspired by I/O caching in traditional databases, in this paper we introduce the idea of distance caching for usage with MAMs—a novel approach to streamline similarity search. As a result, we present the D-cache, a main-memory data structure which can be easily implemented into any MAM, in order to spare the distance computations spent by queries/updates. In particular, we have modified two state-of-the-art MAMs to make use of D-cache—the M-tree and Pivot tables. Moreover, we present the D-file, an index-free MAM based on simple sequential search augmented by D-cache. The experimental evaluation shows that performance gain achieved due to D-cache is significant for all the MAMs, especially for the D-file.
Metric indexing, similarity search, distance caching, metric access methods, D-cache, MAM, index-free search.
Benjamin Bustos, Jakub Lokoč, Tomáš Skopal, "D-Cache: Universal Distance Cache for Metric Access Methods", IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 868-881, May 2012, doi:10.1109/TKDE.2011.19