An improved algorithm based on Bloom filter and its application in bar code recognition and processing

In many cases, databases are incompetent to meet the requirement of the quick query identification and processing of bar codes, such as the automatic sorting system of giant logistics warehouse. Bloom filter can be faster than databases, but its high false positive rate may seriously affect the efficiency of work. Although increasing the width of bit vector and the number of hash functions can reduce the false positive rate, the effect will be not significant after a certain threshold value, and this approach will increase the cost of processing time. So, it could not be increased indefinitely. This paper presents an improved algorithm based on Bloom filter and its application in bar code recognition and processing. The bit vector of Bloom filter is divided into two parts. Every element ai could be mapped to a part of the bit vector by some hash functions. For each element to amplify the difference by g (), which makes g (ai) = a*i, the a*i is mapped to another part of the bit vector by some hash functions too. This algorithm can significantly reduce the false positive rate of the Bloom filter, but does not increase much time and space costs.

[1]  Ben Y. Zhao,et al.  The Ninja architecture for robust Internet-scale systems and services , 2001, Comput. Networks.

[2]  Pantelis A. Frangoudis,et al.  A Bloom-Filter-based socially aware scheme for content replication in mobile ad hoc networks , 2016, 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[3]  Ekram Hossain,et al.  Discovering Mobile Applications in Cellular Device-to-Device Communications: Hash Function and Bloom Filter-Based Approach , 2016, IEEE Transactions on Mobile Computing.

[4]  Anoop Gupta,et al.  Proceedings of the ninth international conference on Architectural support for programming languages and operating systems , 2000, ASPLOS 2000.

[5]  Hyesook Lim,et al.  New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms , 2016, IEEE Transactions on Computers.

[6]  Darya Filippova,et al.  Improving Bloom Filter Performance on Sequence Data Using k -mer Bloom Filters , 2016, RECOMB.

[7]  James K. Mullin,et al.  A second look at bloom filters , 1983, CACM.

[8]  David E. Culler,et al.  Scalable, distributed data structures for internet service construction , 2000, OSDI.

[9]  Jerome Swartz,et al.  Fundamentals of bar code information theory , 1990, Computer.

[10]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[11]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[12]  Mai Jiang,et al.  A modified algorithm based on the Bloom Filter , 2013, 2013 6th International Congress on Image and Signal Processing (CISP).

[13]  Hyesook Lim,et al.  Ternary Bloom Filter Replacing Counting Bloom Filter , 2017, IEEE Communications Letters.

[14]  M. V. Ramakrishna,et al.  Practical performance of Bloom filters and parallel free-text searching , 1989, CACM.

[15]  Li Fan,et al.  Summary cache: a scalable wide-area Web cache sharing protocol , 1998, SIGCOMM '98.

[16]  Huahui Chen,et al.  Integer-Granularity Locality-Sensitive Bloom Filter , 2016, IEEE Communications Letters.

[17]  Sangheon Pack,et al.  Timer-Based Bloom Filter Aggregation for Reducing Signaling Overhead in Distributed Mobility Management , 2016, IEEE Transactions on Mobile Computing.

[18]  Ben Y. Zhao,et al.  An Architecture for Secure Wide-Area Service Discovery , 2002, Wirel. Networks.

[19]  Xiaonian Wang,et al.  Design of a Multiple Bloom Filter for Distributed Navigation Routing , 2014, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[20]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[21]  Wing Shing Wong,et al.  A hybrid Bloom filter location update algorithm for wireless cellular systems , 1997, Proceedings of ICC'97 - International Conference on Communications.