{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:46:19Z","timestamp":1777873579733,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","funder":[{"name":"National Key R&D Program of China","award":["2024YFB2906603"],"award-info":[{"award-number":["2024YFB2906603"]}]},{"name":"Beijing Natural Science Foundation","award":["QY23043"],"award-info":[{"award-number":["QY23043"]}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372009"],"award-info":[{"award-number":["62372009"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3737044","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:07:39Z","timestamp":1754255259000},"page":"1963-1974","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Measuring Item Freshness in Data Streams"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9062-6565","authenticated-orcid":false,"given":"Zirui","family":"Liu","sequence":"first","affiliation":[{"name":"National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1160-1058","authenticated-orcid":false,"given":"Zihan","family":"Jiang","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1961-4372","authenticated-orcid":false,"given":"An","family":"Zhang","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6668-2822","authenticated-orcid":false,"given":"Zhouran","family":"Shi","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5474-9156","authenticated-orcid":false,"given":"Yuxuan","family":"Tian","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ringsketch codes. https:\/\/github.com\/RingSketch\/RingSketch."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522981"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_4_1","first-page":"398","volume-title":"ICDT 2005","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and top-k elements in data streams. In ICDT 2005, pages 398-412. Springer, 2005."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461553"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588937"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/986537.986601"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3603269.3604813"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01404-8"},{"key":"e_1_3_2_1_11_1","first-page":"2004","article-title":"burstiness with flowlet switching","author":"Sinha Shan","year":"2004","unstructured":"Shan Sinha, Srikanth Kandula, and Dina Katabi. Harnessing tcp's burstiness with flowlet switching. In Hotnets 2004. Citeseer, 2004.","journal-title":"Hotnets"},{"key":"e_1_3_2_1_12_1","first-page":"407","volume-title":"NSDI 17","author":"Vanini Erico","year":"2017","unstructured":"Erico Vanini, Rong Pan, Mohammad Alizadeh, Parvin Taheri, and Tom Edsall. Let it flow: Resilient asymmetric load balancing with flowlet switching. In NSDI 17, pages 407-420, 2017."},{"key":"e_1_3_2_1_13_1","first-page":"421","article-title":"Flowlet control for datacenter networks","volume":"17","author":"Perry Jonathan","year":"2017","unstructured":"Jonathan Perry, Hari Balakrishnan, and Devavrat Shah. Flowtune: Flowlet control for datacenter networks. In NSDI 17, pages 421-435, 2017.","journal-title":"NSDI"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485882"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452784"},{"key":"e_1_3_2_1_16_1","volume-title":"2023 IEEE 39th International Conference on Data Engineering. IEEE","author":"Liu Zirui","year":"2023","unstructured":"Zirui Liu, Chaozhe Kong, Kaicheng Yang, Tong Yang, Ruijie Miao, Qizhi Chen, Yikai Zhao, Yaofeng Tu, and Bin Cui. Hypercalm sketch: One-pass mining periodic batches in data streams. In 2023 IEEE 39th International Conference on Data Engineering. IEEE, 2023."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11919568_59"},{"key":"e_1_3_2_1_18_1","volume-title":"A paging experiment with the multics system","author":"Corbato Fernando J","year":"1968","unstructured":"Fernando J Corbato et al. A paging experiment with the multics system. Massachusetts Institute of Technology, 1968."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330825"},{"key":"e_1_3_2_1_23_1","first-page":"1027","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21)","author":"Huang Qun","year":"2021","unstructured":"Qun Huang, Siyuan Sheng, Xiang Chen, Yungang Bao, Rui Zhang, Yanwei Xu, and Gong Zhang. Toward nearly-zero-error sketching via compressive sensing. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), pages 1027-1044, 2021."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639281"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00110"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3359710"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00172"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149197"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671695"},{"key":"e_1_3_2_1_30_1","unstructured":"CAIDA dataset. Available: http:\/\/www.caida.org\/home."},{"key":"e_1_3_2_1_31_1","volume-title":"A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS), 15(2):208-229","author":"Whang Kyu-Young","year":"1990","unstructured":"Kyu-Young Whang, Brad T Vander-Zanden, and Howard M Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS), 15(2):208-229, 1990."},{"key":"e_1_3_2_1_32_1","article-title":"Burstbalancer: Do less, better balance for large-scale data center traffic","author":"Liu Zirui","year":"2023","unstructured":"Zirui Liu, Yikai Zhao, Zhuochen Fan, Tong Yang, Xiaodong Li, Ruwen Zhang, Kaicheng Yang, Zihan Jiang, Zheng Zhong, Yi Huang, et al. Burstbalancer: Do less, better balance for large-scale data center traffic. IEEE Transactions on Parallel and Distributed Systems, 2023.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_1_33_1","volume-title":"Newnes","author":"Cole Eric","year":"2012","unstructured":"Eric Cole. Advanced persistent threat: understanding the danger and how to protect your organization. Newnes, 2012."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209205"},{"key":"e_1_3_2_1_35_1","first-page":"1","article-title":"Energy market manipulation: definition, diagnosis, and deterrence","volume":"31","author":"Pirrong Craig","year":"2010","unstructured":"Craig Pirrong. Energy market manipulation: definition, diagnosis, and deterrence. Energy LJ, 31:1, 2010.","journal-title":"Energy LJ"},{"key":"e_1_3_2_1_36_1","first-page":"96","volume-title":"2022 IEEE 38th International Conference on Data Engineering (ICDE 22)","author":"Fan Zhuochen","year":"2022","unstructured":"Zhuochen Fan, Yinda Zhang, Tong Yang, Mingyi Yan, Gang Wen, Yuhan Wu, Hongze Li, and Bin Cui. Periodicsketch: Finding periodic items in data streams. In 2022 IEEE 38th International Conference on Data Engineering (ICDE 22), pages 96-109. IEEE, 2022."},{"key":"e_1_3_2_1_37_1","unstructured":"Supplementary materials. https:\/\/github.com\/RingSketch\/RingSketch\/blob\/main\/RingSketch_Supplementary.pdf."},{"key":"e_1_3_2_1_38_1","volume-title":"ACL","author":"Powers David MW","year":"1998","unstructured":"David MW Powers. Applications and explanations of Zipf's law. In \u00b6roc EMNLP-CoNLL. ACL, 1998."},{"key":"e_1_3_2_1_39_1","unstructured":"Bobhash. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html."},{"key":"e_1_3_2_1_40_1","unstructured":"Criteo click feedback logs dataset. Available: https:\/\/ailab.criteo.com\/download-criteo-1tb-click-logs-dataset\/."},{"key":"e_1_3_2_1_41_1","unstructured":"Murmurhash. https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp."},{"key":"e_1_3_2_1_42_1","unstructured":"Cityhash. https:\/\/github.com\/google\/cityhash."},{"key":"e_1_3_2_1_43_1","unstructured":"Farmhash. https:\/\/github.com\/google\/farmhash."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639306"},{"key":"e_1_3_2_1_45_1","unstructured":"Zirui Liu Hailin Zhang Boxuan Chen Zihan Jiang Yikai Zhao Yangyu Tao Tong Yang and Bin Cui. Cafe: Towards compact adaptive and fast embedding for large-scale online recommendation models. ACM Transactions on Information Systems."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626758"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3737044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:04:18Z","timestamp":1777572258000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3737044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":46,"alternative-id":["10.1145\/3711896.3737044","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3737044","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}