Abstract
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 filter. With the d-left hashing, a balanced allocation mechanism, DLTBF can store the detected time of an element into one counter. Then we propose an one-pass approximate method to remove duplicates in RFID data streams based on DLTBF. In an RFID data stream, suppose that the detected time of an element is T-bit, i.e., T bits are required to store the detected time of an element in RFID data streams, the number of non-duplicate elements within a time length of τ is W and the probability that a non-duplicate element is taken to be a duplicate by our method is ε (the false positive probability), then the number of bits used by our method is O(Wlog2 (1/ε) + WT). Experimental results on the synthetic data verify the effectiveness of our method.
This work is supported in part by Natural Science Foundation of Anhui Province (1408085QF128) and NII International Internship Program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Han, J.: A survey of rfid data processing. In: Managing and Mining Sensor Data, pp. 349–382. Springer (2013)
Bai, Y., Wang, F., Liu, P.: Efficiently filtering rfid data streams. In: CleanDB Workshop, pp. 50–57 (2006)
Bleco, D., Kotidis, Y.: RFID data aggregation. In: Trigoni, N., Markham, A., Nawaz, S. (eds.) GSN 2009. LNCS, vol. 5659, pp. 87–101. Springer, Heidelberg (2009)
Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684–695. Springer, Heidelberg (2006)
Broder, A., Mitzenmacher, M.: Using multiple hash functions to improve ip lookups. In: Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2001, vol. 3, pp. 1454–1463. IEEE (2001)
Chen, H., Ku, W.S., Wang, H., Sun, M.T.: Leveraging spatio-temporal redundancy for rfid data cleansing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 51–62. ACM (2010)
Dautrich Jr., J.L., Ravishankar, C.V.: Inferential time-decaying bloom filters. In: Proceedings of the 16th International Conference on Extending Database Technology, pp. 239–250. ACM (2013)
Dutta, S., Narang, A., Bera, S.K.: Streaming quotient filter: a near optimal approximate duplicate detection approach for data streams. Proceedings of the VLDB Endowment 6(8), 589–600 (2013)
Fazzinga, B., Flesca, S., Furfaro, F., Parisi, F.: Cleaning trajectory data of rfid-monitored objects through conditioning under integrity constraints. In: EDBT, pp. 379–390 (2014)
Jeffery, S.R., Garofalakis, M., Franklin, M.J.: Adaptive cleaning for rfid data streams. In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB Endowment, pp. 163–174 (2006)
Jiang, W., Wang, Y., Zhang, G.: A two-layer duplicate filtering approach for RFID data streams. In: Wang, Y., Zhang, X. (eds.) IOT 2012. CCIS, vol. 312, pp. 226–233. Springer, Heidelberg (2012)
Ku, W.S., Chen, H., Wang, H., Sun, M.T.: A bayesian inference-based framework for rfid data cleansing. IEEE Transactions on Knowledge and Data Engineering 25(10), 2177–2191 (2013)
Lee, C.H., Chung, C.W.: An approximate duplicate elimination in rfid data streams. Data & Knowledge Engineering 70(12), 1070–1087 (2011)
Martínez-Sala, A.S., Egea-López, E., García-Sánchez, F., García-Haro, J.: Tracking of returnable packaging and transport units with active rfid in the grocery supply chain. Computers in Industry 60(3), 161–171 (2009)
Vöcking, B.: How asymmetry helps load balancing. Journal of the ACM (JACM) 50(4), 568–589 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, X., Ji, Y., Zhao, B. (2014). An Approximate Duplicate-Elimination in RFID Data Streams Based on d-Left Time Bloom Filter. In: Chen, L., Jia, Y., Sellis, T., Liu, G. (eds) Web Technologies and Applications. APWeb 2014. Lecture Notes in Computer Science, vol 8709. Springer, Cham. https://doi.org/10.1007/978-3-319-11116-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-11116-2_36
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11115-5
Online ISBN: 978-3-319-11116-2
eBook Packages: Computer ScienceComputer Science (R0)