| 摘 要: 随着信息化的发展，大量的数据被产生。在新产生的数据中，时间序列数据是一种重要的数据类型，而对 该类数据进行高效的查询处理成为了当前研究的热点。本文针对线性散列的索引机制，提出了一种新型的时间序列的查 询处理方法，以降低索引创建时间和提高查询效率。实验证明，本方法中的线性散列索引，在创建时的时间耗费有所下 降。在查询阶段采用K近邻与下界距离相结合的方法，能有效地过滤掉多余的结果，提高了时间序列查询处理的效率和 精确度。 |
| 关键词: 时间序列；线性散列；K-近邻；下界距离 |
|
中图分类号: TP391
文献标识码: A
|
| 基金项目: 教育部新世纪优秀人才支持计划项目(No.NCET-11-0861). |
|
| A Research on the Query Method of Time Series Based on Linear Hash Index |
|
DAI Ke
|
( Dalian Maritime University, Dalian 116026, China)
|
| Abstract: With the development of information science,more and more data is generated through different applications. Time series is an important data type,and the research on how to query time series data efficiently has drawn more and more attention.This paper proposes a new time series query processing method based on linear hash,aiming to reduce the index construction time and improve the query efficiency.The experiment results show that the index construction time has been reduced to some extent.Through the combined method of the K-nearest neighbor and the lower bounding distance in the query phase,redundant results can be effectively filtered,which improves the efficiency and accuracy of the time series query. |
| Keywords: time series;linear hash;K-nearest neighbor;lower bounding distance |
