Efficient bulk-loading on dynamic metric access methods

Authors:
Thiago G. Vespa;Caetano Traina, Jr;Agma J. Traina
Affiliations:
ICMC - Institute of Mathematics and Computer Sciences, USP - University of São Paulo, Avenida do Trabalhador Sãocarlense, 400, Postal Code: 13566-590 - São Carlos, SP, Brazil;ICMC - Institute of Mathematics and Computer Sciences, USP - University of São Paulo, Avenida do Trabalhador Sãocarlense, 400, Postal Code: 13566-590 - São Carlos, SP, Brazil;ICMC - Institute of Mathematics and Computer Sciences, USP - University of São Paulo, Avenida do Trabalhador Sãocarlense, 400, Postal Code: 13566-590 - São Carlos, SP, Brazil
Venue:
Information Systems
Year:
2010

Citing 15
Cited 2

The input/output complexity of sorting and related problems

Communications of the ACM
The performance of current B-tree algorithms

ACM Transactions on Database Systems (TODS)
A cost model for similarity queries in metric spaces

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods

ACM Computing Surveys (CSUR)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Modeling high-dimensional index structures using sampling

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Intelligent Access to Digital Video: Informedia Project

Computer
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees

IEEE Transactions on Knowledge and Data Engineering
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations

EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
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
An Evaluation of Generic Bulk Loading Techniques

Proceedings of the 27th International Conference on Very Large Data Bases
The Metric Histogram: A New and Efficient Approach for Content-based Image Retrieval

Proceedings of the IFIP TC2/WG2.6 Sixth Working Conference on Visual Database Systems: Visual and Multimedia Information Management
Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)
Similarity Search: The Metric Space Approach (Advances in Database Systems)

Similarity Search: The Metric Space Approach (Advances in Database Systems)
The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient

The VLDB Journal — The International Journal on Very Large Data Bases

Slicing the metric space to provide quick indexing of complex data in the main memory

Information Systems
Faster construction of ball-partitioning-based metric access methods

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance.