{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:46:42Z","timestamp":1725464802315},"publisher-location":"Boston, MA","reference-count":36,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387243931"},{"type":"electronic","value":"9780387252292"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/0-387-25229-0_3","type":"book-chapter","created":{"date-parts":[[2005,9,19]],"date-time":"2005-09-19T12:32:39Z","timestamp":1127133159000},"page":"35-58","source":"Crossref","is-referenced-by-count":6,"title":["Filtering, Punctuation, Windows and Synopses"],"prefix":"10.1007","author":[{"given":"David","family":"Maier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter A.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minos","family":"Garofalakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Gibbons, P., Matias, Y, and Szegedy, M. (1999). Tracking join and self-join sizes in limited storage. In Proceedings of ACM PODS Conference, pages 10\u201320.","DOI":"10.1145\/303976.303978"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., and Szegedy, M. (1996). The space complexity of approximating the frequency moments. In Proceeding of ACMSTOC Conference, pages 20\u201329.","DOI":"10.1145\/237814.237823"},{"key":"3_CR3","unstructured":"Arasu, A., Babu, S., and Widom, J. (2003). The CQL continuous query language: semantic foundations and query execution. Stanford University TR No. 2003-67 (unpublished)."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Arasu, A. and Manku, G. S. (2004). Approximate counts and quantiles over sliding windows. In Proceedings of ACM PODS Conference, pages 286\u2013296.","DOI":"10.1145\/1055558.1055598"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1145\/1016028.1016032","volume":"29","author":"S. Babu","year":"2004","unstructured":"Babu, S., Srivastava, U., and Widom, J. (2004). Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. TODS, 29(3):545\u2013580.","journal-title":"TODS"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Carney, D., Cetintemel, Ugur, Chemiack, Mitch, Convey, Christian, Lee, Sangdon, Seidman, Greg, Stonebraker, Michael, Tatbul, Nesime, and Zdonik, Stanley B. (2002). Monitoring Streams-A New Class of Data Management Applications. In VLDB Conference, pages 215\u2013226.","DOI":"10.1016\/B978-155860869-6\/50027-5"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., and Farach-Colton, M. (2002). Finding frequent items in data streams. In Proceedings of ICALP Conference, pages 3\u201315.","DOI":"10.1007\/3-540-45465-9_59"},{"key":"3_CR8","unstructured":"Cisco Systems. (2001). Netflow Services Solutions Guide."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Considine, J., Li, F., Kollios, G., and Byers, J. (2004). Approximate aggregation techniques for sensor databases. In Proceedings of IEEEICDE Conference, pages 449\u2013460.","DOI":"10.1109\/ICDE.2004.1320018"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Das, A., Gehrke, J., and Riedewald, M. (2003). Approximate join processing over data streams. In Proceedings of ACMSIGMOD Conference, pages 40\u201351.","DOI":"10.1145\/872757.872765"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Das, A., Riedewald, M., and Gehrke, J. (2004). Approximation techniques for spatial data. In Proceedings of ACMSIGMOD Conference, pages 695\u2013706.","DOI":"10.1145\/1007568.1007646"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Datar, M., Gionis, A., Indyk, P., and Motwani, R. (2002). Maintaining Stream Statistics over Sliding Windows. In Proceedings of SODA Conference, pages 635\u2013644.","DOI":"10.1137\/S0097539701398363"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Dobra, Alin, Garofalakis, Minos, Gehrke, Johannes, and Rastogi, Rajeev (2002). Processing Complex Aggregate Queries over Data Streams. In Proceedings of ACMSIGMOD Conference, pages 61\u201372.","DOI":"10.1145\/564691.564699"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Dobra, Alin, Garofalakis, Minos, Gehrke, Johannes, and Rastogi, Rajeev (2004). Sketch-Based Multi-Query Processing over Data Streams. In Proceedings of EDBT Conference, pages 551\u2013568.","DOI":"10.1007\/978-3-540-24741-8_32"},{"key":"3_CR15","unstructured":"Feigenbaum, J., Kannan, S., Strauss, M., and Viswanathan, M. (1999). An approximate L1-difference algorithm for massive data streams. In Proc. IEEE FOCS Conference, page 501."},{"issue":"2","key":"3_CR16","first-page":"182","volume":"31","author":"P. Flajolet","year":"1995","unstructured":"Flajolet, P. and Martin, N. (1995). Probabilistic counting algorithms for data base applications. JCSS Journal, 31(2): 182\u2013209.","journal-title":"JCSS Journal"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Ganguly, S., Garofalakis, M., and Rastogi, R. (2003). Processing set expressions over continuous update streams. In Proceedings of ACMSIGMOD Conference, pages 265\u2013276.","DOI":"10.1145\/872757.872790"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Garofalakis, M. and Kumar, A. (2003). Correlating XML data streams using tree-edit distance embeddings. In Proceedings of ACM PODS Conference, pages 143\u2013154.","DOI":"10.1145\/773153.773168"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Gehrke, J., Korn, F., and Srivastava, D. (2001). On computing correlated aggregates over continual data streams. In Proceedings of ACM SIGMOD Conference, pages 13\u201324.","DOI":"10.1145\/376284.375665"},{"key":"3_CR20","unstructured":"Gibbons, P. (2001). Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proceedings of VLDB Conference, pages 541\u2013550."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Gibbons, P. and Tirthapura, S. (2002). Distributed streams algorithms for sliding windows. In Proceedings of ACM SPAA Conference, pages 63\u201372.","DOI":"10.1145\/564870.564880"},{"key":"3_CR22","unstructured":"Gilbert, A. C., Kotidis, Y., Muthukrishnan, S., and Strauss, M. (2001). Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In Proceedings of VLDB Conference, pages 79\u201388."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Gilbert, A. C., Guha, S., Indyk, P., Kotidis, Y, Muthukrishnan, S., and Strauss, M. (2002). Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of ACM STOC Conference, pages 389\u2013398.","DOI":"10.1145\/509907.509966"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Greenwald, M. B. and Khanna, S. (2001). Space-efficient online computation of quantile summaries. In Proceedings of ACM SIGMOD Conference, pages 58\u201366.","DOI":"10.1145\/376284.375670"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/cpe.546","volume":"13","author":"J. Hillston","year":"2001","unstructured":"Hillston, J. and Kloul, L. (2001). Performance investigation of an on-line auction system. Concurrency and Computation: Practice and Experience, 13:23\u201341.","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Indyk, P. (2000). Stable Distributions, Pseudorandom generators, embeddings, and data stream computation. In Proceedings of IEEEFOCS Conference, page 189.","DOI":"10.1109\/SFCS.2000.892082"},{"key":"3_CR27","unstructured":"Johnson, T., Cranor, C, Spatscheck, O., and Shkapenyuk, V. (2003). Gigascope: A stream database for network applications. In Proceedings of ACM SIGMOD Conference, pages 647\u2013651."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Kang, J., Naughton, J. F., and Viglas, S. D. (2003). Evaluating window joins over unbounded streams. In Proceedings of the International Conference on Data Engineering (ICDE).","DOI":"10.1109\/ICDE.2003.1260804"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Manku, G. S. and Motwani, R. (2002). Approximate frequency counts over data streams. In Proceedings of VLDB Conference, pages 346\u2013357.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"3_CR30","unstructured":"Rajasekar, A., Vernon, F., Hansen, T., Linquist, K., and Orcutt, J. (2004). Virtual object ring buffer: A framework for real-time data grid. In Proceedings of HDPC Conference."},{"key":"3_CR31","unstructured":"Reiss, F. and Hellerstein, J. M. (2004). Data triage: An adaptive architecture for load shedding in TelegraphCQ. Intel Research Berkeley Report IRB-TR-04-004."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Tatbul, N., Cetintemel, U., Zdonik, S., Cherniack, M., and Stonebraker, M. (2003). Load shedding in a data stream manager. In Proceedings of VLDB Conference, pages 309\u2013320.","DOI":"10.1016\/B978-012722442-8\/50035-5"},{"key":"3_CR33","unstructured":"Tucker, P. A. and Maier, D. (2003). Dealing with disorder. In MPDS Workshop."},{"issue":"3","key":"3_CR34","first-page":"555","volume":"15","author":"P. A. Tucker","year":"2003","unstructured":"Tucker, P. A., Maier, D., Fegaras, L., and Sheard, T. (2003). Exploiting punctuation semantics in continuous data streams. IEEE TKDE, 15(3):555\u2013568.","journal-title":"IEEE TKDE"},{"issue":"l","key":"3_CR35","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"J. S. Vitter","year":"1985","unstructured":"Vitter, J. S. (1985). Random sampling with a reservoir. ACM Trans. on Math. Software, 11(l):37\u201357.","journal-title":"ACM Trans. on Math. Software"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Wilschut, Annita N. and Apers, Peter M. G. (1991). Dataflow query execution in a parallel main-memory environment. In Proceedings of PDIS Conference, pages 68\u201377.","DOI":"10.1109\/PDIS.1991.183069"}],"container-title":["Advances in Database Systems","Stream Data Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-25229-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T04:49:21Z","timestamp":1557895761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-25229-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9780387243931","9780387252292"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/0-387-25229-0_3","relation":{},"ISSN":["1386-2944"],"issn-type":[{"type":"print","value":"1386-2944"}],"subject":[],"published":{"date-parts":[[2005]]}}}