{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:44:47Z","timestamp":1725479087143},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T00:00:00Z","timestamp":1525392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Primary Research & Development Plan of China","award":["2016YFB1000304"]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2014CB340405"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61672061"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Open Project Funding of CAS Key Lab of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Sciences"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11280-018-0583-0","type":"journal-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T08:20:38Z","timestamp":1525422038000},"page":"2065-2081","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Fine-grained probability counting for cardinality estimation of data streams"],"prefix":"10.1007","volume":"22","author":[{"given":"Lun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Tong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Zekun","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,4]]},"reference":[{"key":"583_CR1","doi-asserted-by":"crossref","unstructured":"Chabchoub, Y., H\u00e9brail, G.: Sliding hyperloglog: estimating cardinality in a data stream over a sliding window. In: IEEE International Conference on Data Mining Workshops (ICDMW), pp 1297\u20131303. IEEE (2010)","DOI":"10.1109\/ICDMW.2010.18"},{"issue":"4","key":"583_CR2","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":"583_CR3","doi-asserted-by":"crossref","unstructured":"Dai, H., Zhong, Y., Liu, A.X., Wang, W., Li, M.: Noisy bloom filters for multi-set membership testing. In: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp. 139\u2013151 (2016)","DOI":"10.1145\/2964791.2901451"},{"key":"583_CR4","doi-asserted-by":"crossref","unstructured":"Dai, H., Meng, L., Liu, A.X.: Finding persistent items in distributed, datasets. In: Proceedings of the 37th Annual IEEE International Conference on Computer Communications (INFOCOM) (2018)","DOI":"10.1109\/INFOCOM.2018.8486425"},{"key":"583_CR5","doi-asserted-by":"crossref","unstructured":"Durand, M., Flajolet, P.: Loglog counting of large cardinalities. In: European Symposium on Algorithms, pp. 605\u2013617. Springer (2003)","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"583_CR6","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. ACM, 32(4) (2002)","DOI":"10.1145\/964725.633056"},{"key":"583_CR7","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. ACM (2003)","DOI":"10.1145\/948224.948225"},{"issue":"4","key":"583_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF02241657","volume":"43","author":"P Flajolet","year":"1990","unstructured":"Flajolet, P.: On adaptive sampling. Computing 43(4), 391\u2013400 (1990)","journal-title":"Computing"},{"issue":"2","key":"583_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"AofA07","key":"583_CR10","first-page":"127","volume":"2007","author":"P Flajolet","year":"2007","unstructured":"Flajolet, P., Fusy, \u00c9. , Gandouet, O., Meunier, F.: Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm. Anal. Algor. 2007(AofA07), 127\u2013146 (2007)","journal-title":"Anal. Algor."},{"key":"583_CR11","unstructured":"Garofalakis, M., Hellerstein, J.M., Maniatis, P.: Proof sketches: Verifiable in-network aggregation. In: IEEE 23rd International Conference on Data Engineering, 2007. ICDE 2007, pp. 996\u20131005. IEEE (2007)"},{"key":"583_CR12","doi-asserted-by":"crossref","unstructured":"Han, Q., Du, S., Ren, D., Zhu, H.: Sas: a secure data aggregation scheme in vehicular sensing networks. In: IEEE International Conference on Communications (ICC), pp. 1\u20135. IEEE (2010)","DOI":"10.1109\/ICC.2010.5502132"},{"key":"583_CR13","doi-asserted-by":"crossref","unstructured":"Han, J., Zheng, K., Sun, A., Shang, S., Wen, J.-R.: Discovering neighborhood pattern queries by sample answers in knowledge base. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 1014\u20131025. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498309"},{"key":"583_CR14","doi-asserted-by":"crossref","unstructured":"Heule, S., Nunkesser, M., Hall, A.: Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm. In: Proceedings of the 16th International Conference on Extending Database Technology, pp. 683\u2013692. ACM (2013)","DOI":"10.1145\/2452376.2452456"},{"issue":"2","key":"583_CR15","first-page":"8","volume":"5","author":"U Kang","year":"2011","unstructured":"Kang, U., Tsourakakis, C.E., Appel, A.P., Faloutsos, C., Leskovec, J.: Hadi: mining radii of large graphs. ACM Trans. Knowl. Discov. Data (TKDD) 5(2), 8 (2011)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"583_CR16","unstructured":"Knuth, D.E.: The art of computer programming: sorting and searching, vol. 3. Pearson Education (1998)"},{"key":"583_CR17","doi-asserted-by":"crossref","unstructured":"Li, Z., Xiao, F., Wang, S., Pei, T., Li, J.: Achievable rate maximization for cognitive hybrid satellite-terrestrial networks with af-relays. IEEE Journal on Selected Areas in Communications (2018)","DOI":"10.1109\/JSAC.2018.2804018"},{"key":"583_CR18","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhao, K., Sommer, P., Shang, S., Kusy, B., Jurdak, R.: Bounded quadrant system: Error-bounded trajectory compression on the go. In: IEEE 31st International Conference onData Engineering (ICDE), pp. 987\u2013998. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113350"},{"key":"583_CR19","doi-asserted-by":"crossref","unstructured":"Lochert, C., Scheuermann, B., Mauve, M.: Probabilistic aggregation for data dissemination in vanets. In: Proceedings of the Fourth ACM International Workshop on Vehicular ad hoc Networks, pp. 1\u20138. ACM (2007)","DOI":"10.1145\/1287748.1287750"},{"issue":"4","key":"583_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1524\/itit.2008.0490","volume":"50","author":"C Lochert","year":"2008","unstructured":"Lochert, C., Rybicki, J., Scheuermann, B., Mauve, M.: Scalable data dissemination for inter-vehicle-communication: Aggregation versus peer-to-peer (skalierbare informationsverbreitung f\u00fcr die fahrzeug-fahrzeug-kommunikation: Aggregation versus peer-to-peer). it-Information Technology 50(4), 237\u2013242 (2008)","journal-title":"it-Information Technology"},{"issue":"5","key":"583_CR21","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.adhoc.2009.12.008","volume":"8","author":"C Lochert","year":"2010","unstructured":"Lochert, C., Scheuermann, B., Mauve, M.: A probabilistic method for cooperative hierarchical aggregation of data in vanets. Ad Hoc Netw. 8(5), 518\u2013530 (2010)","journal-title":"Ad Hoc Netw."},{"key":"583_CR22","unstructured":"Open-source codes, \n https:\/\/github.com\/spartazhihu\/Fine-Grained-Probability-Counting-Algorithms"},{"key":"583_CR23","unstructured":"Penn tree bank dataset, \n https:\/\/catalog.ldc.upenn.edu\/ldc99t42"},{"key":"583_CR24","doi-asserted-by":"crossref","unstructured":"Sridharan, A., Ye, T.: Tracking port scanners on the ip backbone. In: Proceedings of the 2007 Workshop on Large Scale Attack Defense, pp. 137\u2013144. ACM (2007)","DOI":"10.1145\/1352664.1352674"},{"issue":"11","key":"583_CR25","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.14778\/2350229.2350277","volume":"5","author":"Y Tong","year":"2012","unstructured":"Tong, Y., Chen, L., Cheng, Y., Yu, P.S.: Mining frequent itemsets over uncertain databases. Proc. VLDB Endow 5(11), 1650\u20131661 (2012)","journal-title":"Proc. VLDB Endow"},{"key":"583_CR26","doi-asserted-by":"crossref","unstructured":"Tong, Y., Chen, L., Ding, B.: Discovering threshold-based frequent closed itemsets over probabilistic data. In: 2012 IEEE 28th International Conference on Data Engineering (ICDE), pp. 270\u2013281. IEEE (2012)","DOI":"10.1109\/ICDE.2012.51"},{"key":"583_CR27","doi-asserted-by":"crossref","unstructured":"Tong, Y., Chen, L., Yu, P.S.: Ufimt: an uncertain frequent itemset mining toolbox. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1508\u20131511. ACM (2012)","DOI":"10.1145\/2339530.2339767"},{"issue":"4","key":"583_CR28","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s11390-015-1555-9","volume":"30","author":"Y-X Tong","year":"2015","unstructured":"Tong, Y.-X., Chen, L., She, J.: Mining frequent itemsets in correlated uncertain databases. J. Comput. Sci. Technol. 30(4), 696\u2013712 (2015)","journal-title":"J. Comput. Sci. Technol."},{"issue":"4","key":"583_CR29","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s11280-015-0341-5","volume":"19","author":"Y Tong","year":"2016","unstructured":"Tong, Y., Zhang, X., Chen, L.: Tracking frequent items over distributed probabilistic data. World Wide Web 19(4), 579\u2013604 (2016)","journal-title":"World Wide Web"},{"key":"583_CR30","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":"583_CR31","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":"583_CR32","doi-asserted-by":"crossref","unstructured":"Wei, S.W.S.S.Z., He, X, Xiao, X, Wen, J.R.: Topppr: top-k personalized pagerank queries with precision guarantees on large graphs. In: SIGMOD. ACM (2018)","DOI":"10.1145\/3183713.3196920"},{"issue":"2","key":"583_CR33","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"K-Y Whang","year":"1990","unstructured":"Whang, K.-Y., Vander-Zanden, B.T., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst. (TODS) 15(2), 208\u2013229 (1990)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"583_CR34","doi-asserted-by":"crossref","unstructured":"Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 136\u2013147 (2014)","DOI":"10.1109\/ICDE.2014.6816646"},{"key":"583_CR35","unstructured":"Zhao, Y., Guo, S., Yang, Y.: Hermes: an optimization of hyperloglog counting in real-time data processing. In: 2016 International Joint Conference on Neural Networks (IJCNN), pp. 1890\u20131895. IEEE (2016)"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0583-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-018-0583-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-018-0583-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T13:20:43Z","timestamp":1562851243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-018-0583-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,4]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["583"],"URL":"https:\/\/doi.org\/10.1007\/s11280-018-0583-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,4]]},"assertion":[{"value":"7 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}