Filters








57 Hits in 4.1 sec

Slim-Trees: High Performance Metric Trees Minimizing Overlap between Nodes [chapter]

Caetano Traina, Agma Traina, Bernhard Seeger, Christos Faloutsos
2000 Lecture Notes in Computer Science  
The Slim-tree uses the "fat-factor" which provides a simple way to quantify the degree of overlap between the nodes in a metric tree.  ...  In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size.  ...  Acknowledgments We are grateful to Pavel Zezula, Paolo Ciaccia and Marco Patella for giving us the code of the M-tree.  ... 
doi:10.1007/3-540-46439-5_4 fatcat:7ukjpa3xevggxgwldjh3aqkdq4

Fast indexing and visualization of metric data sets using slim-trees

C. Traina, A. Traina, C. Faloutsos, B. Seeger
2002 IEEE Transactions on Knowledge and Data Engineering  
The Slim-tree is the first metric access method to tackle the problem of overlap between nodes in metric spaces and to propose a technique to minimize it.  ...  The proposed insertion algorithm uses new policies to select the nodes where incoming objects are stored. When a node overflows, the Slim-tree uses a Minimal Spanning Tree to help with the split.  ...  The Slim-tree was developed to reduce the overlap between regions in each level.  ... 
doi:10.1109/69.991715 fatcat:4s5v3cwylvdsxkzlrautz72xde

STCLARanS: An Improved Clustering Large Applications based on Randomized Search Algorithm using Slim-tree Technique

2019 International journal of recent technology and engineering  
This paper addresses the task of integrating Slim-tree method to CLARANS for the development of the proposed Slim-tree Clustering Large Applications based on Randomized Search (STCLARanS) Algorithm and  ...  The Slim-tree method is used for pre-clustering of the objects in the dataset in identifying the objects in the middle level as the sample objects used to start the clustering process.  ...  According to [2] the minOccup option produce high rate of node occupation that yields to fewer number of disk accesses, however the degree of overlapping of nodes is high; whereas, the minDist option  ... 
doi:10.35940/ijrte.b1022.078219 fatcat:7hejlbmpgzgptohhfbpagpazaa

DBM-Tree: trading height-balancing for performance in metric access methods

Marcos R. Vieira, Caetano Traina Jr., Fabio J. T. Chino, Agma J. M. Traina
2006 Journal of the Brazilian Computer Society  
This paper presents a new dynamic MAM called the DBM-tree (Density-Based Metric tree), which can minimize the overlap between high-density nodes by relaxing the height-balancing of the structure.  ...  However, the overlapping between their nodes has a very high influence on their performance.  ...  minimize overlap between nodes.  ... 
doi:10.1590/s0104-65002006000100004 fatcat:xi6tt23lfrfw7hbteh4taogxui

DBM-Tree: Trading height-balancing for performance in metric access methods

Marcos R. Vieira, Caetano Traina, Fabio J. T. Chino, Agma J. M. Traina
2005 Journal of the Brazilian Computer Society  
This paper presents a new dynamic MAM called the DBM-tree (Density-Based Metric tree), which can minimize the overlap between high-density nodes by relaxing the height-balancing of the structure.  ...  However, the overlapping between their nodes has a very high influence on their performance.  ...  minimize overlap between nodes.  ... 
doi:10.1007/bf03192381 fatcat:b3jjeewtbrcvxior657jzjuvii

DB-GNG: A constructive Self-Organizing Map based on densilty

Alexander Ocsa, Carlos Bedregal, Ernesto Guadros-Vargas
2007 Neural Networks (IJCNN), International Joint Conference on  
It also introduces an overlapping measure and the algorithm Slim-Down [9] to reduce the overlap between nodes. • DBM-Tree [13] .  ...  It was the first Access Method which proposed to relax the height of the tree in regions with high density of data in order to minimize the overlap of nodes.  ... 
doi:10.1109/ijcnn.2007.4371257 dblp:conf/ijcnn/OcsaBC07 fatcat:nziiks3pwvegljiyziqqxz2hpm

Improving the Pruning Ability of Dynamic Metric Access Methods with Local Additional Pivots and Anticipation of Information [chapter]

Paulo H. Oliveira, Caetano Traina, Daniel S. Kaster
2015 Lecture Notes in Computer Science  
Metric Access Methods (MAMs) have been proved to allow performing similarity queries over complex data more efficiently than other access methods.  ...  work presents two techniques for improving the pruning ability of dynamic MAMs: (i) using cutting local additional pivots to reduce distance calculations and (ii) anticipating information from child nodes  ...  One of them is the Slim-tree [15] , an evolution of M-tree with improvements such as the evaluation and minimization of the overlap level between nodes and a new split algorithm.  ... 
doi:10.1007/978-3-319-23135-8_2 fatcat:wx6oqshxzbdzba4u23cym4ud7u

Optimizing metric access methods for querying and mining complex data types

