基于分段极值的时间序列数据查询显示方法  

Method for Query and Display of Time-series Data Based on Extreme Value of Segmented Periods

作　　者：李重文[1] 邓腾彬[2] 马世龙[3] 

机构地区：[1]湖南师范大学工程与设计学院,长沙410081 [2]东莞电子科技大学电子信息工程研究院,广东东莞523808 [3]北京航空航天大学软件开发环境国家重点实验室,北京100191

出　　处：《计算机工程》2014年第9期27-31,共5页Computer Engineering

基　　金：湖南省自然科学基金资助项目(13JJ6029);湖南师范大学青年优秀人才培养计划基金资助项目(ET13108);东莞市高等院校科研机构科技计划基金资助项目(20121081001019)

摘　　要：时间序列数据在许多领域广泛存在,有海量和复杂的特点,直接查询出所有的原始数据并对其进行分析十分耗时,且对计算机的内存消耗极大。为此,提出一种基于分段极值的时间序列数据查询显示方法,对需要查询分析数据的时间范围进行分段,根据各个时间段数据的极值及总取点个数来确定该时间段的取点个数,通过数据库本身的查询机制实现均匀取点,并结合多线程机制实现各时间段数据的并行查询及曲线绘制。实验结果表明,与传统查询及可视化方法相比,该方法能够指定取点数量,并在取点数量确定的情况下,绘制曲线能较好地逼近原始曲线,且极大地缩短曲线的查询绘制时间,具有较好的工程实用性。Time-series is a kind of important data object and is ubiquitous in the world. Due to its very large quality and complexity,data query and analysis base on the source data do pay high costs on time and memory of computer. A method for querying and displaying time-series data based on segmented extreme value is proposed. It segments the range of time to be queried and analyzed into periods of time,and then determines the number of access points in a period of time according to extreme value of each period of time and the total number of access points,accessing the points uniformly through a database query mechanism itself and combined with multi-threading mechanism to achieve parallel query and curve drawing of each time period data. Experimental results show that compared with traditional methods,the number of access points is able to be specified,and the drawn curve has a good approximation of the original curve in the case that the number of access points are determined. It is able to greatly shorten the curve querying and drawing time,with good engineering practicality.

关 键 词：时间序列 数据库查询 时间序列数据库 曲线绘制 数据压缩 数据分析 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]