Dynamic Reordering Bloom Filter

檔案

本條目沒有附加檔案。

日期

2017-01-01

期刊名稱

2017 19TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS 2017): MANAGING A WORLD OF THINGS

卷期與頁次

頁 288–291

語言

英文

摘要

In order to check a membership in multiple sets of bloom filter in a dynamic bloom filter, a sequential search is usually used. Since the distribution of queried data is unpredictable because the distribution has a feature of temporal locality. Therefore more search cost is incurred if queried data is stored in the peer which is corresponded to the Bloom Filter has lower query priority. In this paper, we introduce Dynamic Reordering Bloom Filter that can save the cost of searching Bloom Filter by dynamically reorder the searching sequence of multiple bloom filters in a dynamic bloom filter with One Memory Access Bloom Filter (OMABF) and checked in the order saved in Query Index (QI). The performance of the system is evaluated by Markov Chain. Simulation results show that our scheme on average has 43% better in searching performance comparing with the sequential methods, which is verified via three different trace log files.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, D.-C., Chen, C., & Thanavel, M. (2017). Dynamic Reordering Bloom Filter. 2017 19TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS 2017): MANAGING A WORLD OF THINGS, 288–291. https://ir.lib.nycu.edu.tw/handle/11536/146862

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/146862