A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multidimensional access methods
ACM Computing Surveys (CSUR)
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Multimedia Databases in Perspective
Multimedia Databases in Perspective
Modern Information Retrieval
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
A Survey on Content-Based Retrieval for Multimedia Databases
IEEE Transactions on Knowledge and Data Engineering
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
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Fully Dynamic Spatial Approximation Trees
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Probabilistic Proximity Searching Algorithms Based on Compact Partitions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A Probabilistic Spell for the Curse of Dimensionality
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Searching in Metric Spaces by Spatial Approximation
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
D-Index: Distance Searching Index for Metric Data Sets
Multimedia Tools and Applications
Improved search heuristics for the sa-tree
Pattern Recognition Letters
Improved Deletions in Dynamic Spatial Approximation Trees
SCCC '03 Proceedings of the XXIII International Conference of the Chilean Computer Science Society
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
An access structure for similarity search in metric spaces
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Metric Index: An Efficient and Scalable Solution for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Dynamic Spatial Approximation Trees for Massive Data
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Enlarging nodes to improve dynamic spatial approximation trees
Proceedings of the Third International Conference on SImilarity Search and APplications
Fully dynamic metric access methods based on hyperplane partitioning
Information Systems
Finding the k-closest pairs in metric spaces
Proceedings of the 1st Workshop on New Trends in Similarity Search
Impact of the initialization in tree-based fast similarity search techniques
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters
Static-to-Dynamic transformation for metric indexing structures
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
DSACL+-tree: a dynamic data structure for similarity search in secondary memory
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Hi-index | 0.00 |
Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other repositories handling complex objects. Although promising, the metric space approach is still immature in several aspects that are well established in traditional databases. In particular, most indexing schemes are static, that is, few of them tolerate insertion or deletion of elements at reasonable cost over an existing index. The spatial approximation tree (sa--tree) has been experimentally shown to provide a good tradeoff between construction cost, search cost, and space requirement. However, the sa--tree is static, which renders it unsuitable for many database applications. In this paper, we study different methods to handle insertions and deletions on the sa--tree at low cost. In many cases, the dynamic construction (by successive insertions) is even faster than the previous static construction, and both are similar elsewhere. In addition, the dynamic version significantly improves the search performance of sa--trees in virtually all cases. The result is a much more practical data structure that can be useful in a wide range of database applications.