Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1145/1099554.1099626 | CIKM |
Keywords | Field | DocType |
time series,multi-resolution time series retrieval,point-by-point update,batch update,critical data point,incremental stock time series,data delivery,retrieving time series data,data point,new stock data,binary tree data structure,stock data management,data management,data structure,time series data,binary tree | Data point,Time series,Data mining,Data structure,Time series representation,Information retrieval,Visualization,Computer science,Binary tree,Periodic graph (geometry),Data management | Conference |
ISBN | Citations | PageRank |
1-59593-140-6 | 6 | 0.51 |
References | Authors | |
7 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tak-chung Fu | 1 | 407 | 21.29 |
Fu-lai Chung | 2 | 244 | 34.50 |
Pui-ying Tang | 3 | 6 | 0.51 |
Robert Luk | 4 | 97 | 5.88 |
Chak-man Ng | 5 | 116 | 9.33 |