• Corpus ID: 11478885

Bulk-loading Dynamic Metric Access Methods

  title={Bulk-loading Dynamic Metric Access Methods},
  author={T. G. Vespa and Caetano Traina and Agma J. M. Traina},
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. The proposed algorithm is sample-based, and it builds a height-balanced tree in a top-down fashion, using the metric domain’s distance function and a bound limit to group and determine the number of elements in each partition of the dataset at each step of the algorithm. Experiments performed to drill its performance… 

Figures and Tables from this paper

The HeightBL Algorithm for Bulk-loading F-Onion-trees

Performance tests with real-world data with different volumes and dimensionalities showed that the index produced by the HeightBL algorithm is very compact and significantly improved range and k-NN query processing performance.

New dynamic construction techniques for M-tree

Tree-based indexing methods for similarity search in metric and nonmetric spaces

The M-tree can still be regarded as an important dynamic metric access method suitable for management of large collections of unstructured data and can be extended to a new indexing method – the NM-tree, which allows efficient nonmetric similarity search by use of the TriGen algorithm.

Revisiting the DBM-Tree

The DBM-tree is revisited as well as the following up research projects related to the D BM-tree.

Algoritmos de bulk-loading para o método de acesso métrico Onion-tree

Resumo. A Onion-tree e um metodo de acesso metrico (MAM) voltado a indexacao de dados complexos em memoria primaria que possui as seguintes propriedades principais: (i) um metodo de particionamento

Operação de carga-rápida (bulk-loading) em métodos de acesso métricos

Resumo em português O grau de similaridade entre elementos de dados é o fator primordial para a recuperação de informações em Sistemas Gerenciadores de Bases de Dados que manipulam dados complexos,



Bulk Loading the M-tree

Experimental results show that the BulkLoading algorithm can significantly improve the index’ performance with respect to M-tree insertion methods, and its performance is comparable to that of static metric trees.

On bulk loading TPR-Tree

  • B. LinJianwen Su
  • Computer Science
    IEEE International Conference on Mobile Data Management, 2004. Proceedings. 2004
  • 2004
Empirical studies show that HBU outperforms both TPR and TGS for all kinds of non-uniform datasets, is relatively stable over varying degree of skewness and better for large datasets and large query windows.

Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes

The Slim-tree is the first metric structure explicitly designed to reduce the degree of overlap, and new algorithms for inserting objects and splitting nodes are presented, generally without sacrificing search performance.

Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations

A new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems is proposed, which outperforms both classic index construction and competitive bulk loading techniques.

The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient

This paper discusses the new Omni-technique, which allows to build a variety of dynamic Metric Access Methods based on a number of selected objects from the dataset, used as global reference objects, known as the Omni-family of metric access methods.

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

The slim-tree is a metric access method that tackles the problem of overlaps between nodes in metric spaces and that allows one to minimize the overlap, and how to improve the performance of a metric tree through the proposed "slim-down" algorithm is shown.

An Evaluation of Generic Bulk Loading Techniques

The main contribution of the paper is the proposal of two new generic and conceptually simple bulk loading algorithms that recursively partition the input by using a main-memory index of the same type as the target index to be build.

Efficient Bulk Operations on Dynamic R-Trees

This paper presents a simple, yet efficient, technique for performing bulk update and query operations on multidimensional indexes in terms of the so-called R-tree and its variants, as they have emerged as practically efficient indexing methods for spatial data.

A cost model for similarity queries in metric spaces

This work insists that the distance distribution of objects can be profitably used to solve the problem of estimating CPU and I/O costs for processing range and k-nearest neighbors queries over metric spaces, and develops a concrete cost model for the M-tree access method.

The Buffer Tree: A Technique for Designing Batched External Data Structures

  • L. Arge
  • Computer Science
  • 2003
We present a technique for designing external memory data structures that support batched operations I/ O efficiently. We show how the technique can be used to develop external versions of a search