{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:46Z","timestamp":1742912566446,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953836"},{"type":"electronic","value":"9783030953843"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95384-3_48","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"775-789","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Effective Single-Pass Approach for Estimating the \u03a6-quantile in Data Streams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6068-952X","authenticated-orcid":false,"given":"Zhengyuan","family":"Xue","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"48_CR1","unstructured":"Mayer-Sch\u00f6nberger, V., Cukier, K.: Big Data: a revolution that will transform how we live, work, and think, Houghton Mifflin Harcourt, p. 31 (2013). ISBN 9780544002692"},{"issue":"4","key":"48_CR2","first-page":"277","volume":"13","author":"R Pike","year":"2005","unstructured":"Pike, R., Dorward, S., Griesemer, R., et al.: Interpreting the data: parallel analysis with sawzall. Dynamic Grids Worldwide Comput. 13(4), 277\u2013298 (2005)","journal-title":"Dynamic Grids Worldwide Comput."},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., et al.: Holistic UDAFs at streaming speeds. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 35\u201346. ACM (2004)","DOI":"10.1145\/1007568.1007575"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Fiedler, U., Plattner, B.: Using latency quantiles to engineer QoS guarantees for web services. In: Proceedings of the 11th International Workshop on Quality of Service (IWQoS), pp. 345\u2013362 (2003)","DOI":"10.1007\/3-540-44884-5_19"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Huang, Z., Wang, L., Yi, K.,, et al.: Sampling based algorithms for quantile computation in sensor networks. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 745\u2013756 (2011)","DOI":"10.1145\/1989323.1989401"},{"issue":"2","key":"48_CR6","first-page":"312","volume":"24","author":"Z Li","year":"2013","unstructured":"Li, Z., Liu, Y., Li, M., et al.: Exploiting ubiquitous data collection for mobile users in wireless sensor networks. IEEE TPDS 24(2), 312\u2013326 (2013)","journal-title":"IEEE TPDS"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Karnin, Z., Lang, K., Liberty, E.: Optimal quantile approximation in streams. In: Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 71\u201378. IEEE (2016)","DOI":"10.1109\/FOCS.2016.17"},{"issue":"5","key":"48_CR8","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1137\/07069328X","volume":"38","author":"S Guha","year":"2008","unstructured":"Guha, S., Mcgregor, A.: Stream order and order statistics: quantile estimation in random-order streams. SIAM J. Comput. 38(5), 2044\u20132059 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/304181.304204","volume":"28","author":"GS Manku","year":"1999","unstructured":"Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Random sampling techniques for space efficient online computation of order statistics of large datasets. ACM SIGMOD Rec. 28(2), 251\u2013262 (1999)","journal-title":"ACM SIGMOD Rec."},{"issue":"7","key":"48_CR10","first-page":"321","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 65: find. Commun. ACM 4(7), 321\u2013322 (1961)","journal-title":"Commun. ACM"},{"key":"48_CR11","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, Fourth Edition. Addison-Wesley. Section 2.4: Priority Queues, pp. 308\u2013335 (2011). ISBN 978-0-321-57351-3"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Xue, Z., Li, R., Zhang, H., et al.: DC-Top-k: a novel Top-k selecting algorithm and its parallelization. In: Proceedings of the 45th International Conference on Parallel Processing (ICPP), pp. 370\u2013379. IEEE (2016)","DOI":"10.1109\/ICPP.2016.49"},{"issue":"1","key":"48_CR13","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 Transactions on Mathematical Software"},{"key":"48_CR14","first-page":"2235","volume-title":"S","author":"C Buragohain","year":"2009","unstructured":"Buragohain, C., Suri, S.: Quantiles on streams. In:  Encyclopedia of Database Systems, pp. 2235\u20132240 (2009)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Wang, L., Luo, G., Yi, K., et al.: Quantiles over data streams:an experimental study. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 737\u2013748. ACM (2013)","DOI":"10.1145\/2463676.2465312"},{"issue":"4","key":"48_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00778-016-0424-7","volume":"25","author":"G Luo","year":"2016","unstructured":"Luo, G., Wang, L., Yi, K., Cormode, G.: Quantiles over data streams: experimental comparisons, new analyses, and further improvements. VLDB J. 25(4), 449\u2013472 (2016). https:\/\/doi.org\/10.1007\/s00778-016-0424-7","journal-title":"VLDB J."},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Hung, R.Y.S., Ting, H.F.: An \u03a9(1\/\u03b5 log 1\/\u03b5) space lower bound for finding \u03b5-approximate quantiles in a data stream. In: Proceedings of the International Conference on Frontiers in Algorithmics, pp. 89\u2013100. Springer (2010)","DOI":"10.1007\/978-3-642-14553-7_11"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Efficient online computation of quantile summaries. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 58\u201366. ACM (2001)","DOI":"10.1145\/376284.375670"},{"key":"48_CR19","unstructured":"Chakrabarti, A., Jayram, T.S., Cu, M.: Tight lower bounds for selection in randomly ordered streams. In: Proceedings of the 19th ACM-Siam Symposium on Discrete Algorithms (SODA), pp. 720\u2013729 (2008)"},{"key":"48_CR20","unstructured":"Felber, D., Ostrovsky, R.: A randomized online quantile summary in O(1\/\u03b5 log1\/\u03b5) words. In: Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2015), pp. 775\u2013785 (2015)"},{"issue":"4","key":"48_CR21","doi-asserted-by":"publisher","first-page":"433","DOI":"10.14778\/3025111.3025124","volume":"10","author":"SA Singh","year":"2016","unstructured":"Singh, S.A., Srivastava, D., Tirthapura, S.: Estimating quantiles from the union of historical and streaming data. Proc. VLDB Endow. 10(4), 433\u2013444 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"48_CR22","first-page":"334","volume":"4","author":"W Wang","year":"2016","unstructured":"Wang, W., Ching, W., Wang, S., et al.: Quantiles on stream: an application to Monte Carlo simulation. J. Syst. Sci. Inf. 4(4), 334\u2013342 (2016)","journal-title":"J. Syst. Sci. Inf."},{"key":"48_CR23","doi-asserted-by":"crossref","unstructured":"Lall, A.: Data streaming algorithms for the Kolmogorov-Smirnov test. In: Proceedings of the IEEE International Conference on Big Data (ICBD), pp. 95\u2013104. IEEE (2015)","DOI":"10.1109\/BigData.2015.7363746"},{"issue":"1","key":"48_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3442337","volume":"46","author":"R Mitchell","year":"2021","unstructured":"Mitchell, R., Frank, E., Holmes, G.: An empirical study of moment estimators for quantile approximation. ACM Trans. Database Syst. 46(1), 1\u201321 (2021)","journal-title":"ACM Trans. Database Syst."},{"issue":"5","key":"48_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s11265-017-1327-6","volume":"91","author":"N Tiwari","year":"2018","unstructured":"Tiwari, N., Pandey, P.C.: A technique with low memory and computational requirements for dynamic tracking of quantiles. J. Signal Process. Syst. 91(5), 411\u2013422 (2018). https:\/\/doi.org\/10.1007\/s11265-017-1327-6","journal-title":"J. Signal Process. Syst."},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Lim, G., Hassan, M.S., Jin, Z., et al.: Approximate quantiles for datacenter telemetry monitoring. In: Proceedings of the 36th IEEE International Conference on Data Engineering (ICDE), pp. 1914\u20131917. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00202"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95384-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:27:37Z","timestamp":1645518457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"403","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":"145","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":"36% - 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.12","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":"2.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)"}}]}}