{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:43:40Z","timestamp":1743061420004,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_16","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Approximate L p-Difference Algorithm for Massive Data Streams"],"prefix":"10.1007","author":[{"given":"Jessica H.","family":"Fong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin J.","family":"Strauss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"16_CR1","first-page":"10","volume-title":"Proc. of the 18\u2019th Symp. on Principles of Database Systems","author":"N. Alon","year":"1999","unstructured":"N. Alon, P. Gibbons, Y. Matias, and M. Szegedy. Tracking Join and Self-Join Sizes in Limited Storage. In Proc. of the 18\u2019th Symp. on Principles of Database Systems, ACM Press, New York, pages 10\u201320, 1999."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. of 28\u2019th STOC, pages 20\u201329, 1996. To appear in Journal of Computing and System Sciences.","DOI":"10.1145\/237814.237823"},{"key":"16_CR3","unstructured":"N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proc. of the 30\u2019th STOC, pages 327\u2013336, 1998.","DOI":"10.1145\/276698.276781"},{"key":"16_CR5","unstructured":"Cisco NetFlow, 1998. http:\/\/www.cisco.com\/warp\/public\/732\/netflow\/ ."},{"key":"16_CR6","first-page":"73","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"J. Feigenbaum","year":"1993","unstructured":"J. Feigenbaum. Locally random reductions in interactive complexity theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pages 73\u201398. American Mathematical Society, Providence, 1993."},{"key":"16_CR7","unstructured":"J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An Approximate L 1-Difference Algorithm for Massive Data Streams. To appear in Proc. of the 40\u2019th IEEE Symposium on Foundataions of Computer Science, 1999."},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/BFb0023486","volume-title":"Proc. of the 14\u2019th Symposium on Theoretical Aspects of Computer Science","author":"J. Feigenbaum","year":"1997","unstructured":"J. Feigenbaum and M. Strauss. An Information-Theoretic Treatment of Random-Self-Reducibility. Proc. of the 14\u2019th Symposium on Theoretical Aspects of Computer Science, pages 523\u2013534. Lecture Notes in Computer Science, vol. 1200, Springer-Verlag, New York, 1997."},{"key":"16_CR9","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"S909","volume-title":"Synopsis Data Structures for Massive Data Sets","author":"P. Gibbons","year":"1999","unstructured":"P. Gibbons and Y. Matias. Synopsis Data Structures for Massive Data Sets. To appear in Proc. 1998 DIMACS Workshop on External Memory Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence. Abstract in Proc. Tenth Symposium on Discrete Algorithms, ACM Press, New York and Society for Industrial and Applied Mathematics, Philadelphia, pages S909\u2013910, 1999."},{"key":"16_CR10","unstructured":"M. Rauch Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report 1998-011, Digital Equipment Corporation Systems Research Center, May 1998."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, Y. Rabani. Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. Proc. of The 30\u2019s ACM Symposium on Theory of Computing, ACM Press, New York, pages 514\u2013523.","DOI":"10.1137\/S0097539798347177"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:26:09Z","timestamp":1683998769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_16"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}