{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:04:41Z","timestamp":1742936681686,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021572"},{"type":"electronic","value":"9783642021589"}],"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-02158-9_18","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T15:36:06Z","timestamp":1245252966000},"page":"202-211","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Estimating Hybrid Frequency Moment of Data Streams"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1998","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating frequency moments. J. Comp. Sys. and Sc.\u00a058(1), 137\u2013147 (1998)","journal-title":"J. Comp. Sys. and Sc."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. In: Proceedings of ACM STOC, Princeton, NJ, pp. 209\u2013218 (2002)","DOI":"10.1109\/SFCS.2002.1181944"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45726-7_1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Z. Bar-Yossef","year":"2002","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, pp. 1\u201310. Springer, Heidelberg (2002)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11841036_16","volume-title":"Algorithms \u2013 ESA 2006","author":"L. Bhuvanagiri","year":"2006","unstructured":"Bhuvanagiri, L., Ganguly, S.: Estimating entropy over data streams. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 148\u2013159. Springer, Heidelberg (2006)"},{"key":"18_CR5","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. In: Proceedings of International Conference on Computational Complexity (CCC), Aarhus, Denmark (2003)"},{"key":"18_CR6","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":"18_CR7","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":"18_CR8","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Space Efficient Mining of Multigraph Streams. In: Proceedings of ACM International Symposium on Principles of Database Systems (PODS) (2005)","DOI":"10.1145\/1065167.1065201"},{"issue":"2","key":"18_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 Database Applications. J. Comp. Sys. and Sc.\u00a031(2), 182\u2013209 (1985)","journal-title":"J. Comp. Sys. and Sc."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-69311-6_9","volume-title":"Frontiers in Algorithmics","author":"S. Ganguly","year":"2008","unstructured":"Ganguly, S., Bansal, M., Dube, S.: Estimating hybrid frequency moments of data streams. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol.\u00a05059, pp. 55\u201366. Springer, Heidelberg (2008)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of ACM SPAA, Heraklion, Crete, Greece, pp. 281\u2013291 (2001)","DOI":"10.1145\/378580.378687"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Stable Distributions, Pseudo Random Generators, Embeddings and Data Stream Computation. In: Proceedings of IEEE FOCS, pp. 189\u2013197 (2000)","DOI":"10.1109\/SFCS.2000.892082"},{"key":"18_CR13","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, June 2005, pp. 202\u2013298 (2005)","DOI":"10.1145\/1060590.1060621"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Li, P.: Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections (manuscript) (2006)","DOI":"10.1145\/1150402.1150436"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Li, P.: Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections (June 2008) arXiv:0806.4422v1 [cs.LG]","DOI":"10.1109\/ICDM.2008.95"},{"key":"18_CR16","unstructured":"McGregor, A.: Open Problem. In: Data Streams And Related Topics: IITK Workshop On Algorithms For Data Streams (2006), http:\/\/www.cse.iitk.ac.in\/users\/sganguly\/openproblems.pdf"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Pseudo-Random Generators for Space Bounded Computation. In: Proceedings of ACM Symposium on Theory of Computing STOC, May 1990, pp. 204\u2013212 (1990)","DOI":"10.1145\/100216.100242"},{"key":"18_CR18","unstructured":"Nolan, J.P.: Stable Distributions. ch. 1 (2006), http:\/\/academic2.american.edu\/~jpnolan"},{"key":"18_CR19","unstructured":"Woodruff, D.P.: Personal Communication (August 2008)"},{"key":"18_CR20","unstructured":"Woodruff, D.P.: Optimal space lower bounds for all frequency moments. In: Proceedings of ACM Symposium on Discrete Algorithms (SODA), pp. 167\u2013175 (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02158-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:42:46Z","timestamp":1739166166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02158-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021572","9783642021589"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02158-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}