A distributed algorithm for finding global icebergs with linked counting Bloom filters
Date
2008-05
Authors
Wu, Kui
Xiao, Yang
Li, Jie
Sun, Bo
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Abstract
Icebergs denote data items whose total frequency of occurrence is greater than a given threshold. When data items are scattered across a large number of network nodes, searching for global icebergs becomes a challenging task especially in bandwidth limited wireless networks. Existing solutions require a central server for ease of algorithm design and/or use random sampling to reduce bandwidth cost. In this paper, we present a new distributed algorithm to search for global icebergs without any centralized control or random sampling. A new type of Bloom filter, called linked counting Bloom filter, is designed to check the membership of a set and to store the accumulative frequency of data items. We evaluate the performance of our distributed algorithm with real data sets.
Description
©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords
Citation
Kui Wu; Yang Xiao; Jie Li; Bo Sun; , "A Distributed Algorithm for Finding Global Icebergs with Linked Counting Bloom Filters," Communications, 2008. ICC '08. IEEE International Conference on , vol., no., pp.2757-2761, 19-23 May 2008