[1]黄凯,余金山.在线数据流的连续限制查询算法[J].华侨大学学报(自然科学版),2010,31(2):174-179.[doi:10.11830/ISSN.1000-5013.2010.02.0174]
　HUANG Kai,YU Jin-shan.Algorithm of the Continuous Constraint Queries Based on the Online Data Stream[J].Journal of Huaqiao University(Natural Science),2010,31(2):174-179.[doi:10.11830/ISSN.1000-5013.2010.02.0174]
点击复制

在线数据流的连续限制查询算法()
分享到：

《华侨大学学报（自然科学版）》[ISSN:1000-5013/CN:35-1079/N]

卷:
第31卷
期数:
2010年第2期
页码:
174-179
栏目:
出版日期:
2010-03-20

文章信息/Info

Title:
Algorithm of the Continuous Constraint Queries Based on the Online Data Stream
文章编号:
1000-5013(2010)02-0174-06
作者:
黄凯; 余金山
华侨大学计算机科学与技术学院
Author(s):
HUANG Kai;  YU Jin-shan
College of Computer Science and Technology, Huaqiao University, Quanzhou 362021, China
关键词:
持续限制查询;  警告触发;  网络日志;  在线数据流;  算法
Keywords:
continuous constraint query;  alert triggering;  Web log;  online data stream;  algorithm
分类号:
TP301.6
DOI:
10.11830/ISSN.1000-5013.2010.02.0174
文献标志码:
A
摘要:
提出并实现一个基于持续限制查询的在线系统,使其能在网络日志数据流中,当满足一定条件的事件时自动发出警告; 而条件是根据用户需要而设定的,用来侦测可能严重破坏网站正常运作的行为.分析并评测时间索引算法、无时间索引算法、紧过期时间算法、紧过期时间无索引算法、多查询并行算法5种算法的性能,结果表明,单个查询时,无时间索引算法是最好的选择; 而在多个查询时,多查询并行算法是最佳的算法.
Abstract:
An on-line system on the basis of continuous constraint queries(CCQ) is proposed and constructed,which can trigger alerts whenever some events from data that arrive from an online Web log stream satisfy some specific patterns.These patterns are set by the user in order to detect the abnormal situation that could ruin the Web site significantly.The five algorithms,time index algorithm,no time index algorthm,close overdue time algorithm,close overdue time no index algorthm and multi-query parallel algorithm,are analyzed and evaluated.The result show that no time index algorthm is the best choice during single query and multi-query parallel algorithm is the best algorithm during multi query.

参考文献/References:

[1] MARIOS H, NIKOS M, YUFEI T. Lecture notes in computer science:Continuous constraint query evaluation for spatiotemporal streams [M]. Beilin:Springer-Verlag, 2007.348-365.
[2] CHEN Jian-jun, DEWITT D J, TIAN F. Niagara CQ:A scalable continuous query system for Internet databases [A]. New York:ACM, 2000.379-390.
[3] HELGASON R V, KENNINGTON J L, STEWART B D. The one-to-one shortest-path problem:An empirical analysis with the two-three Dijkstra algorithm [J]. Computational Optimization and Applications, 1993(1):47-75.
[4] KUZNETSOV N A, FETISOV V N. Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks [J]. Automation and Remote Control, 2008(2):247-251.
[5] 刘佳, 刘国华, 宋驰. 基于流数据技术的连续查询处理 [J]. 计算机工程, 2005(8):74-77.doi:10.3969/j.issn.1000-3428.2005.08.027.

备注/Memo

备注/Memo:
福建省自然科学基金计划资助项目(A0810013)
更新日期/Last Update: 2014-03-23