A Hybrid Method for Fast Predicate Matching in Data Stream Processing

Efficient predicate matching is essential to provide real-time responses in data stream processing. Many predicate indexes have been introduced to address the predicate matching problem. Among them, the IBS-tree handles predicates with open and closed intervals in O(log^2n) time. However, it was found that its insertion algorithm is not optimal when processing open intervals. In this paper, a predicate indexing method is proposed that supports fast insertion of predicates based on the IBS-tree scheme without degrading the search performance. The basic idea of the proposed method is to use shared lists when processing open intervals, and the insertion time is reduced to O(log n) in this case. When dealing with closed intervals, an algorithm of the IBS-tree was used. Consequently, the insertion performance of the proposed method improves as the ratio of open intervals increases, which we observed through our experiments.

並列關鍵字

predicate matching ； predicate index ； shared list ； IBS-tree ； data stream processing

被引用紀錄

Lo, T. J. (2006). ㄧ個針對H.264主要規範視訊的無記憶體全文自適應變動長度解碼器 [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2006.00319

林學政（2011）。利用電紡絲技術製作藥物傳遞系統支架〔碩士論文，國立交通大學〕。華藝線上圖書館。https://doi.org/10.6842/NCTU.2011.00506

葉志宗（2009）。以幾丁聚醣為基質製備應用於藥物釋放之組織工程多孔性支架〔碩士論文，國立臺北科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0006-1008200918070000

Hu, S. H. (2014). 電阻式氧化銦錫氨氣感測器之製備與感測特性之研究 [master's thesis, Chaoyang University of Technology]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0078-2611201410190824

國際替代計量

A Hybrid Method for Fast Predicate Matching in Data Stream Processing

全文下載

主題瀏覽