{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:39:46Z","timestamp":1740109186067,"version":"3.37.3"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T00:00:00Z","timestamp":1565654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T00:00:00Z","timestamp":1565654400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Primary Research & Development Plan of China","award":["2016YFB1000304"],"award-info":[{"award-number":["2016YFB1000304"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2014CB340405"],"award-info":[{"award-number":["2014CB340405"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100011930","name":"NSCF","doi-asserted-by":"crossref","award":["61672061"],"award-info":[{"award-number":["61672061"]}],"id":[{"id":"10.13039\/100011930","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00778-019-00560-1","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T07:02:31Z","timestamp":1565679751000},"page":"735-763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast and accurate stream processing by filtering the cold"],"prefix":"10.1007","volume":"28","author":[{"given":"Tong","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1681-4677","authenticated-orcid":false,"given":"Bin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Uhlig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"560_CR1","doi-asserted-by":"crossref","unstructured":"Cormode, G., Johnson, T., Korn, F., Muthukrishnan, S., Spatscheck, O., Srivastava, D.: Holistic UDAFs at streaming speeds. In: Proceedings of ACM SIGMOD, pp 35\u201346 (2004)","DOI":"10.1145\/1007568.1007575"},{"issue":"4","key":"560_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68(4), 415\u2013430 (2009)","journal-title":"Data Knowl. Eng."},{"key":"560_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2078331.2078335","volume":"5","author":"P Zhao","year":"2011","unstructured":"Zhao, P., Aggarwal, C.C., Wang, M.: gSketch: on query estimation in graph streams. Proc. VLDB 5, 193\u2013204 (2011)","journal-title":"Proc. VLDB"},{"key":"560_CR4","doi-asserted-by":"crossref","unstructured":"Roy, P., Khan, A., Alonso, G.: Augmented sketch: faster and more accurate stream processing. In: Proceedings of ACM SIGMOD, pp. 1449\u20131463 (2016)","DOI":"10.1145\/2882903.2882948"},{"key":"560_CR5","unstructured":"Chen, B., Shrivastava, A.: Densified winner take all (WTA) hashing for sparse datasets. In: Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, UAI 2018, Monterey, California, USA, August 6\u201310, 2018, pp. 906\u2013916 (2018)"},{"key":"560_CR6","doi-asserted-by":"crossref","unstructured":"Dobra, A., Garofalakis, M., Gehrke, J., Rastogi, R.: Processing complex aggregate queries over data streams. In: Proceedings of ACM SIGMOD, pp. 61\u201372. ACM (2002)","DOI":"10.1145\/564691.564699"},{"issue":"2","key":"560_CR7","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.14778\/1454159.1454225","volume":"1","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. Proc. VLDB 1(2), 1530\u20131541 (2008)","journal-title":"Proc. VLDB"},{"issue":"1\u20133","key":"560_CR8","first-page":"1","volume":"4","author":"G Cormode","year":"2012","unstructured":"Cormode, G., Garofalakis, M., Haas, P.J., Jermaine, C.: Synopses for massive data: samples, histograms, wavelets, sketches. Found. Trends Databases 4(1\u20133), 1\u2013294 (2012)","journal-title":"Found. Trends Databases"},{"issue":"1","key":"560_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Alg. 55(1), 58\u201375 (2005)","journal-title":"J. Alg."},{"key":"560_CR10","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: International Conference on Database Theory, pp. 398\u2013412. Springer (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"560_CR11","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) Automata, Languages and Programming. Springer, Berlin (2002)"},{"key":"560_CR12","doi-asserted-by":"crossref","unstructured":"Schweller, R., Gupta, A., Parsons, E., Chen, Y.: Reversible sketches for efficient and accurate change detection over network data streams. In: Proceedings of ACM IMC, pp. 207\u2013212. ACM (2004)","DOI":"10.1145\/1028788.1028814"},{"key":"560_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.J.: How to summarize the universe: dynamic maintenance of quantiles. In: Proceedings of VLDB, pp. 454\u2013465. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50047-0"},{"key":"560_CR14","unstructured":"Luo, C., Shrivastava, A.: SSH (sketch, shingle, & hash) for indexing massive-scale time series. In: NIPS 2016 Time Series Workshop, pp. 38\u201358 (2017)"},{"key":"560_CR15","doi-asserted-by":"crossref","unstructured":"Shrivastava, A., Konig, A.C., Bilenko, M.: Time adaptive sketches (ada-sketches) for summarizing data streams. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1417\u20131432. ACM (2016)","DOI":"10.1145\/2882903.2882946"},{"issue":"7","key":"560_CR16","doi-asserted-by":"publisher","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":"560_CR17","doi-asserted-by":"crossref","unstructured":"Garofalakis, M., Gibbons, P.B.: Wavelet synopses with error guarantees. In: Proceedings of ACM SIGMOD, pp. 476\u2013487. ACM (2002)","DOI":"10.1145\/564691.564746"},{"key":"560_CR18","doi-asserted-by":"crossref","unstructured":"Guha, S., Koudas, N., Shim, K.: Data-streams and histograms. In: Proceedings of STOC, pp. 471\u2013475. ACM (2001)","DOI":"10.1145\/380752.380841"},{"key":"560_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-1-84882-765-3_9","volume-title":"Algorithms for Next Generation Networks","author":"A Kirsch","year":"2010","unstructured":"Kirsch, A., Mitzenmacher, M., Varghese, G.: Hash-based techniques for high-speed packet processing. In: Cormode, G., Thottan, M. (eds.) Algorithms for Next Generation Networks, pp. 181\u2013218. Springer, London (2010)"},{"key":"560_CR20","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: A general-purpose counting filter: Making every bit count. In: Proceedings of ACM SIGMOD, pp. 775\u2013787"},{"key":"560_CR21","doi-asserted-by":"crossref","unstructured":"Thomas, D., Bordawekar, R., et al.: On efficient query processing of stream counts on the cell processor. In: Proceedings of IEEE ICDE (2009)","DOI":"10.1109\/ICDE.2009.35"},{"issue":"5","key":"560_CR22","doi-asserted-by":"publisher","first-page":"408","DOI":"10.14778\/2876473.2876476","volume":"9","author":"T Yang","year":"2016","unstructured":"Yang, T., Liu, A.X., Shahzad, M., Zhong, Y., Fu, Q., Li, Z., Xie, G., Li, X.: A shifting bloom filter framework for set queries. Proc. VLDB 9(5), 408\u2013419 (2016)","journal-title":"Proc. VLDB"},{"issue":"11","key":"560_CR23","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.14778\/3137628.3137652","volume":"10","author":"T Yang","year":"2017","unstructured":"Yang, T., Zhou, Y., Jin, H., Chen, S., Li, X.: Pyramid sketch: a sketch framework for frequency estimation of data streams. Proc. VLDB 10(11), 1442\u20131453 (2017)","journal-title":"Proc. VLDB"},{"key":"560_CR24","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, P., Jin, H., Yang, T., Dang, S., Li, X.: One memory access sketh: a more accurate and faster sketch for per-flow measurement. In: IEEE Globecom (2017)","DOI":"10.1109\/GLOCOM.2017.8254741"},{"key":"560_CR25","doi-asserted-by":"crossref","unstructured":"Gong, J., Yang, T., Zhou, Y., Yang, D., Chen, S., Cui, B., Li, X.: Abc: a practicable sketch framework for non-uniform multisets. IEEE Bigdata (2017)","DOI":"10.1109\/BigData.2017.8258193"},{"key":"560_CR26","doi-asserted-by":"crossref","unstructured":"Wang, L., Cai, Z., Wang, H., Jiang, J., Yang, T., Cui, B., Li, X.: Fine-grained probability counting: Refined loglog algorithm. IEEE Bigcomp (2018)","DOI":"10.1109\/BigComp.2018.00034"},{"key":"560_CR27","doi-asserted-by":"crossref","unstructured":"Powers, D.M.: Applications and explanations of Zipf\u2019s law. In Proceedings on EMNLP-CoNLL. Association for Computational Linguistics (1998)","DOI":"10.3115\/1603899.1603924"},{"issue":"5461","key":"560_CR28","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1126\/science.287.5461.2115a","volume":"287","author":"LA Adamic","year":"2000","unstructured":"Adamic, L.A., Huberman, B.A.: Power-law distribution of the world wide web. Science 287(5461), 2115\u20132115 (2000)","journal-title":"Science"},{"key":"560_CR29","unstructured":"Goyal, A., Iii, Daume H., Cormode, G.: Sketch algorithms for estimating point queries in NLP. In: Proceedings of EMNLP (2012)"},{"key":"560_CR30","unstructured":"Mandal, A., Jiang, H., Shrivastava, A., Sarkar, V.: Topkapi: parallel and fast sketches for finding top-k frequent elements. In: Advances in Neural Information Processing Systems, pp. 10898\u201310908 (2018)"},{"issue":"1","key":"560_CR31","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/15427951.2004.10129079","volume":"1","author":"MR Henzinger","year":"2004","unstructured":"Henzinger, M.R.: Algorithmic challenges in web search engines. Internet Math. 1(1), 115\u2013123 (2004)","journal-title":"Internet Math."},{"key":"560_CR32","unstructured":"Li, Y., Miao, R., Kim, C., Yu, M.: Flowradar: a better netflow for data centers. In: Proceedings of USENIX NSDI, pp. 311\u2013324 (2016)"},{"key":"560_CR33","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Invertible bloom lookup tables. In: Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, pp. 792\u2013799. IEEE (2011)","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"560_CR34","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Qiao, Y., Zhen, M., Chen, S.: Estimating the persistent spreads in high-speed networks. In: 2014 IEEE 22nd International Conference on Network Protocols (ICNP), pp. 131\u2013142. IEEE (2014)","DOI":"10.1109\/ICNP.2014.33"},{"issue":"4","key":"560_CR35","doi-asserted-by":"publisher","first-page":"289","DOI":"10.14778\/3025111.3025112","volume":"10","author":"H Dai","year":"2016","unstructured":"Dai, H., Shahzad, M., Liu, A.X., Zhong, Y.: Finding persistent items in data streams. Proc. VLDB Endow. 10(4), 289\u2013300 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"560_CR36","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551\u20132567 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"560_CR37","doi-asserted-by":"crossref","unstructured":"Ganguly, S., Garofalakis, M., Rastogi, R.: Processing data-stream join aggregates using skimmed sketches. In: International Conference on Extending Database Technology, pp. 569\u2013586. Springer (2004)","DOI":"10.1007\/978-3-540-24741-8_33"},{"key":"560_CR38","unstructured":"Source code related to cold filter meta-framework. \n                    https:\/\/github.com\/zhouyangpkuer\/ColdFilter\n                    \n                  . Accessed May 2018"},{"key":"560_CR39","doi-asserted-by":"crossref","unstructured":"Ting, D.: Data sketches for disaggregated subset sum and frequent item estimation. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1129\u20131140. ACM (2018)","DOI":"10.1145\/3183713.3183759"},{"key":"560_CR40","doi-asserted-by":"crossref","unstructured":"Wei, Z., Luo, G., Yi, K., Du, X., Wen, J.-R.: Persistent data sketching. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 795\u2013810. ACM (2015)","DOI":"10.1145\/2723372.2749443"},{"key":"560_CR41","doi-asserted-by":"crossref","unstructured":"Peng, Y., Guo, J., Li, F., Qian, W., Zhou, A.: Persistent bloom filter: membership testing for the entire history. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1037\u20131052. ACM (2018)","DOI":"10.1145\/3183713.3183737"},{"issue":"9","key":"560_CR42","doi-asserted-by":"publisher","first-page":"961","DOI":"10.14778\/3099622.3099627","volume":"10","author":"J Chen","year":"2017","unstructured":"Chen, J., Zhang, Q.: Bias-aware sketches. Proc. VLDB Endow. 10(9), 961\u2013972 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"560_CR43","doi-asserted-by":"crossref","unstructured":"Wei, Z., Liu, X., Li, F., Shang, S., Du, X., Wen, J.-R.: Matrix sketching over sliding windows. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1465\u20131480. ACM (2016)","DOI":"10.1145\/2882903.2915228"},{"key":"560_CR44","doi-asserted-by":"crossref","unstructured":"Agrawal N., Vulimiri, A.: Low-latency analytics on colossal data streams with summarystore. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 647\u2013664. ACM (2017)","DOI":"10.1145\/3132747.3132758"},{"key":"560_CR45","doi-asserted-by":"crossref","unstructured":"Cui, H., Keeton, K., Roy, I., Viswanathan, K., Ganger, G.R.: Using data transformations for low-latency time series analysis. In: Proceedings of the Sixth ACM Symposium on Cloud Computing, pp. 395\u2013407. ACM (2015)","DOI":"10.1145\/2806777.2806839"},{"key":"560_CR46","first-page":"275","volume":"14","author":"A Rabkin","year":"2014","unstructured":"Rabkin, A., Arye, M., Sen, S., Pai, V.S., Freedman, M.J.: Aggregation and degradation in jetstream: streaming analytics in the wide area. NSDI 14, 275\u2013288 (2014)","journal-title":"NSDI"},{"key":"560_CR47","doi-asserted-by":"crossref","unstructured":"Jiang, J., Fu, F., Yang, T., Cui, B.: SketchML: Accelerating distributed machine learning with data sketches. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1269\u20131284. ACM (2018)","DOI":"10.1145\/3183713.3196894"},{"key":"560_CR48","unstructured":"Aghazadeh, A., Spring, R., LeJeune, D., Dasarathy, G., Shrivastava, A., Baraniuk, R.G.: MISSION: ultra large-scale feature selection using count-sketches. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsm\u00e4ssan, Stockholm, Sweden, July 10\u201315, 2018, pp. 80\u201388 (2018)"},{"key":"560_CR49","unstructured":"Shrivastava, A.: Fast and accurate training of 100,000 classes on a single titan x. (Preprint)"},{"key":"560_CR50","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of ACM PODS, pp. 1\u201316. ACM (2002)","DOI":"10.1145\/543613.543615"},{"issue":"2","key":"560_CR51","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S. et\u00a0al.: Data streams: algorithms and applications. Found. Trends\u00ae Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"issue":"4","key":"560_CR52","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/2829988.2787496","volume":"45","author":"C Guo","year":"2015","unstructured":"Guo, C., Yuan, L., Xiang, D., et al.: Pingmesh: a large-scale system for data center network latency measurement and analysis. ACM SIGMCOMM CCR 45(4), 139\u2013152 (2015)","journal-title":"ACM SIGMCOMM CCR"},{"issue":"5","key":"560_CR53","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2829988.2787483","volume":"45","author":"Yibo Zhu","year":"2015","unstructured":"Zhu, Y., Kang, N., Cao, J. et\u00a0al.: Packet-level telemetry in large datacenter networks. In: ACM SIGMCOMM CCR, vol.\u00a045, pp. 479\u2013491. ACM (2015)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"560_CR54","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44676-1_25","volume-title":"Algorithms \u2014 ESA 2001","author":"Rasmus Pagh","year":"2001","unstructured":"Pagh, R., Rodler, F.: Lossy dictionaries. Algorithms\u2014ESA 2001, pp. 300\u2013311 (2001)"},{"key":"560_CR55","unstructured":"Intel SSE2 Documentation. \n                    https:\/\/software.intel.com\/en-us\/node\/683883\n                    \n                  . Accessed May 2018"},{"key":"560_CR56","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Yang, T., Jiang, J., Cui, B., Yu, M., Li, X., Uhlig, S.: Cold filter: a meta-framework for faster and more accurate stream processing. In: Proceedings of SIGMOD (2018)","DOI":"10.1145\/3183713.3183726"},{"issue":"1","key":"560_CR57","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1384529.1375472","volume":"36","author":"Y Lu","year":"2008","unstructured":"Lu, Y., Montanari, A., Prabhakar, B., Dharmapurikar, S., Kabbani, A.: Counter braids: a novel counter architecture for per-flow measurement. ACM Sigmetrics Perform. Eval. Rev. 36(1), 121\u2013132 (2008)","journal-title":"ACM Sigmetrics Perform. Eval. Rev."},{"key":"560_CR58","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of VLDB, pp. 346\u2013357. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"560_CR59","doi-asserted-by":"crossref","unstructured":"Golab, L., DeHaan, D., Demaine, E.D., Lopez-Ortiz, A., Munro, J.I.: Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of ACM IMC, pp. 173\u2013178. ACM (2003)","DOI":"10.1145\/948205.948227"},{"issue":"1","key":"560_CR60","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. (TODS) 28(1), 51\u201355 (2003)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"3","key":"560_CR61","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/00401706.1959.10489860","volume":"1","author":"S Roberts","year":"1959","unstructured":"Roberts, S.: Control chart tests based on geometric moving averages. Technometrics 1(3), 239\u2013250 (1959)","journal-title":"Technometrics"},{"key":"560_CR62","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 189\u2013197. IEEE (2000)"},{"key":"560_CR63","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, B., Sen, S., Zhang, Y., Chen, Y.: Sketch-based change detection: methods, evaluation, and applications. In: Proceedings of ACM IMC, pp. 234\u2013247. ACM (2003)","DOI":"10.1145\/948205.948236"},{"issue":"5","key":"560_CR64","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/TNET.2007.896150","volume":"15","author":"R Schweller","year":"2007","unstructured":"Schweller, R., Li, Z., Chen, Y., et al.: Reversible sketches: enabling monitoring and analysis over high-speed data streams. IEEE\/ACM Trans. Netw. (ToN) 15(5), 1059\u20131072 (2007)","journal-title":"IEEE\/ACM Trans. Netw. (ToN)"},{"issue":"5","key":"560_CR65","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1137\/07069328X","volume":"38","author":"S Guha","year":"2009","unstructured":"Guha, S., McGregor, A.: Stream order and order statistics: quantile estimation in random-order streams. SIAM J. Comput. 38(5), 2044\u20132059 (2009)","journal-title":"SIAM J. Comput."},{"key":"560_CR66","doi-asserted-by":"crossref","unstructured":"Wei, Z., Luo, G., Yi, K., Du, X., Wen, J.-R.: Persistent data sketching. In: Proceedings of ACM SIGMOD, pp. 795\u2013810. ACM (2015)","DOI":"10.1145\/2723372.2749443"},{"key":"560_CR67","unstructured":"The caida anonymized 2016 internet traces. \n                    http:\/\/www.caida.org\/data\/overview\/\n                    \n                  . Accessed May 2018"},{"key":"560_CR68","unstructured":"Real-life transactional dataset. \n                    http:\/\/fimi.ua.ac.be\/data\/\n                    \n                  . Accessed May 2018"},{"issue":"2","key":"560_CR69","first-page":"187","volume":"34","author":"A Rousskov","year":"2004","unstructured":"Rousskov, A., Wessels, D.: High-performance benchmarking with web polygraph. Softw.: Pract. Exp. 34(2), 187\u2013211 (2004)","journal-title":"Softw.: Pract. Exp."},{"key":"560_CR70","unstructured":"Hash website. \n                    http:\/\/burtleburtle.net\/bob\/hash\/evahash.html\n                    \n                  . Accessed May 2018"},{"key":"560_CR71","doi-asserted-by":"crossref","unstructured":"Ji, M., Yan, J., Gu, S., Han, J., He, X., Zhang, W.V., Chen, Z.: Learning search tasks in queries and web pages via graph regularization. In: Proceedings of ACM SIGIR, pp. 55\u201364. ACM (2011)","DOI":"10.1145\/2009916.2009928"},{"key":"560_CR72","unstructured":"Goyal, A., Daume Iii, H., Cormode, G.: Sketch algorithms for estimating point queries in NLP. In: EMNLP-CoNLL, pp. 1093\u20131103 (2012)"},{"key":"560_CR73","unstructured":"Qiao, Y., Li, T., Chen, S.: One memory access bloom filters and their generalization. In: INFOCOM, 2011 Proceedings IEEE, pp. 1745\u20131753. IEEE (2011)"},{"key":"560_CR74","doi-asserted-by":"crossref","unstructured":"Roy, P., Teubner, J., Alonso, G.: Efficient frequent item counting in multi-core hardware. In: ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2012)","DOI":"10.1145\/2339530.2339757"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00560-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00560-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00560-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T23:07:11Z","timestamp":1597187231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00560-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,13]]},"references-count":74,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["560"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00560-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2019,8,13]]},"assertion":[{"value":"26 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}