{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:49:04Z","timestamp":1742942944572,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030293994"},{"type":"electronic","value":"9783030294007"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_32","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"451-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Streaming Random Sampling"],"prefix":"10.1007","author":[{"given":"Kanat","family":"Tangwongsan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"32_CR1","unstructured":"Babcock, B., Datar, M., Motwani, R.: Sampling from a moving window over streaming data. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 633\u2013634 (2002)"},{"key":"32_CR2","unstructured":"Blelloch, G.E., Maggs, B.M.: Chapter 10: parallel algorithms. In: The Computer Science and Engineering Handbook, 2nd edn. Chapman and Hall\/CRC (2004)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Braverman, V., Ostrovsky, R., Zaniolo, C.: Optimal sampling from sliding windows. In: Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 147\u2013156 (2009)","DOI":"10.1145\/1559795.1559818"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Brown, P.G., Haas, P.J.: Techniques for warehousing of sample data. In: Proceedings of the International Conference on Data Engineering (ICDE), p. 6 (2006)","DOI":"10.1109\/ICDE.2006.157"},{"issue":"6","key":"32_CR5","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1109\/TKDE.2016.2518679","volume":"28","author":"Y Chung","year":"2016","unstructured":"Chung, Y., Tirthapura, S., Woodruff, D.P.: A simple message-optimal algorithm for random sampling from a distributed stream. IEEE Trans. Knowl. Data Eng. (TKDE) 28(6), 1356\u20131368 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2481528.2481530","volume":"42","author":"G Cormode","year":"2013","unstructured":"Cormode, G.: The continuous distributed monitoring model. SIGMOD Rec. 42(1), 5\u201314 (2013)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2160158.2160163","volume":"59","author":"G Cormode","year":"2012","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K., Zhang, Q.: Continuous sampling from distributed streams. J. ACM 59(2), 10:1\u201310:25 (2012)","journal-title":"J. ACM"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.14778\/1687627.1687653","volume":"2","author":"S Das","year":"2009","unstructured":"Das, S., Antony, S., Agrawal, D., El Abbadi, A.: Thread cooperation in multicore architectures for frequency counting over multiple data streams. Proc. VLDB Endow. (PVLDB) 2(1), 217\u2013228 (2009)","journal-title":"Proc. VLDB Endow. (PVLDB)"},{"issue":"5","key":"32_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.ipl.2005.11.003","volume":"97","author":"PS Efraimidis","year":"2006","unstructured":"Efraimidis, P.S., Spirakis, P.G.: Weighted random sampling with a reservoir. Inf. Process. Lett. 97(5), 181\u2013185 (2006)","journal-title":"Inf. Process. Lett."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Gemulla, R., Lehner, W.: Sampling time-based sliding windows in bounded space. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 379\u2013392 (2008)","DOI":"10.1145\/1376616.1376657"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Gibbons, P., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 281\u2013291 (2001)","DOI":"10.1145\/378580.378687"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Gu, Y., Shun, J., Sun, Y., Blelloch, G.E.: A top-down parallel semisort. In: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 24\u201334 (2015)","DOI":"10.1145\/2755573.2755597"},{"key":"32_CR13","unstructured":"Johnson, T., Shkapenyuk, V.: Data stream warehousing in tidalrace. In: Proceedingsof the Conference on Innovative Data Systems Research (CIDR) (2015)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: An optimal parallel algorithm for integer sorting. In: Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 496\u2013504 (1985)","DOI":"10.1109\/SFCS.1985.9"},{"key":"32_CR15","volume-title":"Introduction to Probability Models","author":"SM Ross","year":"2009","unstructured":"Ross, S.M.: Introduction to Probability Models, 10th edn. Academic Press, Cambridge (2009)","edition":"10"},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/3157734","volume":"44","author":"P Sanders","year":"2018","unstructured":"Sanders, P., Lamm, S., H\u00fcbschle-Schneider, L., Schrade, E., Dachsbacher, C.: Efficient parallel random sampling - vectorized, cache-efficient, and online. ACM Trans. Math. Softw. 44(3), 29:1\u201329:14 (2018)","journal-title":"ACM Trans. Math. Softw."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Tangwongsan, K., Pavan, A., Tirthapura, S.: Parallel triangle counting in massive streaming graphs. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp. 781\u2013786 (2013)","DOI":"10.1145\/2505515.2505741"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Tangwongsan, K., Tirthapura, S.: Parallel streaming random sampling. arXiv:1906.04120 [cs.DS], https:\/\/arxiv.org\/abs\/1906.04120, June 2019","DOI":"10.1007\/978-3-030-29400-7_32"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Tangwongsan, K., Tirthapura, S., Wu, K.: Parallel streaming frequency-based aggregates. In: Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 236\u2013245 (2014)","DOI":"10.1145\/2612669.2612695"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"issue":"5","key":"32_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00446-007-0048-7","volume":"20","author":"B Xu","year":"2008","unstructured":"Xu, B., Tirthapura, S., Busch, C.: Sketching asynchronous data streams over sliding windows. Distrib. Comput. 20(5), 359\u2013374 (2008)","journal-title":"Distrib. Comput."},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Zaharia, M., Das, T., Li, H., Hunter, T., Shenker, S., Stoica, I.: Discretized streams: fault-tolerant streaming computation at scale. In: Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pp. 423\u2013438 (2013)","DOI":"10.1145\/2517349.2522737"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:05:08Z","timestamp":1691885108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}