Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20720
Title: Using parallel bloom filters for multiattribute representation on network services
Authors: Xiao, B 
Hua, Y
Keywords: Data structure
False positives
Network services
Parallel Bloom filters
Issue Date: 2010
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on parallel and distributed systems, 2010, v. 21, no. 1, 4798158, p. 20-32 How to cite?
Journal: IEEE transactions on parallel and distributed systems 
Abstract: One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are not entirely suitable for many new network applications that support network services like the representation and querying of items that have multiple attributes as opposed to a single attribute. In this paper, we present an approach to the accurate and efficient representation and querying of multiattribute items using Bloom filters. The approach proposes three variant structures of Bloom filters: Parallel Bloom Filter (referred as PBF) structure, PBF with a hash table (PBF-HT), and PBF with a Bloom filter (PBF-BF). PBF stores multiple attributes of an item in parallel Bloom filters. The auxiliary HT and BF provide functions to capture the inherent dependency of all attributes of an item. Compared to standard Bloom filters to represent items with multiple attributes, the proposed PBF facilitates much faster query service and both PBF-HT and PBF-BF structures achieve much lower false positive probability with a result to save storage space. Simulation and experimental results demonstrate that the new space-efficient Bloom filter structures can efficiently and accurately represent multiattribute items and quickly respond queries at the cost of a relatively small false positive probability.
URI: http://hdl.handle.net/10397/20720
ISSN: 1045-9219
EISSN: 1558-2183
DOI: 10.1109/TPDS.2009.39
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

34
Last Week
0
Last month
0
Citations as of Oct 6, 2018

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
0
Citations as of Oct 16, 2018

Page view(s)

67
Last Week
0
Last month
Citations as of Oct 15, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.