| 注册
首页|期刊导航|计算机应用研究|基于内存受限的RFID复杂事件处理优化算法

基于内存受限的RFID复杂事件处理优化算法

尹方鸣 康慕宁 陈群 马岩

计算机应用研究2009,Vol.26Issue(8):2864-2867,4.
计算机应用研究2009,Vol.26Issue(8):2864-2867,4.DOI:10.3969/j.issn.1001-3695.2009.08.017

基于内存受限的RFID复杂事件处理优化算法

RFID complex event processing optimization algorithm with memory constraint

尹方鸣 1康慕宁 1陈群 1马岩1

作者信息

  • 1. 西北工业大学,计算机学院,西安,710129
  • 折叠

摘要

Abstract

Complex event processing (CEP) is a key technology of RFID data management. But the massive stream of realtime data may cause memory bottlenecks, data placed in external storage and restrictions on large-scale deployment of RFID. So this paper proposed a BIOT ( B Plus tree indexing optimization of time-slicing) algorithm. With memory constraint, according to timing sequence, the data stream would be divided into segments which would be indexed by B + - tree, then to avoid frequently searching pre-event at external storage matched complex event with the guide of statistical law. This algorithm has greatly reduced the I/O overhead and increased throughput. In addition, correlated comparative experiments are carried out to verify the effectiveness of the algorithm.

关键词

分布差/内存瓶颈/复杂事件处理

Key words

priority/memory bottleneck/complex event processing

分类

信息技术与安全科学

引用本文复制引用

尹方鸣,康慕宁,陈群,马岩..基于内存受限的RFID复杂事件处理优化算法[J].计算机应用研究,2009,26(8):2864-2867,4.

基金项目

NSFC-JST重大国际(地区)合作项目(60720106001) (地区)

国家自然科学基金资助项目(60803043) (60803043)

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文