{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:19:23Z","timestamp":1737436763630,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747680"},{"type":"electronic","value":"9783540747697"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74769-7_73","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T15:27:53Z","timestamp":1187969273000},"page":"688-696","source":"Crossref","is-referenced-by-count":1,"title":["A Robust Approach to Find Effective Items in Distributed Data Streams"],"prefix":"10.1007","author":[{"given":"Xiaoxia","family":"Rong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jindong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","first-page":"413","volume-title":"Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms table of contents","author":"S. Muthukrishnan","year":"2003","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms table of contents, pp. 413\u2013413. ACM Press, New York (2003)"},{"key":"73_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/564870.564880","volume-title":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures","author":"P.B. Gibbons","year":"2002","unstructured":"Gibbons, P.B., Srikanta, T.: Distributed Streams Algorithms for Sliding Windows. In: ICDCN 2006, pp. 63\u201372. ACM Press, New York (2002)"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Lin, X., Lu, H., Xu, J., Yu, J.X.: Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream. In: Proceedings of the 20th International Conference on Data Engineering, pp. 362\u2013373 (2004)","DOI":"10.1109\/ICDE.2004.1320011"},{"key":"73_CR4","doi-asserted-by":"crossref","unstructured":"Brian, B., Surajit, C., Gautam, D.: Dynamic Sample Selection for Approximate Query Processing. In: SIGMOD Conference, pp. 539\u2013550 (2003)","DOI":"10.1145\/872757.872822"},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"73_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R. Karp","year":"2003","unstructured":"Karp, R., Papadimitriou, C., Shenker, S.: A simple algorithm for finding frequent elements in sets and bags. ACM Transactions on Database Systems (TODS)\u00a028, 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"73_CR7","series-title":"Lecture Notes in Computer Science","first-page":"29","volume-title":"LATIN 2004: Theoretical Informatics","author":"C. Graham","year":"2004","unstructured":"Graham, C., Muthukrishnan, S.: An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 29\u201338. Springer, Heidelberg (2004)"},{"key":"73_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theoretical Computer Science\u00a0312, 3\u201315 (2004)","journal-title":"Theoretical Computer Science"},{"key":"73_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences\u00a031, 182\u2013209 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"73_CR10","unstructured":"Marios, Hadjieleftheriou, John, W., Byers, George, Kollios.: Robust Sketching and Aggregation of Distributed Data Streams. Boston University Computer Science Technical Report (2005)"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys 2004: Proceedings of the 2nd international conference on Embedded networked sensor systems, pp. 250\u2013262 (2004)","DOI":"10.1145\/1031495.1031525"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74769-7_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T16:54:55Z","timestamp":1737392095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74769-7_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540747680","9783540747697"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74769-7_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}