Spaghettis: an array based algorithm for similarity queries in metric spaces

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 where the database is not stationary, and the pivots must be changed from time to time. The spaghettis data structure can be thought of a...

Full description

Saved in:
Bibliographic Details
Published inString Processing and Information Retrieval Symposium and International Workshop on Groupware : September 22-24, 1999, Cancun, Mexico pp. 38 - 46
Main Authors Chavez, E., Marroquin, J.L., Baeza-Yates, R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Extraterrestrial measurements
Online AccessGet full text
ISBN0769502687
9780769502687
DOI10.1109/SPIRE.1999.796576

Cover

More Information
Summary: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 where the database is not stationary, and the pivots must be changed from time to time. The spaghettis data structure can be thought of as a "flat" representation of a tree; but unlike it, a full representation of the distances can be used, instead of discretizing them.
ISBN:0769502687
9780769502687
DOI:10.1109/SPIRE.1999.796576