{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:58:20Z","timestamp":1778583500744,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540286073","type":"print"},{"value":"9783540286080","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-540-28608-0_4","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T10:10:43Z","timestamp":1468231843000},"page":"87-102","source":"Crossref","is-referenced-by-count":2,"title":["Join Sizes, Frequency Moments, and Applications"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minos","family":"Garofalakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"4_CR1","first-page":"274","volume-title":"Proceedings of ACM Principles of Database Systems","author":"D. Achlioptas","year":"2001","unstructured":"D. Achlioptas, Database-friendly random projections, in Proceedings of ACM Principles of Database Systems (2001), pp. 274\u2013281"},{"key":"4_CR2","first-page":"10","volume-title":"Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems","author":"N. Alon","year":"1999","unstructured":"N. Alon, P. Gibbons, Y. Matias, M. Szegedy, Tracking join and self-join sizes in limited storage, in Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems (1999), pp. 10\u201320"},{"key":"4_CR3","first-page":"20","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing","author":"N. Alon","year":"1996","unstructured":"N. Alon, Y. Matias, M. Szegedy, The space complexity of approximating the frequency moments, in Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing. (1996), pp. 20\u201329. Journal version in: J. Comput. Syst. Sci. 58, 137\u2013147 (1999)"},{"key":"4_CR4","first-page":"623","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Z. Bar-Yossef","year":"2002","unstructured":"Z. Bar-Yossef, R. Kumar, 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 (2002), pp. 623\u2013632"},{"issue":"2","key":"4_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"J.L. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP)","author":"M. Charikar","year":"2002","unstructured":"M. Charikar, K. Chen, M. Farach-Colton, Finding frequent items in data streams, in Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP) (2002), pp. 693\u2013703"},{"key":"4_CR7","first-page":"29","volume-title":"Latin American Informatics","author":"G. Cormode","year":"2004","unstructured":"G. Cormode, S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications, in Latin American Informatics (2004), pp. 29\u201338"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"G. Cormode, M. Garofalakis, Approximate continuous querying over distributed streams. ACM Trans. Database Syst. 33(2) (2008)","DOI":"10.1145\/1366102.1366106"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"G. Cormode, M. Garofalakis, P.J. Haas, C. Jermaine, Synopses for massive data: samples, histograms, wavelets, sketches. Found. Trends\u00ae Databases 4(1\u20133) (2012)","DOI":"10.1561\/1900000004"},{"key":"4_CR10","volume-title":"Proc. of the 2004 ACM SIGMOD Intl. Conference on Management of Data","author":"A. Das","year":"2004","unstructured":"A. Das, J. Gehrke, M. Riedewald, Approximation techniques for spatial data, in Proc. of the 2004 ACM SIGMOD Intl. Conference on Management of Data (2004)"},{"key":"4_CR11","first-page":"501","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"J. Feigenbaum","year":"1999","unstructured":"J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan, An approximate L 1 ${L}_{1}$ -difference algorithm for massive data streams, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (1999), pp. 501\u2013511"},{"key":"4_CR12","volume-title":"27th Intl. Conf. on Very Large Data Bases","author":"M. Garofalakis","year":"2001","unstructured":"M. Garofalakis, P.B. Gibbons, Approximate query processing: taming the terabytes, in 27th Intl. Conf. on Very Large Data Bases, Rome, Italy (2001). Tutorial"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/B978-155860869-6\/50047-0","volume-title":"Proceedings of the International Conference on Very Large Data Bases","author":"A.C. Gilbert","year":"2002","unstructured":"A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss, How to summarize the universe: dynamic maintenance of quantiles, in Proceedings of the International Conference on Very Large Data Bases (2002), pp. 454\u2013465"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1080\/00949658908811160","volume":"32","author":"I.J. Good","year":"1989","unstructured":"I.J. Good, Surprise indexes and p $p$ -values. J. Stat. Comput. Simul. 32, 90\u201392 (1989)","journal-title":"J. Stat. Comput. Simul."},{"issue":"4","key":"4_CR15","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/169725.169708","volume":"18","author":"Y.E. Ioannidis","year":"1993","unstructured":"Y.E. Ioannidis, S. Christodoulakis, Optimal histograms for limiting worst-case error propagation in the size of join results. ACM Trans. Database Syst. 18(4), 709\u2013748 (1993)","journal-title":"ACM Trans. Database Syst."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W.B. Johnson","year":"1984","unstructured":"W.B. Johnson, J. Lindenstrauss, Extensions of Lipschitz mapping into Hilbert space. Contemp. Math. 26, 189\u2013206 (1984)","journal-title":"Contemp. Math."},{"key":"4_CR17","first-page":"234","volume-title":"Proceedings of the ACM SIGCOMM Conference on Internet Measurement","author":"B. Krishnamurthy","year":"2003","unstructured":"B. Krishnamurthy, S. Sen, Y. Zhang, Y. Chen, Sketch-based change detection: methods, evaluation and applications, in Proceedings of the ACM SIGCOMM Conference on Internet Measurement (2003), pp. 234\u2013247"},{"key":"4_CR18","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"E. Kushilevitz, N. Nisan, Communication Complexity (Cambridge University Press, Cambridge, 1997)"},{"key":"4_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"R. Motwani, P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, 1995)"},{"key":"4_CR20","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"S. Muthukrishnan","year":"2003","unstructured":"S. Muthukrishnan, Data streams: algorithms and applications, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003)"},{"key":"4_CR21","first-page":"496","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"M. Thorup","year":"2000","unstructured":"M. Thorup, Even strongly universal hashing is pretty fast, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 496\u2013497"},{"key":"4_CR22","first-page":"615","volume-title":"Proceedings of the 15th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"M. Thorup","year":"2004","unstructured":"M. Thorup, Y. Zhang, Tabulation based 4-universal hashing with applications to second moment estimation, in Proceedings of the 15th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (2004), pp. 615\u2013624"},{"issue":"3","key":"4_CR23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"M.N. Wegman, J.L. Carter, New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Data-Centric Systems and Applications","Data Stream Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28608-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T20:26:03Z","timestamp":1568147163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28608-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783540286073","9783540286080"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28608-0_4","relation":{},"ISSN":["2197-9723","2197-974X"],"issn-type":[{"value":"2197-9723","type":"print"},{"value":"2197-974X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}