{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:04:47Z","timestamp":1794366287309,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"value":"9780387355443","type":"print"},{"value":"9780387399409","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","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-0-387-39940-9_373","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T04:05:42Z","timestamp":1253073942000},"page":"2842-2847","source":"Crossref","is-referenced-by-count":0,"title":["Stream Similarity Mining"],"prefix":"10.1007","author":[{"given":"Erik","family":"Vee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"373_CR1_373","doi-asserted-by":"crossref","unstructured":"Alon N., Gibbons P., Matias Y., and Szegedy M. Tracking join and self-join sizes in limited storage. In Proc. 18th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1999, pp. 10\u201320.","DOI":"10.1145\/303976.303978"},{"key":"373_CR2_373","doi-asserted-by":"crossref","unstructured":"Alon N., Matias Y., and Szegedy M. The space complexity of approximating the frequency moments. In Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 20\u201329.","DOI":"10.1145\/237814.237823"},{"key":"373_CR3_373","doi-asserted-by":"crossref","unstructured":"Broder A., Charikar M., Frieze A., and Mitzenmacher M. Min-wise independent permutations. In Proc. of the 30th ACM Symp. on Theory of Computing, 1998, pp. 327\u2013336.","DOI":"10.1145\/276698.276781"},{"key":"373_CR4_373","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1080\/01621459.1976.10480344","volume":"71","author":"J.M. Chambers","year":"1976","unstructured":"Chambers J.M., Mallows C.L., and Stuck B.W. A method for simulating stable random variables. J. Am. Stat. Assoc., 71:340\u2013344, 1976.","journal-title":"J. Am. Stat. Assoc."},{"key":"373_CR5_373","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen E. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci., 55:441\u2013453, 1997.","journal-title":"J. Comput. Syst. Sci."},{"key":"373_CR6_373","doi-asserted-by":"crossref","unstructured":"Cohen E., Datar M., Fujiwara S., Gionis A., Indyk P., Motwani R., and Ullman J. Finding interesting associations without support pruning. In Proc. 16th International Conf. on Data Engineering, 2000.","DOI":"10.1109\/69.908981"},{"key":"373_CR7_373","doi-asserted-by":"crossref","unstructured":"Cormode G., Datar M., Indyk P., and Muthukrishnan S. Comparing data streams using hamming norms. In Proc. 28th Int. Conf. on Very Large Data Bases, 2002, pp. 335\u2013345.","DOI":"10.1016\/B978-155860869-6\/50037-8"},{"key":"373_CR8_373","unstructured":"Datar M., Gionis A., Indyk P., and Motwani R. Maintaining stream statistics over sliding windows. In Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 635\u2013644."},{"key":"373_CR9_373","doi-asserted-by":"crossref","unstructured":"Datar M. and Muthukrishnan S. Estimating rarity and similarity on data stream windows. In Proc. 10th European Symp. on Algorithms, 2002.","DOI":"10.1007\/3-540-45749-6_31"},{"key":"373_CR10_373","unstructured":"Feigenbaum J., Kannan S., Strauss M., and Viswanathan M. An approximate l\n                1-difference algorithm for massive data streams. In Proc. 40th Annual Symp. on Foundations of Computer Science, 1999."},{"key":"373_CR11_373","doi-asserted-by":"crossref","unstructured":"Flajolet P. and Martin G. Probabilistic counting. In Proc. 24th Annual Symp. on Foundations of Computer Science, 1983, pp. 76\u201382.","DOI":"10.1109\/SFCS.1983.46"},{"key":"373_CR12_373","doi-asserted-by":"crossref","unstructured":"Indyk P. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41st Annual Symp. on Foundations of Computer Science, 2000, pp. 189\u2013197.","DOI":"10.1109\/SFCS.2000.892082"},{"key":"373_CR13_373","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1006\/jagm.2000.1131","volume":"38","author":"P. Indyk","year":"2001","unstructured":"Indyk P. A small approximately min-wise independent family of hash functions. J. Algorithm., 38:84\u201390, 2001.","journal-title":"J. Algorithm."},{"key":"373_CR14_373","unstructured":"On the distributional complexity of disjointness. J. Comput. Sci. Syst., 2, 1984."},{"key":"373_CR15_373","unstructured":"Saks M. and Sun X. The space complexity of approximating the frequency moments. In Proc. 34th ACM Symp. on Theory of Computing, 2002."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T14:15:46Z","timestamp":1791987346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_373","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009]]}}}