基于事件列表遞歸比較的復(fù)雜事件匹配方法

摘要： 針對(duì)現(xiàn)有復(fù)雜事件匹配處理方法存在匹配代價(jià)高的問題，提出了一種在有序事件列表上選擇最佳匹配順序進(jìn)行遞歸遍歷的復(fù)雜事件匹配方法OptiSeq。將事件實(shí)例按照查詢模式中不同事件類型緩存到有序事件列表中，并通過事件列表中事件實(shí)例的數(shù)量選擇最優(yōu)的查詢匹配起點(diǎn)及查詢匹配順序，之后在有序列表上對(duì)不同約束分別進(jìn)行遞歸校驗(yàn)，最終輸出完全滿足查詢模式的所有復(fù)雜事件結(jié)果。該方法克服了使用自動(dòng)機(jī)模型固定狀態(tài)轉(zhuǎn)換的弊端，也避免了使用樹型模型批處理操作漏解的問題，并且合理優(yōu)化了匹配順序，進(jìn)一步提高查詢匹配效率。在模擬數(shù)據(jù)集和真實(shí)數(shù)據(jù)集上進(jìn)行了實(shí)驗(yàn)測(cè)試與分析，與當(dāng)前流行的SASE、Siddhi兩種復(fù)雜事件處理方法進(jìn)行比較。實(shí)驗(yàn)表明，所提出的方法能夠在保證匹配正確性的同時(shí)，有效地減少匹配過程中的冗余計(jì)算，提高整體匹配效率。

關(guān)鍵詞： 復(fù)雜事件匹配；遞歸比較；有序事件列表；查詢過濾；屬性驗(yàn)證

中圖分類號(hào)： TP315" " " " 文獻(xiàn)標(biāo)志碼： A

doi：10.3969/j.issn.2095-1248.2023.02.005

Complex event matching based on recursive comparison of event list

XIA Xiu-feng， DING Jian-li， QIU Tao， XIE Pei-liang

（College of Computer Science， Shenyang Aerospace University， Shenyang 110136，China）

Abstract： Aiming at the problem of high matching cost in the existing complex event matching processing methods， a complex event matching method OptiSeq was proposed， which selected the best matching order on the ordered event list for recursive traversal. The event instances were cached in the ordered event list according to the different event types in the query mode， and the optimal query matching starting point and query matching order were selected by judging the number of event instan ces in the event list. Then， the OptiSeq method performed recursive validation and ultimately output all complex event results that fully met the query pattern.This method overcame the drawbacks of using automata model to fix state transitions， and also avoided the problem of missing solutions in batch operations using tree models， and optimized the matching order reasonably， further improved query matching efficiency. Experiments were tested and analyzed on simulated datasets and real datasets， and compared with the current popular SASE and Siddhi complex event processing methods. The experiments show that the proposed method can effectively reduce the redundant calculations in the matching process and improve the overall matching efficiency while ensuring the correctness of matching.

Key words： complex event matching；recursive comparison；ordered event list；query filtering；attribute verification

隨著信息技術(shù)產(chǎn)業(yè)發(fā)展的進(jìn)一步深化及物聯(lián)網(wǎng)技術(shù)、傳感器網(wǎng)絡(luò)和射頻識(shí)別等技術(shù)與應(yīng)用的快速發(fā)展，大規(guī)模的流式數(shù)據(jù)從各式各樣的應(yīng)用系統(tǒng)中不斷產(chǎn)生和涌現(xiàn)，包括設(shè)備運(yùn)行狀態(tài)數(shù)據(jù)、企業(yè)信息化數(shù)據(jù)、生產(chǎn)參數(shù)數(shù)據(jù)等。面對(duì)這些大量的描述性物理數(shù)據(jù)，用戶迫切地希望能夠在這些海量數(shù)據(jù)中及時(shí)發(fā)現(xiàn)、挖掘一些有意義的數(shù)據(jù)，如何根據(jù)特定的匹配條件高效地獲取并處理有價(jià)值的數(shù)據(jù)信息成為研究的熱點(diǎn)，復(fù)雜事件匹配處理技術(shù)也因此應(yīng)運(yùn)而生。……