{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:16:50Z","timestamp":1749010610619,"version":"3.41.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_25","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T15:33:54Z","timestamp":1464708834000},"page":"369-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Algorithm for Approximate Quantile Queries on Sliding Windows"],"prefix":"10.1007","author":[{"given":"Chun-Nam","family":"Yu","sequence":"first","affiliation":[]},{"given":"Michael","family":"Crouch","sequence":"additional","affiliation":[]},{"given":"Ruichuan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Sala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: PODS, pp. 286\u2013296. ACM (2004)","DOI":"10.1145\/1055558.1055598"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1007\/978-0-387-39940-9_290","volume-title":"Encyclopedia of Database Systems","author":"C Buragohain","year":"2009","unstructured":"Buragohain, C., Suri, S.: Quantiles on streams. In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 2235\u20132240. Springer, New York (2009)"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"6","key":"25_CR4","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 J. Comput. 31(6), 1794\u20131813 (2002)","journal-title":"SIAM J. Comput."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: ACM SIGMOD Record, vol. 30, pp. 58\u201366. ACM (2001)","DOI":"10.1145\/376284.375670"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Lin, X., Hongjun, L., Jian, X., Yu, J.X.: Continuously maintaining quantile summaries of the most recent n elements over a data stream. In: ICDE, pp. 362\u2013373. IEEE (2004)","DOI":"10.1109\/ICDE.2004.1320011"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Mousavi, H., Zaniolo, C.: Fast and accurate computation of equi-depth histograms over data streams. In: EDBT, pp. 69\u201380. ACM (2011)","DOI":"10.1145\/1951365.1951376"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Mousavi, H., Zaniolo, C.: Fast computation of approximate biased histograms on sliding windows over data streams. In: SSDBM, p. 13. ACM (2013)","DOI":"10.1145\/2484838.2484851"},{"issue":"10","key":"25_CR9","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/2336664.2336672","volume":"5","author":"O Papapetrou","year":"2012","unstructured":"Papapetrou, O., Garofalakis, M., Deligiannakis, A.: Sketch-based querying of distributed sliding-window data streams. Proc. VLDB Endowment 5(10), 992\u20131003 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Shrivastava, N., Buragohain, C., Agrawal, D., Suri, S.: Medians and beyond: new aggregation techniques for sensor networks. In: SenSys, pp. 239\u2013249. ACM (2004)","DOI":"10.1145\/1031495.1031524"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Wang, W.: A fast algorithm for approximate quantiles in high speed data streams. In: SSDBM, p. 29. IEEE (2007)","DOI":"10.1109\/SSDBM.2007.27"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T20:05:42Z","timestamp":1748981142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}