Faster construction of ball-partitioning-based metric access methods

Authors:
Jéssica A. de Souza;Humberto L. Razente;Maria Camila N. Barioni
Affiliations:
Universidade Federal do ABC, Santo André, SP, Brazil;Universidade Federal de Uberlândia, Uberlândia, MG, Brazil;Universidade Federal de Uberlândia, Uberlândia, MG, Brazil
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 12
Cited 0

Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees

IEEE Transactions on Knowledge and Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)

Similarity Search: The Metric Space Approach (Advances in Database Systems)
A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index

ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

IEEE Transactions on Computers
A New Approach for Optimization of Dynamic Metric Access Methods Using an Algorithm of Effective Deletion

SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
New dynamic construction techniques for M-tree

Journal of Discrete Algorithms
Efficient bulk-loading on dynamic metric access methods

Information Systems
Fully dynamic metric access methods based on hyperplane partitioning

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most similarity search techniques for multimedia data is performed in metric spaces and with the aid of data structures known as metric access methods (MAM). Herein, we present three new node split strategies for M-tree and Slim-tree construction, the pioneer dynamic MAM. These strategies result in better distribution of elements on the tree nodes and require less distance calculations when compared with the previously proposed ones. Moreover, trees built with these strategies have shown to be more efficient for similarity queries, such as nearest neighbors. The experimental results show that trees built with the proposed strategies outperform those built with the original ones with regard to the number of disk accesses, the amount of distance calculations and time required to run the queries.