{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:02:26Z","timestamp":1746316946520},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_27","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T01:49:24Z","timestamp":1189734564000},"page":"294-304","source":"Crossref","is-referenced-by-count":3,"title":["Streaming Algorithms for Data in Motion"],"prefix":"10.1007","author":[{"given":"M.","family":"Hoffmann","sequence":"first","affiliation":[]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"DIMACS Workshop on Managing and Processing Data Streams, FCRC (2003), http:\/\/www.research.att.com\/conf\/mpds2003\/"},{"key":"27_CR2","unstructured":"http:\/\/www.interfleet.com\/"},{"key":"27_CR3","unstructured":"http:\/\/www.lbszone.com\/ , http:\/\/gislounge.com\/ll\/lbs.shtml , http:\/\/www.lbsportal.com\/"},{"key":"27_CR4","unstructured":"http:\/\/www.whereismybus.com\/"},{"key":"27_CR5","unstructured":"http:\/\/dimacs.rutgers.edu\/Workshops\/WGDeliberate\/FinalReport5-20-02.doc"},{"key":"27_CR6","unstructured":"DIMACS Working Group on Streaming Data Analysis, http:\/\/dimacs.rutgers.edu\/Workshops\/StreamingII\/"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Abounaga, A., Chaudhuri, S.: Self-tuning histograms: Building histograms without looking at the data. In: Proc. SIGMOD (1999)","DOI":"10.1145\/304182.304198"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proc. ACM STOC, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. ACM PODS, pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"27_CR10","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":"27_CR11","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. ACM STOC (2003)","DOI":"10.1145\/780542.780548"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TKDE.2003.1198388","volume":"15","author":"G. Cormode","year":"2003","unstructured":"Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using Hamming norms (How to zero in). IEEE Trans. Knowledge and Data Engineering\u00a015, 529\u2013541 (2003)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"27_CR13","unstructured":"Cormode, G., Muthukrishnan, S.: Radial Histograms. DIMACS TR 2003-11."},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-39658-1_16","volume-title":"Algorithms - ESA 2003","author":"G. Cormode","year":"2003","unstructured":"Cormode, G., Muthukrishnan, S.: Estimating dominance norms of multiple data streams. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 148\u2013160. Springer, Heidelberg (2003)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45749-6_31","volume-title":"Algorithms - ESA 2002","author":"M. Datar","year":"2002","unstructured":"Datar, M., Muthukrishnan, S.: Estimating Rarity and Similarity over Data Stream Windows. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 323\u2013334. Springer, Heidelberg (2002)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Estan, C., Savage, S., Varghese, G.: Automatically inferring patterns of resource consumption in network traffic. SIGCOMM (2003)","DOI":"10.1145\/863955.863972"},{"key":"27_CR17","unstructured":"Feigenbaum, J., Kannan, S., Ziang, J.: Computing diameter in the streaming and sliding window models. Manuscript (2002)"},{"key":"27_CR18","first-page":"182","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.: Probabilistic counting algorithms for database applications. JCSS\u00a031, 182\u2013209 (1985)","journal-title":"JCSS"},{"key":"27_CR19","unstructured":"Gibbons, P., Matias, Y.: Synopsis data structures. In: Proc. SODA, pp. 909\u2013910 (1999)"},{"key":"27_CR20","unstructured":"Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Surfing wavelets on streams: One pass summaries for approximate aggregate queris. VLDB Journal, 79\u201388 (2001)"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Guha, S., Indyk, P., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.J.: Fast, small-space algorithms for approximate histogram maintenance. In: Proceedings 34th ACM STOC, pp. 389\u2013398 (2002)","DOI":"10.1145\/509907.509966"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Proc. ACM SIGMOD (2001)","DOI":"10.1145\/375663.375670"},{"key":"27_CR23","unstructured":"Guha, S., Mishra, N., Motwani, R., O\u2019Callaghan, L.: Clustering data streams. IEEE FOCS, pp. 359\u2013366 (2000)"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On Coresets for k-Means and k-Median Clustering. In: Proc. 36th ACM STOC, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"27_CR25","unstructured":"Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data stream. Technical Note 1998-011. Digital systems research center, Palo Alto (May 1998)"},{"key":"27_CR26","unstructured":"Hershberger, J., Suri, S.: Convex hulls and related problems on data streams. In: Proc. MPDS (2003)"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithms for dynamic geometric problems over data streams. In: Proc. Annual ACM Symposium on Theory of Computing (STOC), pp. 373\u2013380 (2004)","DOI":"10.1145\/1007352.1007413"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. IEEE FOCS, pp. 189\u2013197 (2000)","DOI":"10.1109\/SFCS.2000.892082"},{"key":"27_CR29","unstructured":"Indyk, P., Thorup, M.: Unpublished manuscript (2001)"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Jana, R., Johnson, T., Muthukrishnan, S., Vitaletti, A.: Location based services in a wireless WAN using cellular digital packet data (CDPD). MobiDE 2001: 74\u201380","DOI":"10.1145\/376868.376906"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: Proc. VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50077-9"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, B., Sen, S., Zhang, Y., Chen, Y.: Sketch-based change detection: methods, evaluation and applications. In: Proc. Internet Measurement Conference (IMC) (2003)","DOI":"10.1145\/948205.948236"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proc. VLDB, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Madden, S., Franklin, M.: Fjording the stream: An architecture for queryies over streaming sensor data. In: Proc. ICDE (2002)","DOI":"10.1109\/ICDE.2002.994774"},{"key":"27_CR35","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. The Foundations and Trends in Theoretical Computer Science series, Now Publishers (2005)","DOI":"10.1561\/0400000002"},{"key":"27_CR36","unstructured":"Bates, J.: Talk at NAS meeting on Statistics and Massive Data, http:\/\/www7.nationalacademies.org\/bms\/Massive_Data_Workshop.html"},{"key":"27_CR37","unstructured":"Querying and mining data streams: you only get one look. Tutorial at SIGMOD, VLDB 2002 etc. (2002), See http:\/\/www.bell-labs.com\/user\/minos\/tutorial.html"},{"key":"27_CR38","unstructured":"Varghese, G.: Detecting packet patterns at high speeds. Tutorial at SIGCOMM (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:28:08Z","timestamp":1619504888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}