{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:44:34Z","timestamp":1742384674693},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_46","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T14:15:37Z","timestamp":1279030537000},"page":"522-533","source":"Crossref","is-referenced-by-count":14,"title":["Adaptive Spatial Partitioning for Multidimensional Data Streams"],"prefix":"10.1007","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nisheeth","family":"Shrivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM\u00a051, 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci.\u00a058, 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR3","first-page":"286","volume-title":"Proc. 23rd PODS","author":"A. Arasu","year":"2004","unstructured":"Arasu, A., Manku, G.: Approximate counts and quantiles over sliding windows. In: Proc. 23rd PODS, pp. 286\u2013296. ACM Press, New York (2004)"},{"key":"46_CR4","first-page":"1","volume-title":"21st PODS","author":"B. Babcock","year":"2002","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: 21st PODS, pp. 1\u201316. ACM Press, New York (2002)"},{"issue":"4","key":"46_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM\u00a023(4), 214\u2013229 (1980)","journal-title":"Communications of the ACM"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: Proc. 35th STOC, pp. 30\u201339 (2003)","DOI":"10.1145\/780547.780548"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Finding hierarchical heavy hitters in data streams. In: Proc. 29th Conf. VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50048-3"},{"key":"46_CR8","unstructured":"Cormode, G., Muthukrishnan, S.: Radial histograms for spatial streams. Technical report DIMACS TR 2003-11 (2003)"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What is hot and what is not: Tracking most frequent items dynamically. In: Proc. 22nd PODS, pp. 296\u2013306 (2003)","DOI":"10.1145\/773153.773182"},{"issue":"6","key":"46_CR10","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1137\/S0097539701398363","volume":"31","author":"M. Datar","year":"2002","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM Journal of Computing\u00a031(6), 1794\u20131813 (2002)","journal-title":"SIAM Journal of Computing"},{"key":"46_CR11","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":"46_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/863955.863972","volume-title":"Proc. SIGCOMM","author":"C. Estan","year":"2003","unstructured":"Estan, C., Savage, S., Varghese, G.: Automatically inferring patterns of resource consumption in network traffic. In: Proc. SIGCOMM, pp. 137\u2013148. ACM Press, New York (2003)"},{"key":"46_CR13","unstructured":"Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.D.: Computing iceberg queries efficiently. In: Proc. 24rd Conf. VLDB, pp. 299\u2013310 (1998)"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.: How to summarize the Universe: Dynamic maintenance of quantiles. In: Proc. 28th Conf. on VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50047-0"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Proc. 20th SIGMOD, pp. 58\u201366 (2001)","DOI":"10.1145\/375663.375670"},{"key":"46_CR16","first-page":"252","volume-title":"Proc. 23rd PODS","author":"J. Hershberger","year":"2004","unstructured":"Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. In: Proc. 23rd PODS, pp. 252\u2013262. ACM Press, New York (2004)"},{"issue":"1","key":"46_CR17","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 Transactions on Database Systems\u00a028(1), 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proc. 28th Conf. VLDB, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Approximate medians and other quantiles in one pass and with limited memory. In: Proc. 17th SIGMOD, pp. 426\u2013435 (1998)","DOI":"10.1145\/276304.276342"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Manku, G., Rajagopalan, S., Lindsay, B.G.: Random sampling techniques for space efficient online computation of order statistics of large datasets. In: Proc. 18th SIGMOD, pp. 251\u2013262 (1999)","DOI":"10.1145\/304182.304204"},{"key":"46_CR21","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. Programming\u00a02, 143\u2013152 (1982)","journal-title":"Sci. Comput. Programming"},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. Theoretical Computer Science\u00a012, 315\u2013323 (1980)","journal-title":"Theoretical Computer Science"},{"key":"46_CR23","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. Preprint (2003)"},{"key":"46_CR24","first-page":"160","volume-title":"Proc. 20th ACM Symp. Comput. Geom.","author":"S. Suri","year":"2004","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Range counting over multi-dimensional data streams. In: Proc. 20th ACM Symp. Comput. Geom., pp. 160\u2013169. ACM Press, New York (2004)"},{"key":"46_CR25","first-page":"428","volume-title":"Proc. SIGMOD Conf. on Management of Data","author":"N. Thaper","year":"2002","unstructured":"Thaper, N., Guha, S., Indyk, P., Koudas, N.: Dynamic multidimensional histograms. In: Proc. SIGMOD Conf. on Management of Data, pp. 428\u2013439. ACM Press, New York (2002)"},{"key":"46_CR26","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl.\u00a016, 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"key":"46_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"J.S. Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Software\u00a011, 37\u201357 (1985)","journal-title":"ACM Trans. Math. Software"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:21:11Z","timestamp":1685658071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}