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
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
Multidimensional access methods
ACM Computing Surveys (CSUR)
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
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
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th 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
The Arc-Tree: A Novel Symmetric Access Method for Multidimensional Data
ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
Priority Vantage Points Structures for Similarity Queries in Metric Spaces
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Searching and Updating Metric Space Databases Using the Parallel EGNAT
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Knowledge and Information Systems
Real-life performance of metric searching
SIGSPATIAL Special
Metric spaces in data mining: applications to clustering
SIGSPATIAL Special
A visual framework to understand similarity queries and explore data in Metric Access Methods
International Journal of Business Intelligence and Data Mining
Pivot selection method for optimizing both pruning and balancing in metric space indexes
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fully dynamic metric access methods based on hyperplane partitioning
Information Systems
Information Sciences: an International Journal
Effective monitoring by efficient fingerprint matching using a forest of NAQ-trees
Journal of Intelligent Information Systems
An index data structure for searching in metric space databases
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
An access structure for similarity search in metric spaces
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
BM+-Tree: a hyperplane-based index method for high-dimensional metric spaces
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Efficient similarity search in metric spaces with cluster reduction
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Growing neural gas efficiently
Neurocomputing
An efficient access method for multimodal video retrieval
Proceedings of the 19th Brazilian symposium on Multimedia and the web
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
| Hi-index | 0.00 |
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. 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. It is well-known that the degree of overlap directly affects the query performance of index structures. There are many suggestions to reduce overlap in multidimensional index structures, but the Slim-tree is the first metric structure explicitly designed to reduce the degree of overlap. Moreover, we present new algorithms for inserting objects and splitting nodes. The new insertion algorithm leads to a tree with high storage utilization and improved query performance, whereas the new split algorithm runs considerably faster than previous ones, generally without sacrificing search performance. Results obtained from experiments with real-world data sets show that the new algorithms of the Slim-tree consistently lead to performance improvements. After performing the Slim-down algorithm, we observed improvements up to a factor of 35% for range queries.