Improved search heuristics for the sa-tree

Authors:
Gísli R. Hjaltason;Hanan Samet
Affiliations:
School of Computer Science, University of Waterloo, 200 University Ave W, Waterloo, Ont., Canada N2L 3G1;Computer Science Department, Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland, College Park, MD
Venue:
Pattern Recognition Letters
Year:
2003

Citing 14
Cited 3

New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)

Pattern Recognition Letters
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements

Pattern Recognition Letters
On saying “Enough already!” in SQL

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Data mining: concepts and techniques

Data mining: concepts and techniques
Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Searching in metric spaces

ACM Computing Surveys (CSUR)
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
Searching in metric spaces by spatial approximation

The VLDB Journal — The International Journal on Very Large Data Bases
Searching in Metric Spaces by Spatial Approximation

SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)

Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)
Dynamic spatial approximation trees

Journal of Experimental Algorithmics (JEA)
Indexing issues in supporting similarity searching

PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II

Quantified Score

Hi-index	0.10

Visualization

Abstract

The sa-tree is an interesting metric space indexing structure that is inspired by the Voronoi diagram. In essence, the sa-tree records a portion of the Delaunay graph of the data set, a graph whose vertices are the Voronoi cells, with edges between adjacent cells. An improvement is presented on the original search strategy for the sa-tree. This consists of details on the intuition behind the improvement as well as the original search strategy and a proof of their correctness. Furthermore, it is shown how to adapt an incremental nearest neighbor algorithm to the sa-tree, which allows computing nearest neighbor in a progressive manner. Unlike other adaptations, the resulting algorithm does not take the unnecessary steps to ensure that keys of "node" elements are monotonically non-decreasing.