Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
Evaluating a class of distance-mapping algorithms for data mining and clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
Some approaches to best-match file searching
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
On Optimal Node Splitting for R-trees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Proximity Matching Using Fixed-Queries Trees
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Amdb: A Visual Access Method Development Tool
UIDIS '99 Proceedings of the 1999 User Interfaces to Data Intensive Systems
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Cluster-preserving Embedding of Proteins
Cluster-preserving Embedding of Proteins
Linguistic issues in the development of ReGra: A grammar checker for Brazilian Portuguese
Natural Language Engineering
String Matching with Metric Trees Using an Approximate Distance
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Indexing High-Dimensional Data for Efficient In-Memory Similarity Search
IEEE Transactions on Knowledge and Data Engineering
Accelerating approximate similarity queries using genetic algorithms
Proceedings of the 2005 ACM symposium on Applied computing
MAMView: a visual tool for exploring and understanding metric access methods
Proceedings of the 2005 ACM symposium on Applied computing
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Database Systems (TODS)
A non-linear dimensionality-reduction technique for fast similarity search in large databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
SIREN: a similarity retrieval engine for complex data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient processing of complex similarity queries in RDBMS through query rewriting
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
DBM*-Tree: an efficient metric access method
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
A fast and effective method to find correlations among attributes in databases
Data Mining and Knowledge Discovery
An effective cost model for similarity queries in metric spaces
Proceedings of the 2007 ACM symposium on Applied computing
Genetic algorithms for approximate similarity queries
Data & Knowledge Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
CM-tree: A dynamic clustered index for similarity search in metric databases
Data & Knowledge Engineering
Accelerating k-medoid-based algorithms through metric access methods
Journal of Systems and Software
An algorithm for effective deletion and a new optimization technique for metric access methods
Proceedings of the 2008 ACM symposium on Applied computing
Proceedings of the 2008 ACM symposium on Applied computing
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Proceedings of the 17th ACM conference on Information and knowledge management
Paginação de resultados em consultas por abrangência
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Wavelet-based fingerprint image retrieval
Journal of Computational and Applied Mathematics
Seamlessly integrating similarity queries in SQL
Software—Practice & Experience
Measuring evolving data streams' behavior through their intrinsic dimension
New Generation Computing
Easing the Dimensionality Curse by Stretching Metric Spaces
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Time-Aware Similarity Search: A Metric-Temporal Representation for Complex Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
The Onion-Tree: Quick Indexing of Complex Data in the Main Memory
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Data & Knowledge Engineering
Using an image-extended relational database to support content-based image retrieval in a PACS
Computer Methods and Programs in Biomedicine
Bulk construction of dynamic clustered metric trees
Knowledge and Information Systems
Efficient bulk-loading on dynamic metric access methods
Information Systems
The MM-tree: a memory-based metric tree without overlap between nodes
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Indexing high-dimensional data for main-memory similarity search
Information Systems
BP-tree: an efficient index for similarity search in high-dimensional metric spaces
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Integrating images to patient electronic medical records through content-based retrieval techniques
CBMS'03 Proceedings of the 16th IEEE conference on Computer-based medical systems
MedFMI-SiR: a powerful DBMS solution for large-scale medical image retrieval
ITBAM'11 Proceedings of the Second international conference on Information technology in bio- and medical informatics
Distributed similarity estimation using derived dimensions
The VLDB Journal — The International Journal on Very Large Data Bases
Computer Vision and Image Understanding
Dynamic optimization of queries in pivot-based indexing
Multimedia Tools and Applications
DisC diversity: result diversification based on dissimilarity and coverage
Proceedings of the VLDB Endowment
Faster construction of ball-partitioning-based metric access methods
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Geodetic distance queries on r-trees for indexing geographic data
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Visual word spatial arrangement for image retrieval and classification
Pattern Recognition
A scalable re-ranking method for content-based image retrieval
Information Sciences: an International Journal
| Hi-index | 0.00 |
Many recent database applications must deal with similarity queries. For such applications, it is important to measure the similarity between two objects using the distance between them. Focusing on this problem, this paper proposes the Slim-tree, a new dynamic tree for organizing metric data sets in pages of fixed size. The Slim-tree uses the triangle inequality to prune distance calculations needed to answer similarity queries over objects in metric spaces. 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 new insertion algorithm leads to a tree with high storage utilization and improved query performance. 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 驴fat-factor驴 is a way to quantify whether a given tree can be improved and also to compare two trees. We show how to use the fat-factor to achieve accurate estimates of the search performance and also how to improve the performance of a metric tree through the proposed 驴Slim-down驴 algorithm. This paper also presents a new tool in the arsenal of resources of Slim-tree aimed at visualizing it. Visualization is a powerful tool for interactive data mining and for the visual tracking of the behavior of a tree under updates. Finally, we present a formula to estimate the number of disk accesses in range queries. Results from experiments with real and synthetic data sets show that the new algorithms of the Slim-tree lead to performance improvements. These results show that the Slim-tree outperforms the M-tree up to 200 percent for range queries. For insertion and split, the Minimal-Spanning-Tree-based algorithm achieves up to 40 times faster insertions. We observed improvements up to 40 percent in range queries after applying the Slim-down algorithm.