Incremental stock time series data delivery and visualization

SB-Tree is a binary tree data structure proposed to represent time series according to the importance of data points. Its use in stock data management is distinguished by preserving the critical data points' attribute values, retrieving time series data according to the importance of data points and facilitating multi-resolution time series retrieval. As new stock data are available continuously, an effective updating mechanism for SB-Tree is needed. In this paper, a study of different updating approaches is reported. Three families of updating methods are proposed. They are periodic rebuild, batch update and point-by-point update. Their efficiency, effectiveness and characteristics are compared and reported.

[1]  Tak-Chung Fu,et al.  Progressive time series visualization in a mobile environment , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[2]  Eamonn J. Keogh,et al.  Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases , 2001, Knowledge and Information Systems.

[3]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[4]  Eugene Fink,et al.  Search for Patterns in Compressed Time Series , 2002, Int. J. Image Graph..

[5]  Tak-Chung Fu,et al.  Adaptive data delivery framework for financial time series visualization , 2005, International Conference on Mobile Business (ICMB'05).

[6]  Tak-chung Fu,et al.  A specialized binary tree for financial time series representation , 2004 .

[7]  Tak-Chung Fu,et al.  SBT-forest, an indexing approach for specialized binary tree , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[8]  Fl Chung,et al.  Financial time series indexing based on low resolution clustering , 2004 .

[9]  Tak-chung Fu,et al.  Flexible time series pattern matching based on perceptually important points , 2001 .

[10]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[11]  Ada Wai-Chee Fu,et al.  Efficient time series matching by wavelets , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[12]  Eugene Fink,et al.  Indexing of Compressed Time Series , 2004 .

[13]  Haixun Wang,et al.  Landmarks: a new model for similarity-based pattern querying in time series databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[14]  Ambuj K. Singh,et al.  Dimensionality Reduction for Similarity Searching in Dynamic Databases , 1999, Comput. Vis. Image Underst..