{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:38:38Z","timestamp":1779385118808,"version":"3.53.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T00:00:00Z","timestamp":1722211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U20A20179"],"award-info":[{"award-number":["U20A20179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61832001"],"award-info":[{"award-number":["61832001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key-Area Research and Development Program of Guangdong Province","award":["2020B0101390001"],"award-info":[{"award-number":["2020B0101390001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00778-024-00869-6","type":"journal-article","created":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T05:01:53Z","timestamp":1722229313000},"page":"1697-1722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["WavingSketch: an unbiased and generic sketch for finding top-k items in data streams"],"prefix":"10.1007","volume":"33","author":[{"given":"Zirui","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fenghao","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengwu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangwei","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yikai","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jizhou","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,29]]},"reference":[{"key":"869_CR1","unstructured":"Lukasz, G., David, D., D, D.E., Alejandro, L., Ian, M.J.: Identifying frequent items in sliding windows over on-line packet streams. In: IMC. ACM, (2003)"},{"issue":"1","key":"869_CR2","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. 28(1), 51\u201355 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"869_CR3","unstructured":"Nishad, M., Themis, P.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng., (2009)"},{"key":"869_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Finding frequent items in data streams","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Languages and Programming. Springer, In Automata (2002)"},{"key":"869_CR5","doi-asserted-by":"crossref","unstructured":"Wei, Z., Luo, G., Yi, K., Du, X., Wen, J.-R.: Persistent data sketching. In: Proc. ACM SIGMOD, pp. 795\u2013810. ACM, (2015)","DOI":"10.1145\/2723372.2749443"},{"issue":"5","key":"869_CR6","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. 15(5), 1059\u20131072 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"869_CR7","doi-asserted-by":"crossref","unstructured":"Balachander, K., Subhabrata, S., Yin, Z., Yan, C.: Sketch-based change detection: methods, evaluation, and applications. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 234\u2013247. ACM, (2003)","DOI":"10.1145\/948205.948236"},{"key":"869_CR8","unstructured":"Li, Y., Miao, R., Kim, C., Yu, M.: Flowradar: a better netflow for data centers. In: USENIX NSDI, pp. 311\u2013324. USENIX Association, (2016)"},{"issue":"4","key":"869_CR9","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."},{"key":"869_CR10","doi-asserted-by":"crossref","unstructured":"Venkataraman, S., Song, D.X., Gibbons, P.B., Blum, A.: New streaming algorithms for fast detection of superspreaders. In: NDSS, (2005)","DOI":"10.21236\/ADA461026"},{"issue":"1","key":"869_CR11","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. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"869_CR12","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. ACM SIGMCOMM CCR, 32(4), (2002)","DOI":"10.1145\/964725.633056"},{"key":"869_CR13","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El\u00a0Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: International Conference on Database Theory. Springer, (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"869_CR14","doi-asserted-by":"crossref","unstructured":"Singh, M.G., Rajeev, M.: Approximate frequency counts over data streams. In: Proc. VLDB, pp. 346\u2013357, (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"869_CR15","doi-asserted-by":"crossref","unstructured":"Ting, D.: Data sketches for disaggregated subset sum and frequent item estimation. In: SIGMOD Conference, (2018)","DOI":"10.1145\/3183713.3183759"},{"key":"869_CR16","unstructured":"Pratanu, R., Arijit, K., Gustavo, A.: Augmented sketch: Faster and more accurate stream processing. In: Proc, ACM SIGMOD (2016)"},{"issue":"10","key":"869_CR17","doi-asserted-by":"publisher","first-page":"1898","DOI":"10.1109\/TKDE.2018.2867468","volume":"31","author":"D Yang","year":"2018","unstructured":"Yang, D., Li, B., Rettig, L., Cudr\u00e9-Mauroux, P.: $$\\text{ D}^{22}$$ histosketch: discriminative and dynamic similarity-preserving sketching of streaming histograms. IEEE Trans. Knowl. Data Eng. 31(10), 1898\u20131911 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"869_CR18","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1109\/TKDE.2017.2734661","volume":"29","author":"T Buddhika","year":"2017","unstructured":"Buddhika, T., Malensek, M., Pallickara, S.L., Pallickara, S.: Synopsis: A distributed sketch over voluminous spatiotemporal observational streams. IEEE Trans. Knowl. Data Eng. 29(11), 2552\u20132566 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"869_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, B., Li, X., Tian, B., Mei, Z., Wu, W.: Dhs: Adaptive memory layout organization of sketch slots for fast and accurate data stream processing. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 2285\u20132293, (2021)","DOI":"10.1145\/3447548.3467353"},{"issue":"2","key":"869_CR20","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 Endow. 1(2), 1530\u20131541 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"869_CR21","doi-asserted-by":"crossref","unstructured":"Yang, T., Gong, J., Zhang, H., Zou, L., Shi, L., Li. X.: Heavyguardian: Separate and guard hot items in data streams. In: SIGKDD, (2018)","DOI":"10.1145\/3219819.3219978"},{"key":"869_CR22","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: SIGMOD Conference, (2018)","DOI":"10.1145\/3183713.3183726"},{"key":"869_CR23","doi-asserted-by":"crossref","unstructured":"Huang, Q., Lee, P.P.: Ld-sketch: A distributed sketching design for accurate and scalable anomaly detection in network data streams. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, pp. 1420\u20131428. IEEE, (2014)","DOI":"10.1109\/INFOCOM.2014.6848076"},{"issue":"6","key":"869_CR24","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":"869_CR25","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1002\/sam.11214","volume":"7","author":"B Lahiri","year":"2011","unstructured":"Lahiri, B., Chandrashekar, J., Tirthapura, S.: Space-efficient tracking of persistent items in a massive data stream. Stat. Anal. Data Mining 7, 70\u201392 (2011)","journal-title":"Stat. Anal. Data Mining"},{"issue":"2","key":"869_CR26","doi-asserted-by":"publisher","first-page":"128","DOI":"10.14778\/3425879.3425884","volume":"14","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Li, J., Lei, Y., Yang, T., Li, Z., Zhang, G., Cui, B.: On-off sketch: a fast and accurate sketch on persistence. Proc. VLDB Endow. 14(2), 128\u2013140 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"869_CR27","unstructured":"Yu, M., Jose, L., Miao, R.: Software defined traffic measurement with opensketch. In: NSDI 2013, (2013)"},{"key":"869_CR28","doi-asserted-by":"crossref","unstructured":"Tang, L., Huang, Q., Lee, P.P.: Spreadsketch: Toward invertible and network-wide detection of superspreaders. In: IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pp. 1608\u20131617. IEEE, (2020)","DOI":"10.1109\/INFOCOM41043.2020.9155541"},{"key":"869_CR29","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high speed links. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 153\u2013166, (2003)","DOI":"10.1145\/948205.948225"},{"issue":"1","key":"869_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588933","volume":"1","author":"Y Zhao","year":"2023","unstructured":"Zhao, Y., Han, W., Zhong, Z., Zhang, Y., Yang, T., Cui, B.: Double-anonymous sketch: achieving top-k-fairness for finding global top-k frequent items. Proc. ACM Manag. Data 1(1), 1\u201326 (2023)","journal-title":"Proc. ACM Manag. Data"},{"issue":"1","key":"869_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588935","volume":"1","author":"F Wang","year":"2023","unstructured":"Wang, F., Chen, Q., Li, Y., Yang, T., Tu, Y., Yu, L., Cui, B.: Joinsketch: a sketch algorithm for accurate and unbiased inner-product estimation. Proc. ACM Manag. Data 1(1), 1\u201326 (2023)","journal-title":"Proc. ACM Manag. Data"},{"key":"869_CR32","unstructured":"Cormode, G., Garofalakis, M.: Sketching streams through the net: Distributed approximate query tracking. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 13\u201324, (2005)"},{"key":"869_CR33","doi-asserted-by":"crossref","unstructured":"Liu, Z., Manousis, A., Vorsanger, G., Sekar, V., Braverman, V.: One sketch to rule them all: Rethinking network flow monitoring with univmon. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 101\u2013114, (2016)","DOI":"10.1145\/2934872.2934906"},{"key":"869_CR34","doi-asserted-by":"crossref","unstructured":"Miao, R., Zhang, Y., Qu, G., Yang, K., Yang, T., Cui, B.: Hyper-uss: Answering subset query over multi-attribute data stream. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1698\u20131709, (2023)","DOI":"10.1145\/3580305.3599383"},{"key":"869_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, Z., Wang, R., Yang, T., Li, J., Miao, R., Liu, P., Zhang, R., Jiang J.: Cocosketch: High-performance sketch-based measurement over arbitrary partial key query. In: Proceedings of the 2021 ACM SIGCOMM 2021 Conference, pp. 207\u2013222, (2021)","DOI":"10.1145\/3452296.3472892"},{"key":"869_CR36","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T., Hares, S.: A border gateway protocol 4 (bgp-4). Technical report, (2006)","DOI":"10.17487\/rfc4271"},{"key":"869_CR37","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.L.: Network routing with path vector protocols: Theory and applications. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 49\u201360, (2003)","DOI":"10.1145\/863955.863963"},{"issue":"4","key":"869_CR38","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/964723.383061","volume":"31","author":"K Park","year":"2001","unstructured":"Park, K., Lee, H.: On the effectiveness of route-based packet filtering for distributed dos attack prevention in power-law internets. ACM SIGCOMM Comput. Commun. Rev. 31(4), 15\u201326 (2001)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"869_CR39","unstructured":"Murmur hashing source codes. https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp"},{"key":"869_CR40","doi-asserted-by":"crossref","unstructured":"Yang, T., Jiang, J., Liu, P., Huang, Q., Gong, J., Zhou, Y., Miao, R., Li, X., Uhlig, S.: Elastic sketch: Adaptive and fast network-wide measurements. In: ACM SIGCOMM, vol. 2018, pp. 561\u2013575 (2018)","DOI":"10.1145\/3230543.3230544"},{"key":"869_CR41","doi-asserted-by":"crossref","unstructured":"Kim, W., Yun, J., Jung, H.: Evaluation of high-frequency financial transaction processing in distributed memory systems. In: Proceedings of the 2014 Conference on Research in Adaptive and Convergent Systems, pp. 362\u2013364, (2014)","DOI":"10.1145\/2663761.2664234"},{"key":"869_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, H., Liu, Z., Chen, B., Zhao, Y., Zhao, T., Yang, T., Cui, B.: Cafe: Towards compact, adaptive, and fast embedding for large-scale recommendation models. In: Proceedings of the 2024 ACM International Conference on Management of Data (SIGMOD), (2024)","DOI":"10.1145\/3639306"},{"key":"869_CR43","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TC.1972.5009071","volume":"100","author":"M Flynn","year":"1972","unstructured":"Flynn, M.: Some computer organizations and their effectiveness. IEEE Trans. Comput. 100, 948\u2013960 (1972)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"869_CR44","first-page":"1","volume":"1","author":"Y Li","year":"2023","unstructured":"Li, Y., Wang, F., Yu, X., Yang, Y., Yang, K., Yang, T., Ma, Z., Cui, B., Uhlig, S.: Ladderfilter: Filtering infrequent items with small memory and time overhead. Proc. ACM Manag. Data 1(1), 1\u201321 (2023)","journal-title":"Proc. ACM Manag. Data"},{"key":"869_CR45","doi-asserted-by":"crossref","unstructured":"Liu, Z., Kong, C., Yang, K., Yang, T., Miao, R., Chen, Q., Zhao, Y., Tu, Y., Cui B.: Hypercalm sketch: One-pass mining periodic batches in data streams. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, (2023)","DOI":"10.1109\/ICDE55515.2023.00009"},{"key":"869_CR46","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 the 2018 international conference on management of data, pp. 741\u2013756, (2018)","DOI":"10.1145\/3183713.3183726"},{"key":"869_CR47","unstructured":"Supplementary materials of wavingsketch. https:\/\/github.com\/WavingSketch\/Waving-Sketch\/blob\/master\/WavingSketch_Supplementary.pdf"},{"key":"869_CR48","doi-asserted-by":"crossref","unstructured":"Li, J., Li, Z., Xu, Y., Jiang, S., Yang, T., Cui, B., Dai, Y., Zhang, G.: Wavingsketch: An unbiased and generic sketch for finding top-k items in data streams. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1574\u20131584, (2020)","DOI":"10.1145\/3394486.3403208"},{"key":"869_CR49","doi-asserted-by":"crossref","unstructured":"Powers, D.M.: Applications and explanations of Zipf\u2019s law. In: Proc. EMNLP-CoNLL, Association for Computational Linguistics (1998)","DOI":"10.3115\/1603899.1603924"},{"issue":"7","key":"869_CR50","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"},{"issue":"3","key":"869_CR51","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB Endow. 9(3), 204\u2013215 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"869_CR52","doi-asserted-by":"crossref","unstructured":"Izenov, Y., Datta, A., Rusu, F., Shin, J.H.: Compass: Online sketch-based query optimization for in-memory databases. In: Proceedings of the 2021 International Conference on Management of Data, pp. 804\u2013816, (2021)","DOI":"10.1145\/3448016.3452840"},{"issue":"5","key":"869_CR53","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2018","unstructured":"Leis, V., Radke, B., Gubichev, A., Mirchev, A., Boncz, P., Kemper, A., Neumann, T.: Query optimization through the looking glass, and what we found running the join order benchmark. VLDB J. 27(5), 643\u2013668 (2018)","journal-title":"VLDB J."},{"key":"869_CR54","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yi, K.: Secure yannakakis: Join-aggregate queries over private data. In: Proceedings of the 2021 International Conference on Management of Data, pp. 1969\u20131981, (2021)","DOI":"10.1145\/3448016.3452808"},{"key":"869_CR55","doi-asserted-by":"crossref","unstructured":"Kutzkov, K., Ahmed, M., Nikitaki, S.: Weighted similarity estimation in data streams. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pp. 1051\u20131060, (2015)","DOI":"10.1145\/2806416.2806515"},{"key":"869_CR56","first-page":"19920","volume":"33","author":"G Pruthi","year":"2020","unstructured":"Pruthi, G., Liu, F., Kale, S., Sundararajan, M.: Estimating training data influence by tracing gradient descent. Adv. Neural. Inf. Process. Syst. 33, 19920\u201319930 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"869_CR57","doi-asserted-by":"crossref","unstructured":"Alon, N., Gibbons, P.B., Matias, Y., Szegedy, M.: Tracking join and self-join sizes in limited storage. In Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems 10\u201320 (1999)","DOI":"10.1145\/303976.303978"},{"key":"869_CR58","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":"869_CR59","doi-asserted-by":"crossref","unstructured":"Ganguly, S., Kesh, D., Saha, C.: Practical algorithms for tracking database join sizes. In: International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 297\u2013309. Springer, (2005)","DOI":"10.1007\/11590156_24"},{"issue":"3","key":"869_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1386118.1386121","volume":"33","author":"F Rusu","year":"2008","unstructured":"Rusu, F., Dobra, A.: Sketches for size of join estimation. ACM Trans. Database Syst. 33(3), 1\u201346 (2008)","journal-title":"ACM Trans. Database Syst."},{"key":"869_CR61","doi-asserted-by":"crossref","unstructured":"Rusu, F., Dobra, A.: Statistical analysis of sketch estimators. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 187\u2013198, (2007)","DOI":"10.1145\/1247480.1247503"},{"key":"869_CR62","doi-asserted-by":"crossref","unstructured":"Cai, W., Balazinska, M., Suciu, D.: Pessimistic cardinality estimation: Tighter upper bounds for intermediate join cardinalities. In: Proceedings of the 2019 International Conference on Management of Data, pp. 18\u201335, (2019)","DOI":"10.1145\/3299869.3319894"},{"key":"869_CR63","unstructured":"CAIDA [online]. Available: http:\/\/www.caida.org\/home"},{"key":"869_CR64","unstructured":"Real-life transactional dataset. http:\/\/fimi.ua.ac.be\/data\/"},{"key":"869_CR65","unstructured":"The Network dataset Internet Traces. http:\/\/snap.stanford.edu\/data\/"},{"key":"869_CR66","doi-asserted-by":"publisher","DOI":"10.1002\/spe.576","volume-title":"High-performance benchmarking with web polygraph","author":"A Rousskov","year":"2004","unstructured":"Rousskov, A., Wessels, D.: High-performance benchmarking with web polygraph. Practice and Experience, Software (2004)"},{"key":"869_CR67","unstructured":"Carbone, P., Katsifodimos, A., Ewen, S., Markl, V., Haridi, S., Tzoumas, K.: Apache flink: Stream and batch processing in a single engine. Bull. IEEE Comput. Soc. Tech. Committee Data Eng., 36(4), (2015)"},{"key":"869_CR68","unstructured":"Source code related to WavingSketch.. https:\/\/github.com\/WavingSketch\/Waving-Sketch"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00869-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00869-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00869-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T12:09:45Z","timestamp":1723896585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00869-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,29]]},"references-count":68,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["869"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00869-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,29]]},"assertion":[{"value":"21 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}