Jessica Andressa de Souza, Humberto Luiz Razente, Maria Camila N Barioni
2014 Journal of the Brazilian Computer Society  
Methods: In this article we present four node split policies that can be employed in the construction of M-tree, the pioneer dynamic MAM, and of Slim-tree, the M-tree successor.  ...  In order to speed up the similarity-based comparisons performed by these approaches, it is possible to store the dataset in specialized data structures known as metric access methods (MAM).  ...  M-tree MinMax is considered to produce the best set of nodes as it minimizes the node coverage radii. However, it does not guarantee to minimize the global overlap of the structure.  ... 
doi:10.1186/s13173-014-0017-5 fatcat:w4xgb5gkpfcy5fwdwnqjbygfuy

Revisiting M-Tree Building Principles [chapter]

Tomš Skopal, Jaroslav Pokorný, Michal Krátký, Václav Snášel
2003 Lecture Notes in Computer Science  
The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce two dynamic techniques of building the M-tree.  ...  Usage of these techniques or even combination of them significantly increases the querying performance of the M-tree.  ...  Methods for indexing metric spaces include e.g. metric tree [14] , vp-tree [15] , mvp-tree [5] , Slim-tree [13] , and the M-tree [7] .  ... 
doi:10.1007/978-3-540-39403-7_13 fatcat:wucsqqauefernderbrfxkihc44

Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach

Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik
2006 ACM Transactions on Database Systems  
Other indexing methods based on metric spaces such as the M-tree and the Slim-trees are too general to effectively utilize the special characteristics of NDDSs, resulting in non-optimized performance.  ...  A theoretical model is also developed to predict the performance of the ND-tree for random data.  ...  Performance comparison between NDtree and metric trees for binary data (disk I/Os vs. various DB sizes) Fig. 13 . 13 Performance comparison between NDtree and metric trees for genomic data (disk I/Os  ... 
doi:10.1145/1138394.1138395 fatcat:26n7ptnsunfvdgpeohslvrseqa

A Survey on Big IoT Data Indexing: Potential Solutions, Recent Advancements, and Open Issues

Zineddine Kouahla, Ala-Eddine Benrazek, Mohamed Amine Ferrag, Brahim Farou, Hamid Seridi, Muhammet Kurulay, Adeel Anjum, Alia Asheralieva
2021 Future Internet  
The authors also presented a comparative study of multidimensional indexing methods and a comparative study of metric access methods.  ...  X-tree (eXtended node-tree) [131] is an R-tree based structure developed to prevent overlap between MBRs through the new proposed node type.  ...  According to the report of the experiments carried out in [254] , this algorithm reduces node occupancy, reduces overlap between nodes and increases significantly the performance of search operations  ... 
doi:10.3390/fi14010019 fatcat:xnlzg7cs2fb3lgng65ha5ucf5m

Double Distance-Calculation-Pruning for Similarity Search

Ives Pola, Fernanda Pola, Danilo Eler
2018 Information  
Studies on binary operators to solve similarity joins aim to improve efficiency and most of them use only the metric lower bound property for pruning.  ...  In this paper, we propose a generic concept that uses both lower and upper bound properties based on the Metric Spaces Theory to increase the avoidance of element comparisons.  ...  Another notable result is that using indexes like hierarchical balls of Slim-tree are ineffective when dealing with high radius values, due to the tree nodes overlap of the same level, and some cases causing  ... 
doi:10.3390/info9050124 fatcat:ix6dyzasebenridcib3jx2ifqq

On reinsertions in M-tree

Jakub Lokoc, Tomas Skopal
2008 2008 IEEE 24th International Conference on Data Engineering Workshop  
A regular leaf split is performed only after a series of unsuccessful reinsertion attempts.  ...  In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions.  ...  So far, many MAMs have been developed, e.g., (m)vp-tree, slim-tree, Mtree, PM-Tree, D-index and many others [15, 8] .  ... 
doi:10.1109/icdew.2008.4498352 dblp:conf/icde/LokocS08 fatcat:3wjnzthyyjfolkzweponn6nkm4

On Reinsertions in M-tree

Jakub Lokoc, Tomá Skopal
2008 First International Workshop on Similarity Search and Applications (sisap 2008)  
A regular leaf split is performed only after a series of unsuccessful reinsertion attempts.  ...  In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions.  ...  So far, many MAMs have been developed, e.g., (m)vp-tree, slim-tree, Mtree, PM-Tree, D-index and many others [15, 8] .  ... 
doi:10.1109/sisap.2008.10 dblp:conf/sisap/LokocS08 fatcat:jdyretbzarbjnk5jizar3s4jaa

The Metric Histogram: A New and Efficient Approach for Content-Based Image Retrieval [chapter]

Agma J. M. Traina, Caetano Traina, Josiane M. Bueno, Paulo M. Azevedo-Marques
2002 Visual and Multimedia Information Management  
A new metric distance function DM( ) to measure the dissimilarity between images through their metric histograms is also presented.  ...  The experiments performed showed that metric histograms are more than 10 times faster than the traditional approach of using histograms and keep the same recovering capacity.  ...  The Slim-tree has been used because it allows the minimization of the overlap between nodes in the structure as well to measure this overlap.  ... 
doi:10.1007/978-0-387-35592-4_21 fatcat:vwtdnt6q35a7haf2fcco52hphe
« Previous Showing results 1 — 15 out of 57 results