An Efficient Method for Processing Consecutive Events over Streams with a Negation Link
- 주제(키워드) CEPIN , event streams , consecutive events , negation link
- 발행기관 아주대학교
- 지도교수 정태선
- 발행년도 2012
- 학위수여년월 2012. 8
- 학위명 석사
- 학과 및 전공 정보통신대학원 유비쿼터스시스템
- 실제URI http://www.dcollection.net/handler/ajou/000000012800
- 본문언어 영어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
ABSTRACT Recent query processors for complex events filter data streams to match specific patterns and transform streamed data into meaningful information. To specify patterns, complex event processing languages adopt a negation to present an event that should not appear at a specific position. A negation makes queries more expressive forms, but they need to look up indexes each time. In this paper, we review an efficient processing technique for a negation and propose a technique named CEPIN (Consecutive Events Processing In Negations) for processing consecutive events in a query with negations. The key is to investigate whether a present event type is identical to the previous one. If so, a calculation to find out a result sequence range is not necessary and conclusively the required time for a negation and a reverse order of links processing can be saved. Our experiment shows a reduction in numbers of processes and calculations per event.
more목차
TABLE OF CONTENTS
1. Introduction 1
2. Related Work 3
2.1. Publish/Subscribe Systems 3
2.2. XML Filtering Systems 5
2.3. Complex Event Processing 8
2.3.1. Definition of Events 8
2.3.2. The Concept of CEP 9
2.3.3. Event Language 10
2.3.4. Construction of Sequence Based on NFA 12
2.4. Negation Processing with a Negation Link 15
3. Proposed Algorithm 25
3.1. Basic Definitions 25
3.1.1. Event: Member Variable and Functions 25
3.1.2. Stack: Functions 26
3.2. CEPIN : Consecutive Events Processing In Negations 27
3.3. Experiment Results 32
4. Conclusion 34
Bibliography 35
Abstract (In Korean) 40
