{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:11Z","timestamp":1773481871938,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&#x0026;D Program of China","award":["2021YFB1715600"],"award-info":[{"award-number":["2021YFB1715600"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2019"],"award-info":[{"award-number":["U22B2019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372362"],"award-info":[{"award-number":["62372362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272372"],"award-info":[{"award-number":["62272372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272379"],"award-info":[{"award-number":["62272379"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1109\/tkde.2024.3359710","type":"journal-article","created":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T18:47:45Z","timestamp":1706554065000},"page":"3111-3125","source":"Crossref","is-referenced-by-count":4,"title":["Half-Xor: A Fully-Dynamic Sketch for Estimating the Number of Distinct Values in Big Tables"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5779-6108","authenticated-orcid":false,"given":"Pinghui","family":"Wang","sequence":"first","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8727-4946","authenticated-orcid":false,"given":"Dongdong","family":"Xie","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3476-8248","authenticated-orcid":false,"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1726-6149","authenticated-orcid":false,"given":"Jinsong","family":"Li","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0857-4573","authenticated-orcid":false,"given":"Zhicheng","family":"Li","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0354-9536","authenticated-orcid":false,"given":"Rundong","family":"Li","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8679-8238","authenticated-orcid":false,"given":"Yang","family":"Ren","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd., Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2328-3811","authenticated-orcid":false,"given":"Jia","family":"Di","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Intelligent Networks and Network Security, Xi&#x2019;an Jiaotong University, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66933"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53507-1_98"},{"key":"ref3","first-page":"311","article-title":"Sampling-based estimation of the number of distinct values of an attribute","volume-title":"Proc. Int. Conf. Very Large Data Bases","author":"Jeffrey"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335230"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1992.10475194"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489508"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319897"},{"key":"ref11","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"ref12","volume-title":"Probability and Measure","author":"Billingsley","year":"1986"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.2012.687494"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref16","volume-title":"Statistical Inference","author":"Casella","year":"2021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717570"},{"key":"ref18","volume-title":"Narayanaswamy Balakrishnan, and Haikady Navada Nagaraja","author":"Arnold","year":"2008"},{"key":"ref19","volume-title":"Statistical Tables for Biological, Agricultural and Medical Research","author":"Fisher","year":"1953"},{"key":"ref20","first-page":"1","article-title":"Every row counts: Combining sketches and sampling for accurate group-by result estimates","volume":"1","author":"Freitag","year":"2019","journal-title":"Ratio"},{"key":"ref21","article-title":"The CTU prague relational learning repository","author":"Motl","year":"2015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335230"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1998.10473807"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972962.7"},{"issue":"1","key":"ref25","first-page":"97","article-title":"On estimation of the size of the dictionary of a long text on the basis of a sample","volume":"19","author":"Shlosser","year":"1981","journal-title":"Eng. Cybern."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539246"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"ref28","article-title":"New cardinality estimation algorithms for hyperloglog sketches","author":"Ertl","year":"2017"},{"key":"ref29","article-title":"Back to the future: An even more nearly optimal cardinality estimation algorithm","author":"Lang","year":"2017"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057088"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623669"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451032"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164145"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485458"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0389-y"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CSCWD49262.2021.9437641"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10549876\/10416381.pdf?arnumber=10416381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T13:19:21Z","timestamp":1719407961000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10416381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":37,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3359710","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}