Application of clustering algorithm in time-series index construction

The paper suggests a new metric space index data structure b-tree, which constructs the index structure on the basis of bottom-up hierarchical clusters, when most of the traditional metric space index data structures are constructed top-down. Comparing to the traditional construction method, b-tree can contain more objects with shorter indexing radius, which is more favorable for the query´s selection.