Research on Time Series Query Method Based on Linear Hash Index
Abstract
With the continuous development of China's information technology, many data will also be produced. In these data, time series data is an important data type. In this paper, we propose a new query processing method for time series, in order to reduce the index creation time and improve query efficiency. Experimental results show that the linear hash index in this method is reduced in the time of creation. In the query phase, the method of combining the K nearest neighbor and the lower bound distance is used to filter out the redundant results.
Keywords
yime series; linear hashing; K- nearest neighbor; lower bound distance
DOI
10.12783/dtetr/mcee2017/15798
10.12783/dtetr/mcee2017/15798
Refbacks
- There are currently no refbacks.