{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:56:29Z","timestamp":1725861389984},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319425528"},{"type":"electronic","value":"9783319425535"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42553-5_8","type":"book-chapter","created":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T11:42:23Z","timestamp":1468842143000},"page":"88-98","source":"Crossref","is-referenced-by-count":0,"title":["A Compact In-memory Index for Managing Set Membership Queries on Streaming Data"],"prefix":"10.1007","author":[{"given":"Yong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaochun","family":"Yun","sequence":"additional","affiliation":[]},{"given":"Shupeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1038\/455028a","volume":"455","author":"C Lynch","year":"2008","unstructured":"Lynch, C.: Big data: how do your data grow? Nature 455, 28\u201329 (2008)","journal-title":"Nature"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2493175.2493178","volume":"31","author":"N Asadi","year":"2013","unstructured":"Asadi, N., Lin, J.: Fast candidate generation for real-time tweet search with bloom filter chains. ACM Trans. Inf. Syst. (TOIS) 31, 13 (2013). ACM","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bhoraskar, R., Gabale, V., Kulkarni, P., et al.: Importance-aware bloom filter for managing set membership queries on streaming data. In: 5th International Conference on Communication Systems and Networks (COMSNETS), pp. 1\u201310. IEEE (2013)","DOI":"10.1109\/COMSNETS.2013.6465564"},{"issue":"4","key":"8_CR4","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1145\/285243.285287","volume":"28","author":"L Fan","year":"1998","unstructured":"Fan, L., Cao, P., Almeida, J., et al.: A scalable wide-area web cache sharing protocol. ACM SIGCOMM Comput. Commun. Rev. 28(4), 254\u2013265 (1998)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"7","key":"8_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"8_CR6","first-page":"1","volume":"2016","author":"J Jin","year":"2016","unstructured":"Jin, J., Ahn, S., Oh, H.: A multipath routing protocol based on bloom filter for multi-hop wireless networks. Mob. Inf. Syst. 2016, 1\u201310 (2016)","journal-title":"Mob. Inf. Syst."},{"issue":"5","key":"8_CR7","doi-asserted-by":"crossref","first-page":"408","DOI":"10.14778\/2876473.2876476","volume":"9","author":"T Yang","year":"2015","unstructured":"Yang, T., Liu, A.X., Shahzad, M., et al.: A shifting bloom filter framework for set queries. Proc. VLDB Endow. 9(5), 408\u2013419 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"8_CR8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIFS.2015.2503269","volume":"11","author":"W Liu","year":"2016","unstructured":"Liu, W., Qu, W., Gong, J., et al.: Detection of superpoints using a vector bloom filter. IEEE Trans. Inf. Forensics Secur. 11(3), 514\u2013527 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using stable bloom filters. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 25\u201336. ACM (2006)","DOI":"10.1145\/1142473.1142477"},{"issue":"6","key":"8_CR10","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1007\/s11390-008-9192-1","volume":"23","author":"H Shen","year":"2008","unstructured":"Shen, H., Zhang, Y.: Improved approximate detection of duplicates for data streams over sliding windows. J. Comput. Sci. Technol. 23(6), 973\u2013987 (2008)","journal-title":"J. Comput. Sci. Technol."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Guo, D., Wu, J., Chen, H., et al.: Theory and network applications of dynamic bloom filters. In: INFOCOM, pp. 1\u201312. IEEE (2006)","DOI":"10.1109\/INFOCOM.2006.325"},{"issue":"3","key":"8_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2493175.2493178","volume":"31","author":"N Asadi","year":"2013","unstructured":"Asadi, N., Lin, J.: Fast candidate generation for real-time tweet search with bloom filter chains. ACM Trans. Inf. Syst. (TOIS) 31(3), 13 (2013)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"issue":"4","key":"8_CR13","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/TNET.2002.801399","volume":"10","author":"W Feng","year":"2002","unstructured":"Feng, W., Shin, K.G., Kandlur, D.D., et al.: The BLUE active queue management algorithms. IEEE\/ACM Trans. Netw. (ToN) 10(4), 513\u2013528 (2002)","journal-title":"IEEE\/ACM Trans. Netw. (ToN)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/TKDE.2009.136","volume":"22","author":"MK Yoon","year":"2010","unstructured":"Yoon, M.K.: Aging bloom filter with two active buffers for dynamic sets. IEEE Trans. Knowl. Data Eng. 22(1), 134\u2013138 (2010). IEEE","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"8_CR15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s11633-012-0630-8","volume":"9","author":"HS Hu","year":"2012","unstructured":"Hu, H.S., Zhao, H.W., Mi, F.: L-priorities bloom filter: a new member of the bloom filter family. Int. J. Autom. Comput. 9(2), 171\u2013176 (2012)","journal-title":"Int. J. Autom. Comput."}],"container-title":["Lecture Notes in Computer Science","Big Data Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42553-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T09:32:16Z","timestamp":1568194336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42553-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319425528","9783319425535"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42553-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}