An Approximate Duplicate-Elimination in RFID Data Streams Based on d-Left Time Bloom Filter

@inproceedings{Wang2014AnAD,
  title={An Approximate Duplicate-Elimination in RFID Data Streams Based on d-Left Time Bloom Filter},
  author={Xiujun Wang and Yusheng Ji and Baohua Zhao},
  booktitle={APWeb},
  year={2014}
}
There are a larger number of duplicates in RFID data streams, due to the multiple readings of an RFID tag by one RFID reader or by some RFID readers deployed to the same region in an RFID based system. Existing duplicate-elimination methods based on Time Bloom filter (TBF) require multiple counters to store the detected time of an element in RFID data streams, thus waste valuable memory resources. In this paper, we devise d-left Time Bloom filter (DLTBF) as an extension of d-left Counting Bloom… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.

Filtering Redundant Data from RFID Data Streams

VIEW 7 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED