DocumentCode :
3204823
Title :
Spaghettis: an array based algorithm for similarity queries in metric spaces
Author :
Chávez, Edgar ; Marroquín, J.L. ; Baeza-Yates, Ricardo
Author_Institution :
Univ. Michoacana, Morelia, Mexico
fYear :
1999
fDate :
1999
Firstpage :
38
Lastpage :
46
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 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
Keywords :
data structures; database management systems; query processing; Spaghettis; array based algorithm; database elements; flat representation; h dynamic capabilitie; metric spaces; pivot based data structure; similarity queries; tree representation; Extraterrestrial measurements;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
String Processing and Information Retrieval Symposium, 1999 and International Workshop on Groupware
Conference_Location :
Cancun
Print_ISBN :
0-7695-0268-7
Type :
conf
DOI :
10.1109/SPIRE.1999.796576
Filename :
796576
Link To Document :
بازگشت