摘要
为了解决时间区间查询算法耗时较长的问题,提出一种基于Bitmap时间区间查询算法。首先对时间区间序列数据编码得到有界Bitmap,分析其相似性度量,并优化搜索终止条件,然后基于S-tree索引结构设计了最佳优先搜索算法。实验结果表明,与现有的滑动时间窗口算法和传统Bitmap查询算法相比,本文算法查询耗时较少,具有良好的有效性和高效性。
In order to solve the time-consuming problem of time interval query algorithm,a time interval query algorithm based on bitmap is proposed.Firstly,the time interval sequence is transformed into bitmaps of fixed length by a bin-bitmap method,and through analyzing its similarity measure the search conditions are given.Then,the best priority search algorithm is designed based on S-tree index structure.The experimental results show that compared with the existing sliding time window algorithm and traditional bitmap query algorithm,this method has good effectiveness and efficiency with a short time consuming.
作者
李光华
张洪涛
LI Guang-hua;ZHANG Hong-tao(Guoneng Dadu River Big Data Service Co.,Ltd.,Chengdu 610016 China;Guoneng Dadu River Basin Hydropower Development Co.,Ltd.,Chengdu 610016 China)
出处
《自动化技术与应用》
2023年第6期108-111,149,共5页
Techniques of Automation and Applications
