Towards In-Network Compact Representation: Mergeable Counting Bloom Filter Vis Cuckoo Scheduling
文献类型：期刊论文
| 作者 | Liu, Wenjing1; Xu, Zhiwei1,2; Tian, Jie3; Zhang, Yujun2 |
| 刊名 | IEEE ACCESS
 |
| 出版日期 | 2021 |
| 卷号 | 9页码:55329-55339 |
| 关键词 | Arrays Merging Random access memory Edge computing Distributed databases Schedules Electronic mail Edge computing in-network data representation compact representation mergeable counting bloom filter cuckoo-based bit array scheduling |
| ISSN号 | 2169-3536 |
| DOI | 10.1109/ACCESS.2021.3070982 |
| 英文摘要 | With the breakthrough of edge intelligence, we are witnessing a booming increase in distributed applications on edge nodes. These distributed applications need to apply a novel data representation algorithm to support data-information exchanging and data-information based decision among different edge nodes. As the most efficient data compact representation algorithm, Counting Bloom Filter (CBF) is an extension of Bloom filter, which enables updating data representation as well as inserting data into a representation. To facilitate distributed applications on edge nodes, edge nodes need to exchange and summarize the information of the data collected from different edge nodes. Impossible to merge with other CBFs, the existing CBF and its variants thus cannot be used for representing and exchanging data information among edge nodes. To handle this problem, we design a novel mergeable CBF, mergeCBF. Based on an insight about the counting processing of a CBF, we unfold the counter array of the conventional CBF to a group of bit arrays, and in order to support merging multiple filters, map each inputted item to the cells in this group of cuckoo-scheduled bit arrays instead of the counters in CBF. Experiments on real-world datasets demonstrate that mergeCBF can support conventional operations and merging operations in an efficient way without degrading the quality of the representation results. |
| 资助项目 | National Key Research and Development Program of China[2018YFB1800403] ; National Key Research and Development Program of China[2016YFE0121500] ; National Science Foundation of China[61902382] ; National Science Foundation of China[61972381] ; National Science Foundation of China[61672500] ; National Science Foundation of China[61962045] ; National Science Foundation of China[61502255] ; National Science Foundation of China[61650205] ; Strategic Priority Research Program of Chinese Academy of Sciences[XDC02030500] ; Natural Science Foundation of Inner Mongolia Autonomous Region[2017MS(LH)0601] ; Natural Science Foundation of Inner Mongolia Autonomous Region[2018MS06003] ; Science and Technology Planning Project of Inner Mongolia Autonomous Region[2019GG372] ; Key Technologies RD Program of Inner Mongolia Autonomous Region[2020GG0094] ; Science Research Project of Inner Mongolia University of Technology[BS201934] ; Visiting Scholar Project of China Scholarship Council[201908150030] |
| WOS研究方向 | Computer Science ; Engineering ; Telecommunications |
| 语种 | 英语 |
| WOS记录号 | WOS:000640995000001 |
| 出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/16726]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Xu, Zhiwei |
| 作者单位 | 1.Inner Mongolia Univ Technol, Coll Data Sci & Applicat, Hohhot 010080, Peoples R China 2.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China 3.New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA |
| 推荐引用方式 GB/T 7714 | Liu, Wenjing,Xu, Zhiwei,Tian, Jie,et al. Towards In-Network Compact Representation: Mergeable Counting Bloom Filter Vis Cuckoo Scheduling[J]. IEEE ACCESS,2021,9:55329-55339. |
| APA | Liu, Wenjing,Xu, Zhiwei,Tian, Jie,&Zhang, Yujun.(2021).Towards In-Network Compact Representation: Mergeable Counting Bloom Filter Vis Cuckoo Scheduling.IEEE ACCESS,9,55329-55339. |
| MLA | Liu, Wenjing,et al."Towards In-Network Compact Representation: Mergeable Counting Bloom Filter Vis Cuckoo Scheduling".IEEE ACCESS 9(2021):55329-55339. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。