{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T10:40:22Z","timestamp":1743417622611,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312342"},{"type":"electronic","value":"9783642312359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31235-9_28","type":"book-chapter","created":{"date-parts":[[2012,6,14]],"date-time":"2012-06-14T12:12:45Z","timestamp":1339675965000},"page":"416-430","source":"Crossref","is-referenced-by-count":19,"title":["Tracking Distributed Aggregates over Time-Based Sliding Windows"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-02927-1_10","volume-title":"Automata, Languages and Programming","author":"C. Arackaparambil","year":"2009","unstructured":"Arackaparambil, C., Brody, J., Chakrabarti, A.: Functional Monitoring without Monotonicity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 95\u2013106. Springer, Heidelberg (2009)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: ACM Principles of Database Systems (2004)","DOI":"10.1145\/1055558.1055598"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Busch, C., Tirthapura, S., Xu, B.: Sketching asynchronous streams over sliding windows. In: ACM Conference on Principles of Distributed Computing (PODC) (2006)","DOI":"10.1145\/1146381.1146397"},{"key":"28_CR4","unstructured":"Chan, H.-L., Lam, T.-W., Lee, L.-K., Ting, H.-F.: Continuous monitoring of distributed data streams over a time-based sliding window. In: Symposium on Theoretical Aspects of Computer Science, STACS (2010)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-30551-4_23","volume-title":"Algorithms and Computation","author":"T.M. Chan","year":"2004","unstructured":"Chan, T.M., Sadjad, B.S.: Geometric Optimization Problems Over Sliding Windows. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 246\u2013258. Springer, Heidelberg (2004)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G.: Continuous distributed monitoring: A short survey. In: Algorithms and Models for Distributed Event Processing, AlMoDEP (2011)","DOI":"10.1145\/2031792.2031793"},{"key":"28_CR7","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed, functional monitoring. In: ACM-SIAM Symposium on Discrete Algorithms (2008)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S., Yi, K., Zhang, Q.: Optimal sampling from distributed streams. In: ACM Principles of Database Systems (2010)","DOI":"10.1145\/1807085.1807099"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. In: ACM-SIAM Symposium on Discrete Algorithms (2002)","DOI":"10.1137\/S0097539701398363"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Gibbons, P., Tirthapura, S.: Estimating simple functions on the union of data streams. In: ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 281\u2013290 (2001)","DOI":"10.1145\/378580.378687"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Gibbons, P., Tirthapura, S.: Distributed streams algorithms for sliding windows. In: ACM Symposium on Parallel Algorithms and Architectures (SPAA) (2002)","DOI":"10.1145\/564870.564880"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: ACM SIGMOD International Conference on Management of Data (2001)","DOI":"10.1145\/375663.375670"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Harvey, N.J.A., Nelson, J., Onak, K.: Sketching and streaming entropy via approximation theory. In: IEEE Conference on Foundations of Computer Science (2008)","DOI":"10.1109\/FOCS.2008.76"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Keralapura, R., Cormode, G., Ramamirtham, J.: Communication-efficient distributed monitoring of thresholded counts. In: ACM SIGMOD International Conference on Management of Data (2006)","DOI":"10.1145\/1142473.1142507"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Locher, T., Schmid, S.: Distributed computation of the mode. In: ACM Conference on Principles of Distributed Computing (PODC), pp. 15\u201324 (2008)","DOI":"10.1145\/1400751.1400756"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Lee, L., Ting, H.: A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In: ACM Principles of Database Systems (2006)","DOI":"10.1145\/1142351.1142393"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: Efficient computation of frequent and top-k elements in data streams. In: International Conference on Database Theory (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Patt-Shamir, B.: A note on efficient aggregate queries in sensor networks. In: ACM Conference on Principles of Distributed Computing (PODC), pp. 283\u2013289 (2004)","DOI":"10.1145\/1011767.1011809"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Sharfman, I., Schuster, A., Keren, D.: A geometric approach to monitoring threshold functions over distributed data streams. In: ACM SIGMOD International Conference on Management of Data (2006)","DOI":"10.1145\/1142473.1142508"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Yi, K., Zhang, Q.: Optimal tracking of distributed heavy hitters and quantiles. In: ACM Principles of Database Systems, pp. 167\u2013174 (2009)","DOI":"10.1145\/1559795.1559820"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31235-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T10:13:45Z","timestamp":1743416025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31235-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312342","9783642312359"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31235-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}