{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:11:11Z","timestamp":1787386271710,"version":"build-2736575974"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2007,1]]},"abstract":"<jats:p>Efficient one\u2010pass estimation of $F_0$, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider range\u2010efficient estimation of $F_0$: estimation of the number of distinct elements in a data stream where each element of the stream is not just a single integer but an interval of integers. We present a randomized algorithm which yields an (\u03b5, \u03b4)\u2010approximation of $F_0$, with the following time and space complexities (n is the size of the universe of the items): (1) The amortized processing time per interval is $O(\\log{\\frac{1}{\\delta}}\\log \\frac{n}{\\epsilon})$. (2) The workspace used is $O(\\frac{1}{\\epsilon^2}\\log{\\frac{1}{\\delta}}\\log n)$ bits. Our algorithm improves upon a previous algorithm by Bar\u2010Yossef, Kumar and Sivakumar [Proceedings of the $13$th ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 623\u2013632], which requires $O(\\frac{1}{\\epsilon^5} \\log{\\frac{1}{\\delta}}\\log^5 n)$ processing time per item. This algorithm can also be used to compute the max\u2010dominance norm of a stream of multiple signals and significantly improves upon the previous best time and space bounds by Cormode and Muthukrishnan [Proceedings of the $11$th European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 2938, Springer, Berlin, 2003, pp. 148\u2013160]. This algorithm also provides an efficient solution to the distinct summation problem, which arises during data aggregation in sensor networks [Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, ACM Press, New York, 2004, pp. 250\u2013262, Proceedings of the $20$th International Conference on Data Engineering (ICDE), 2004, pp. 449\u2013460].<\/jats:p>","DOI":"10.1137\/050643672","type":"journal-article","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T12:46:11Z","timestamp":1179319571000},"page":"359-379","source":"Crossref","is-referenced-by-count":23,"title":["Range\u2010Efficient Counting of Distinct Elements in a Massive Data Stream"],"prefix":"10.1137","volume":"37","author":[{"given":"A.","family":"Pavan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2007,5,16]]},"reference":[{"key":"AJKS02","doi-asserted-by":"crossref","unstructured":"M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar,\n                      Approximate counting of inversions in a data stream\n                      , in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2002, pp. 370\u2013379.","DOI":"10.1145\/509907.509964"},{"key":"AMS99","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"BBD02","doi-asserted-by":"crossref","unstructured":"B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom,\n                      Models and issues in data stream systems\n                      , in Proceedings of the 21st ACM Symposium on Principles of Database Systems (PODS), 2002, pp. 1\u201316.","DOI":"10.1145\/543613.543615"},{"key":"BFL06","doi-asserted-by":"crossref","unstructured":"L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti\u2010Spaccamela, and C. Sohler,\n                      Counting triangles in data streams\n                      , in Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 2006, pp. 253\u2013262.","DOI":"10.1145\/1142351.1142388"},{"key":"BYJK02","doi-asserted-by":"crossref","unstructured":"Z. Bar\u2010Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan,\n                      Counting distinct elements in a data stream\n                      , in Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM), Lecture Notes in Comput. Sci. 2483, Springer, Berlin, 2002, pp. 1\u201310.","DOI":"10.1007\/3-540-45726-7_1"},{"key":"BYKS02","unstructured":"Z. Bar\u2010Yossef, R. Kumar, and D. Sivakumar,\n                      Reductions in streaming algorithms, with an application to counting triangles in graphs\n                      , in Proceedings of the 13th ACM\u2010SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 623\u2013632."},{"key":"CDIM02","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198388"},{"key":"CGL05","unstructured":"A. R. Calderbank, A. Gilbert, K. Levchenko, S. Muthukrishnan, and M. Strauss,\n                      Improved range\u2010summable random variable construction algorithms\n                      , in Proceedings of the ACM\u2010SIAM Symposium on Discrete Algorithms (SODA), 2005."},{"key":"CK04","unstructured":"D. Coppersmith and R. Kumar,\n                      An improved data stream algorithm for frequency moments\n                      , in Proceedings of the 15th ACM\u2010SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 151\u2013156."},{"key":"CLKB04","doi-asserted-by":"crossref","unstructured":"J. Considine, F. Li, G. Kollios, and J. Byers,\n                      Approximate aggregation techniques for sensor databases\n                      , in Proceedings of the 20th IEEE International Conference on Data Engineering (ICDE), 2004, pp. 449\u2013460.","DOI":"10.1109\/ICDE.2004.1320018"},{"key":"CM03","doi-asserted-by":"crossref","unstructured":"G. Cormode and S. Muthukrishnan,\n                      Estimating dominance norms of multiple data streams\n                      , in Proceedings of the 11th European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 2832, Springer, Berlin, 2003, pp. 148\u2013160.","DOI":"10.1007\/978-3-540-39658-1_16"},{"key":"CW79","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"DGIM02","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"FKSV02","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799361701"},{"key":"FM85","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"GGI02","doi-asserted-by":"crossref","unstructured":"A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss,\n                      Fast, small\u2010space algorithms for approximate histogram maintenance\n                      , in Proceedings of the ACM Symposium on Theory of Computing (STOC), 2002, pp. 389\u2013398.","DOI":"10.1145\/509907.509966"},{"key":"GKMS03","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198389"},{"key":"GOL97","unstructured":"O. Goldreich,\n                      A Sample of Samplers: A Computational Perspective on Sampling (Survey)\n                      , Technical report TR97\u2010020, Electronic Colloquium on Computational Complexity, 1997."},{"key":"GT01","doi-asserted-by":"crossref","unstructured":"P. B. Gibbons and S. Tirthapura,\n                      Estimating simple functions on the union of data streams\n                      , in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, pp. 281\u2013291.","DOI":"10.1145\/378580.378687"},{"key":"HNSS95","unstructured":"P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes,\n                      Sampling\u2010based estimation of the number of distinct values of an attribute\n                      , in Proceedings of the 21st International Conference on Very Large Data Bases, Morgan Kaufmann, San Mateo, CA, 1995, pp. 311\u2013322."},{"key":"IW03","doi-asserted-by":"crossref","unstructured":"P. Indyk and D. Woodruff,\n                      Tight lower bounds for the distinct elements problem\n                      , in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, p. 283.","DOI":"10.1109\/SFCS.2003.1238202"},{"key":"JG05","doi-asserted-by":"crossref","unstructured":"H. Jowhari and M. Ghodsi,\n                      New streaming algorithms for counting triangles in graphs\n                      , in Proceedings of the International Conference on Computing and Combinatorics (COCOON), Lecture Notes in Comput. Sci. 3595, Springer, Berlin, 2005, pp. 710\u2013716.","DOI":"10.1007\/11533719_72"},{"key":"MUT05","doi-asserted-by":"crossref","unstructured":"S. Muthukrishnan,\n                      Data Streams: Algorithms and Applications\n                      , Foundations and Trends in Theoretical Computer Science, Now Publishers, 2005.","DOI":"10.1561\/0400000002"},{"key":"NGSA04","doi-asserted-by":"crossref","unstructured":"S. Nath, P. B. Gibbons, S. Seshan, and Z. Anderson,\n                      Synposis diffusion for robust aggregation in sensor networks\n                      , in Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, ACM Press, New York, 2004, pp. 250\u2013262.","DOI":"10.1145\/1031495.1031525"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/050643672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:26:22Z","timestamp":1787336782000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/050643672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["10.1137\/050643672"],"URL":"https:\/\/doi.org\/10.1137\/050643672","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}