基于Bitmap时间区间查询算法及其在智能会议管理中的应用  

Time Interval Query Algorithm Based on Bitmap and Application in Intelligent Conference Management

作　　者：李光华 张洪涛 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)

机构地区：[1]国能大渡河大数据服务有限公司,四川成都610016 [2]国能大渡河流域水电开发有限公司,四川成都610016

出　　处：《自动化技术与应用》2023年第6期108-111,149,共5页Techniques of Automation and Applications

摘　　要：为了解决时间区间查询算法耗时较长的问题,提出一种基于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.

关 键 词：时间区间序列 Bitmap编码 S-tree索引 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]