Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces

Authors:
Edgar Chávez;J. L. Marroquín;Ricardo Baeza-Yates
Affiliations:
-;-;-
Venue:
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Year:
1999

Citing 0
Cited 20

Searching in metric spaces

ACM Computing Surveys (CSUR)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching

Multimedia Tools and Applications
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces

Information Processing Letters
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 in metric spaces by spatial approximation

The VLDB Journal — The International Journal on Very Large Data Bases
Pivot selection techniques for proximity searching in metric spaces

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

ACM Transactions on Database Systems (TODS)
A compact space decomposition for effective metric indexing

Pattern Recognition Letters
The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient

The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic spatial approximation trees

Journal of Experimental Algorithmics (JEA)
Reference-based indexing for metric spaces with costly distance measures

The VLDB Journal — The International Journal on Very Large Data Bases
Parallel query processing on distributed clustering indexes

Journal of Discrete Algorithms
Indexability, concentration, and VC theory

Proceedings of the Third International Conference on SImilarity Search and APplications
On the asymptotic behavior of nearest neighbor search using pivot-based indexes

Proceedings of the Third International Conference on SImilarity Search and APplications
Clustered pivot tables for I/O-optimized similarity search

Proceedings of the Fourth International Conference on SImilarity Search and APplications
A GPU-Based Implementation for Range Queries on Spaghettis Data Structure

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
Indexability, concentration, and VC theory

Journal of Discrete Algorithms
Dynamic optimization of queries in pivot-based indexing

Multimedia Tools and Applications
Modelling efficient novelty-based search result diversification in metric spaces

Journal of Discrete Algorithms
Range query processing on single and multi GPU environments

Computers and Electrical Engineering

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present a new, pivot based data structure with dynamic capabilities to insert/delete both database elements and pivots. This feature is useful for applications in where the database is not stationary, and the pivots must be changed from time to time. The spaghettis data structure can be thought as a \ at" representation of a tree; but unlike it, a full representation of the distances can be used, instead of discretizing them.