Abstract

In computing, duplicate data detection refers to identifying duplicate copies of repeating data. Identifying duplicate data items in streamed data and eliminating them before storing, is a complex job. This paper proposes a novel data structure for duplicate detection using a variant of stable Bloom filter named as FingerPrint Stable Bloom Filter (FP-SBF). The proposed approach uses counting Bloom filter with fingerprint bits along with an optimization mechanism for duplicate detection. FP-SBF uses d-left hashing which reduces the computational time and decreases the false positives as well as false negatives. FP-SBF can process unbounded data in single pass, using k hash functions, and successfully differentiate between duplicate and distinct elements in O(k + 1) time, independent of the size of incoming data. The performance of FP-SBF has been compared with various Bloom Filters used for stream data duplication detection and it has been theoretically and experimentally proved that the proposed approach efficiently detects the duplicates in streaming data with less memory requirements.

Keywords

Cite this article

@article{cai-3974,
  author  = {Amritpal Singh and Shalini Batra},
  title   = {FingerPrint Based Duplicate Detection in Streamed Data},
  journal = {Computing and Informatics},
  volume  = {37},
  number  = {6},
  pages   = {1313--1338},
  year    = {2018},
  issn    = {1335-9150},
  doi     = {10.4149/cai_2018_6_1313}
}
Download .bib