{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:51:12Z","timestamp":1780055472724,"version":"3.54.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00400-6","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T17:57:44Z","timestamp":1060711064000},"page":"3-15","source":"Crossref","is-referenced-by-count":317,"title":["Finding frequent items in data streams"],"prefix":"10.1016","volume":"312","author":[{"given":"Moses","family":"Charikar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00400-6_BIB1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, Database-friendly random projections, in: Proc. 20th ACM Symp. on Principles of Database Systems, 2001, pp. 274\u2013281.","DOI":"10.1145\/375551.375608"},{"issue":"1","key":"10.1016\/S0304-3975(03)00400-6_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jcss.1997.1545","article-title":"The space complexity of approximating the frequency moments","volume":"58","author":"Alon","year":"1999","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(03)00400-6_BIB3","unstructured":"M.E. Crovella, M.S. Taqqu, A. Bestavros, Heavy-tailed probability distributions in the world wide web, in: Adler, Feldman, Taqqu (Eds.), A Practical Guide to Heavy Tails, Birkh\u00e4user, Basel, 1998."},{"key":"10.1016\/S0304-3975(03)00400-6_BIB4","unstructured":"M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, J. Ullman, Computing iceberg queries efficiently, in: Proc. 22nd Internat. Conf. on Very Large Data Bases, 1996, pp. 307\u2013317."},{"key":"10.1016\/S0304-3975(03)00400-6_BIB5","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan, An approximate l1-difference algorithm for massive data streams, in: Proc. 40th IEEE Symp. on Foundations of Computer Science, 1999, pp. 501\u2013511.","DOI":"10.1109\/SFFCS.1999.814623"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB6","unstructured":"J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan, Testing and spot-checking of data streams, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 165\u2013174."},{"key":"10.1016\/S0304-3975(03)00400-6_BIB7","doi-asserted-by":"crossref","unstructured":"P. Gibbons, Y. Matias, New sampling-based summary statistics for improving approximate query answers, in: Proc. ACM SIGMOD Internat. Conf. on Management of Data, 1998, pp. 331\u2013342.","DOI":"10.1145\/276304.276334"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB8","doi-asserted-by":"crossref","unstructured":"P. Gibbons, Y. Matias, Synopsis data structures for massive data sets, in: Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 909\u2013910.","DOI":"10.1090\/dimacs\/050\/02"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB9","doi-asserted-by":"crossref","unstructured":"A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, M. Strauss, Fast, small-space algorithms for approximate histogram maintenance, in: Proc. 34th ACM Symp. on Theory of Computing, 2002.","DOI":"10.1145\/509961.509966"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB10","unstructured":"Google, Google zeitgeist\u2014search patterns, trends, and surprises according to Google, http:\/\/www.google.com\/press\/zeitgeist.html."},{"key":"10.1016\/S0304-3975(03)00400-6_BIB11","doi-asserted-by":"crossref","unstructured":"S. Guha, N. Mishra, R. Motwani, L. O'Callaghan, Clustering data streams, in: Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000, pp. 359\u2013366.","DOI":"10.1109\/SFCS.2000.892124"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB12","unstructured":"M. Henzinger, P. Raghavan, S. Rajagopalan, Computing on data streams, Tech. Report SRC TR 1998-011, December 1998."},{"key":"10.1016\/S0304-3975(03)00400-6_BIB13","doi-asserted-by":"crossref","unstructured":"P. Indyk, Stable distributions, pseudorandom generators, embeddings and data stream computation, in: Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000, pp. 148\u2013155.","DOI":"10.1109\/SFCS.2000.892082"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/762471.762473","article-title":"A simple algorithm for finding frequent elements in streams and bags","volume":"28","author":"Karp","year":"2003","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB15","doi-asserted-by":"crossref","unstructured":"G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: Proc. 28th Internat. Conf. on Very Large Data Bases, 2002.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB16","doi-asserted-by":"crossref","unstructured":"M. Saks, X. Sun, Space lower bounds for distance approximation in the data stream model, in: Proc. 34th ACM Symp. on Theory of Computing, 2002.","DOI":"10.1145\/509961.509963"},{"key":"10.1016\/S0304-3975(03)00400-6_BIB17","unstructured":"Y. Xie, D. O'Hallaron, Locality for search engine queries and its implications for caching, in: Proc. INFOCOM, 2002."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004006?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004006?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T14:18:38Z","timestamp":1734099518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503004006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503004006"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00400-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}