{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:17:04Z","timestamp":1780766224270,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441472","type":"print"},{"value":"9783540457268","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45726-7_1","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T05:55:49Z","timestamp":1186811749000},"page":"1-10","source":"Crossref","is-referenced-by-count":164,"title":["Counting Distinct Elements in a Data Stream"],"prefix":"10.1007","author":[{"given":"Ziv","family":"Bar-Yossef","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T. S.","family":"Jayram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.","family":"Sivakumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137\u2013147, 1999.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR2","unstructured":"Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 623\u2013632, 2002."},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441\u2013453, 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"L. Carter and M. Wegman. Universal classes of hash functions. In Proceedings of the 9th ACM Annual Symposium on Theory of Computing, pages 106\u2013112, 1977. Journal version in Journal of Computer and System Sciences, 18(2) 143-154, 1979.","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182\u2013209, 1985.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"P. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, pages 281\u2013291, 2001.","DOI":"10.1145\/378580.378687"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"P.J. Haas, J.F. Naughton, S. Seshadri, and A.N. Swami. Selectivity and cost estimation for joins based on random sampling. Journal of Computer and System Sciences, 52(3), 1996.","DOI":"10.1006\/jcss.1996.0041"},{"issue":"3","key":"1_CR8","first-page":"175","volume":"22","author":"M. Wegman","year":"1979","unstructured":"M. Wegman and L. Carter. New classes and applications of hash functions. In Proceedings of the 20th IEEE Annual Symposium on Foundations of Computer Science, pages 175\u2013182, 1979. Journal version titled \u201cNew Hash Functions and Their Use in Authentication and Set Equality\u201d in Journal of Computer and System Sciences, 22(3): 265-279, 1981.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"K.-Y. Whang","year":"1990","unstructured":"K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems, 15(2):208\u2013229, 1990.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45726-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T06:57:35Z","timestamp":1550732255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45726-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441472","9783540457268"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45726-7_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}