Dynamic Reordering Bloom Filter
Simple item page Statistics| Field | Value | Language |
|---|---|---|
dc.citation.epage |
291 | en_US |
dc.citation.spage |
288 | en_US |
dc.contributor.author |
Chang, Da-Chung | en_US |
dc.contributor.author |
Chen, Chien | en_US |
dc.contributor.author |
Thanavel, Mahadevan | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
資訊技術服務中心 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.contributor.department |
Information Technology Services Center | en_US |
dc.date.accessioned |
2018-08-21T05:56:57Z | |
dc.date.available |
2018-08-21T05:56:57Z | |
dc.date.issued |
2017-01-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.journal |
2017 19TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS 2017): MANAGING A WORLD OF THINGS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/146862 | |
dc.identifier.wosnumber |
WOS:000417431200055 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
bloom filter | en_US |
dc.subject |
dynamic bloom filter | en_US |
dc.subject |
one memory access bloom filter | en_US |
dc.subject |
temporal locality | en_US |
dc.subject |
distributed system | en_US |
dc.title |
Dynamic Reordering Bloom Filter | en_US |
dc.type |
Proceedings Paper | en_US |
Files
No files are attached to this item.
Collections: Conferences Paper
Cite this item
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
Citation generated in APA 7th edition style; please check it before use.
Share
Permanent link: https://ir.lib.nycu.edu.tw/handle/11536/146862