{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:18:23Z","timestamp":1742944703297,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_28","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"301-312","source":"Crossref","is-referenced-by-count":4,"title":["Deterministically Estimating Data Stream Frequencies"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler Algorithm for Estimating Frequency Moments of Data Streams. In: Proceedings of ACM Symposium on Discrete Algorithms (SODA), pp. 708\u2013713 (2006)","DOI":"10.1145\/1109557.1109634"},{"key":"28_CR2","unstructured":"Bose, P., Kranakis, E., Morin, P., Tang, Y.: Bounds for Frequency Estimation of Packet Streams. In: Sibeyn, J.F. (ed.) Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, Informatics 17 Carleton Scientific, pp. 33\u201342 (2003)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items in Data Streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 693\u2013703. Springer, Heidelberg (2002)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An Improved Data Stream Summary: The Count-Min Sketch and its Applications. J. Algorithms\u00a055(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms - ESA 2002","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency Estimation of Internet Packet Streams with Limited Space. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 348\u2013360. Springer, Heidelberg (2002)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-79709-8_22","volume-title":"Computer Science \u2013 Theory and Applications","author":"S. Ganguly","year":"2008","unstructured":"Ganguly, S.: Lower bounds for Frequency Estimation over Data Streams. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science \u2013 Theory and Applications. LNCS, vol.\u00a05010, pp. 204\u2013215. Springer, Heidelberg (2008)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-74450-4_5","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"S. Ganguly","year":"2007","unstructured":"Ganguly, S., Majumder, A.: CR-precis: A Deterministic Summary Structure for Update Streams. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 48\u201359. Springer, Heidelberg (2007)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast Small-space Algorithms for Approximate Histogram Maintenance. In: Proceedings of ACM STOC, pp. 152\u2013161 (2002)","DOI":"10.1145\/509907.509966"},{"key":"28_CR9","unstructured":"Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.J.: Surfing Wavelets on Streams: One-pass Summaries for Approximate Aggregate Queries. In: Proceedings of VLDB, pp. 79\u201388 (2001)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45465-9_58","volume-title":"Automata, Languages and Programming","author":"S. Guha","year":"2002","unstructured":"Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Histogramming Data Streams with Fast Per-Item Processing. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 681\u2013692. Springer, Heidelberg (2002)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.: Optimal Approximations of the Frequency Moments. In: Proceedings of ACM Symposium on Theory of Computing (STOC), Baltimore, Maryland, USA, pp. 202\u2013298 (2005)","DOI":"10.1145\/1060590.1060621"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R.M. Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Trans. Data. Syst.\u00a028(1), 51\u201355 (2003)","journal-title":"ACM Trans. Data. Syst."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Lee, L.K., Ting, H.F.: A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows. In: Proceedings of ACM International Symposium on Principles of Database Systems (PODS), pp. 263\u2013272 (2006)","DOI":"10.1145\/1142351.1142393"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proceedings of VLDB, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding Repeated Elements. Sci. Comput. Programm.\u00a02, 143\u2013152 (1982)","journal-title":"Sci. Comput. Programm."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:55:33Z","timestamp":1714622133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}