String Processing and Information Retrieval, International Symposium on (1999)
Sept. 21, 1999 to Sept. 24, 1999
Edgar Chávez , Universidad Michoacana
J.L. Marroquín , CIMAT
Ricardo Baeza-Yates , Universidad de Chile
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.
R. Baeza-Yates, J. Marroquín and E. Chávez, "Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces," String Processing and Information Retrieval, International Symposium on(SPIRE), Cancun, Mexico, 1999, pp. 38.