{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:17:18Z","timestamp":1738217838444,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":98,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788485"},{"type":"electronic","value":"9783540788492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78849-2_3","type":"book-chapter","created":{"date-parts":[[2008,4,28]],"date-time":"2008-04-28T13:49:01Z","timestamp":1209390541000},"page":"10-25","source":"Crossref","is-referenced-by-count":3,"title":["Aggregate Computation over Data Streams"],"prefix":"10.1007","author":[{"given":"Xuemin","family":"Lin","sequence":"first","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Aduri, P., Tirthapura, S.: Range efficient computation of f $_{\\mbox{0}}$ over massive data streams. In: ICDE, pp. 32\u201343 (2005)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ahmad, Y., Berg, B., \u00c7etintemel, U., Humphrey, M., Hwang, J.-H., Jhingran, A., Maskey, A., Papaemmanouil, O., Rasin, A., Tatbul, N., Xing, W., Xing, Y., Zdonik, S.B.: Distributed operation in the borealis stream processing engine. In: SIGMOD, pp. 882\u2013884 (2005)","DOI":"10.1145\/1066157.1066274"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Jayram, T.S., Kumar, R., Sivakumar, D.: Approximate counting of inversions in a data stream. In: STOC, pp. 370\u2013379 (2002)","DOI":"10.1145\/509907.509964"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOCK, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Arasu, A., Manku, G.S.: Approximate counts and quantiles over sliding windows. In: PODS, pp. 286\u2013296 (2004)","DOI":"10.1145\/1055558.1055598"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: PODS (2002)","DOI":"10.1145\/543613.543615"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Babcock, B., Olston, C.: Distributed top-k monitoring. In: SIGMOD, pp. 28\u201339 (2003)","DOI":"10.1145\/872757.872764"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bandi, N., Agrawal, D., Abbadi, A.E.: Fast algorithms for heavy distinct hitters using associative memories. In: IEEE International Conference on Distributed Computing Systems(ICDCS), p. 6 (2007)","DOI":"10.1109\/ICDCS.2007.110"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bandi, N., Metwally, A., Agrawal, D., Abbadi, A.E.: Fast data stream algorithms using associative memories. In: SIGMOD, pp. 247\u2013256 (2007)","DOI":"10.1145\/1247480.1247510"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM, pp. 1\u201310 (2002)","DOI":"10.1007\/3-540-45726-7_1"},{"key":"3_CR11","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA, pp. 623\u2013632 (2002)"},{"key":"3_CR12","unstructured":"Bawa, M., Molina, H.G., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical report, Stanford University (2003)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: PODS, pp. 253\u2013262 (2006)","DOI":"10.1145\/1142351.1142388"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","first-page":"215","volume-title":"Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web","author":"D. Carney","year":"2003","unstructured":"Carney, D., \u00c7etintemel, U., Cherniack, M., Convey, C., Lee, S., Seidman, G., Stonebraker, M., Tatbul, N., Zdonik, S.B.: Monitoring streams - a new class of data management applications. In: Bressan, S., Chaudhri, A.B., Li Lee, M., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol.\u00a02590, pp. 215\u2013226. Springer, Heidelberg (2003)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C., Bergman, L.D., Castelli, V., Li, C.-S., Lo, M.-L., Smith, J.R.: The onion technique: Indexing for linear optimization queries. In: SIGMOD, pp. 391\u2013402 (2000)","DOI":"10.1145\/335191.335433"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 693\u2013703. Springer, Heidelberg (2002)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Chen, J., DeWitt, D.J., Tian, F., Wang, Y.: Niagaracq: A scalable continuous query system for internet databases. In: SIGMOD, pp. 379\u2013390 (2000)","DOI":"10.1145\/342009.335432"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci.\u00a055(3), 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 241\u2013252 (2003)","DOI":"10.1145\/872757.872787"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Considine, J., Li, F., Kollios, G., Byers, J.W.: Approximate aggregation techniques for sensor databases. In: ICDE, pp. 449\u2013460 (2004)","DOI":"10.1109\/ICDE.2004.1320018"},{"key":"3_CR21","unstructured":"Coppersmith, D., Kumar, R.: An improved data stream algorithm for frequency moments. In: SODA, pp. 151\u2013156 (2004)"},{"key":"3_CR22","unstructured":"Cormode, G., Garofalakis, M.N.: Sketching streams through the net: Distributed approximate query tracking. In: VLDB, pp. 13\u201324 (2005)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.N., Muthukrishnan, S., Rastogi, R.: Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In: SIGMOD, pp. 25\u201336 (2005)","DOI":"10.1145\/1066157.1066161"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Finding hierarchical heavy hitters in data streams. In: VLDB, pp. 464\u2013475 (2003)","DOI":"10.1016\/B978-012722442-8\/50048-3"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Diamond in the rough: Finding hierarchical heavy hitters in multi-dimensional data. In: SIGMOD, pp. 155\u2013166 (2004)","DOI":"10.1145\/1007568.1007588"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Effective computation of biased quantiles over data streams. In: ICDE, pp. 20\u201331 (2005)","DOI":"10.1109\/ICDE.2005.55"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Space- and time-efficient deterministic algorithms for biased quantiles over data streams. In: PODS, pp. 263\u2013272 (2006)","DOI":"10.1145\/1142351.1142389"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. In: PODS, pp. 296\u2013306 (2003)","DOI":"10.1145\/773153.773182"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-24698-5_7","volume-title":"LATIN 2004: Theoretical Informatics","author":"G. Cormode","year":"2004","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: The count-min sketch and its applications. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 29\u201338. Springer, Heidelberg (2004)"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Space efficient mining of multigraph streams. In: PODS, pp. 271\u2013282 (2005)","DOI":"10.1145\/1065167.1065201"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S., Zhuang, W.: What\u2019s different: Distributed, continuous monitoring of duplicate-resilient aggregates on data streams. In: ICDE, p. 57 (2006)","DOI":"10.1109\/ICDE.2006.173"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Cranor, C.D., Johnson, T., Spatscheck, O., Shkapenyuk, V.: Gigascope: A stream database for network applications. In: SIGMOD, pp. 647\u2013651 (2003)","DOI":"10.1145\/872757.872838"},{"key":"3_CR33","unstructured":"Das, G., Gunoplulos, D., Koudas, N., Sarkas, N.: Ad-hoc top-k query answering for data streams. In: VLDB (2007)"},{"key":"3_CR34","unstructured":"Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: VLDB, pp. 451\u2013462 (2006)"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows (extended abstract). In: SODA, pp. 635\u2013644 (2002)","DOI":"10.1137\/S0097539701398363"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms - ESA 2002","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 348\u2013360. Springer, Heidelberg (2002)"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/978-3-540-39658-1_55","volume-title":"Algorithms - ESA 2003","author":"M. Durand","year":"2003","unstructured":"Durand, M., Flajolet, P.: Loglog counting of large cardinalities (extended abstract). In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 605\u2013617. Springer, Heidelberg (2003)"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications(SIGCOMM) (2002)","DOI":"10.1145\/633025.633056"},{"issue":"3","key":"3_CR40","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C. Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst.\u00a021(3), 270\u2013313 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high speed links. In: ACM SIGCOMM Conference on Internet Measurement, pp. 153\u2013166 (2003)","DOI":"10.1145\/948205.948225"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Fagin, R.: Combining fuzzy information from multiple systems. In: PODS, pp. 216\u2013226 (1996)","DOI":"10.1145\/237661.237715"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Fagin, R.: Fuzzy queries in multimedia database systems. In: PODS, pp. 1\u201310 (1998)","DOI":"10.1145\/275487.275488"},{"issue":"1","key":"3_CR44","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1006\/jcss.1998.1600","volume":"58","author":"R. Fagin","year":"1999","unstructured":"Fagin, R.: Combining fuzzy information from multiple systems. J. Comput. Syst. Sci.\u00a058(1), 83\u201399 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)","DOI":"10.1145\/375551.375567"},{"issue":"2","key":"3_CR46","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci.\u00a031(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-74208-1_35","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Ganguly","year":"2007","unstructured":"Ganguly, S., Cormode, G.: On Estimating Frequency Moments of Data Streams. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 479\u2013493. Springer, Heidelberg (2007)"},{"key":"3_CR48","unstructured":"Gibbons, P.B.: Distinct sampling for highly-accurate answers to distinct values queries and event reports. In: VLDB, pp. 541\u2013550 (2001)"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: SPAA, pp. 281\u2013291 (2001)","DOI":"10.1145\/378580.378687"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B., Tirthapura, S.: Distributed streams algorithms for sliding windows. In: SPAA, pp. 63\u201372 (2002)","DOI":"10.1145\/564870.564880"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: How to summarize the universe: Dynamic maintenance of quantiles. In: VLDB, pp. 454\u2013465 (2002)","DOI":"10.1016\/B978-155860869-6\/50047-0"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Golab, L., DeHaan, D., Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Identifying frequent items in sliding windows over on-line packet streams. In: ACM SIGCOMM Conference on Internet Measurement, pp. 173\u2013178 (2003)","DOI":"10.1145\/948224.948227"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Govindaraju, N.K., Raghuvanshi, N., Manocha, D.: Fast and approximate stream mining of quantiles and frequencies using graphics processors. In: SIGMOD, pp. 611\u2013622 (2005)","DOI":"10.1145\/1066157.1066227"},{"key":"3_CR54","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: SIGMOD, pp. 58\u201366 (2001)","DOI":"10.1145\/375663.375670"},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Power-conserving computation of order-statistics over sensor networks. In: PODS, pp. 275\u2013285 (2004)","DOI":"10.1145\/1055558.1055597"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"Guha, S., McGregor, A.: Approximate quantiles and the order of the stream. In: PODS, pp. 273\u2013279 (2006)","DOI":"10.1145\/1142351.1142390"},{"key":"3_CR57","unstructured":"Gupta, A., Zane, F.: Counting inversions in lists. In: SODA, pp. 253\u2013254 (2003)"},{"key":"3_CR58","unstructured":"Hadjieleftheriou, M., Byers, J.W., Kollios, G.: Robust sketching and aggregation of distributed data streams. Technical report. Boston University (2005)"},{"issue":"2","key":"3_CR59","first-page":"7","volume":"23","author":"J.M. Hellerstein","year":"2000","unstructured":"Hellerstein, J.M., Franklin, M.J., Chandrasekaran, S., Deshpande, A., Hildrum, K., Madden, S., Raman, V., Shah, M.A.: Adaptive query processing: Technology in evolution. IEEE Data Eng. Bull.\u00a023(2), 7\u201318 (2000)","journal-title":"IEEE Data Eng. Bull."},{"key":"3_CR60","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Shrivastava, N., Suri, S., T\u00f3th, C.D.: Space complexity of hierarchical heavy hitters in multi-dimensional data streams. In: PODS, pp. 338\u2013347 (2005)","DOI":"10.1145\/1065167.1065211"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y.: Prefer: A system for the efficient execution of multi-parametric ranked queries. In: SIGMOD, pp. 259\u2013270 (2001)","DOI":"10.1145\/375663.375690"},{"key":"3_CR62","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.P.: Optimal approximations of the frequency moments of data streams. In: STOCK, pp. 202\u2013208 (2005)","DOI":"10.1145\/1060590.1060621"},{"key":"3_CR63","doi-asserted-by":"crossref","unstructured":"Jin, C., Qian, W., Sha, C., Yu, J.X., Zhou, A.: Dynamically maintaining frequent items over a data stream. In: CIKM, pp. 287\u2013294 (2003)","DOI":"10.1145\/956863.956918"},{"key":"3_CR64","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/11564126_54","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"W. Jin","year":"2005","unstructured":"Jin, W., Ester, M., Han, J.: Efficient processing of ranked queries with sweeping selection. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 527\u2013535. Springer, Heidelberg (2005)"},{"key":"3_CR65","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R.M. Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst.\u00a028, 51\u201355 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR66","doi-asserted-by":"crossref","unstructured":"Keralapura, R., Cormode, G., Ramamirtham, J.: Communication-efficient distributed monitoring of thresholded counts. In: SIGMOD, pp. 289\u2013300 (2006)","DOI":"10.1145\/1142473.1142507"},{"key":"3_CR67","series-title":"Lecture Notes in Computer Science","first-page":"814","volume-title":"Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web","author":"F. Korn","year":"2003","unstructured":"Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: Bressan, S., Chaudhri, A.B., Li Lee, M., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol.\u00a02590, pp. 814\u2013825. Springer, Heidelberg (2003)"},{"key":"3_CR68","doi-asserted-by":"crossref","unstructured":"Lee, L.K., Ting, H.F.: A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In: PODS, pp. 290\u2013297 (2006)","DOI":"10.1145\/1142351.1142393"},{"key":"3_CR69","doi-asserted-by":"crossref","unstructured":"Lin, X., Lu, H., Xu, J., Yu, J.X.: Continuously maintaining quantile summaries of the most recent n elements over a data stream. In: ICDE, pp. 362\u2013374 (2004)","DOI":"10.1109\/ICDE.2004.1320011"},{"issue":"5","key":"3_CR70","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/TKDE.2006.73","volume":"18","author":"X. Lin","year":"2006","unstructured":"Lin, X., Xu, J., Zhang, Q., Lu, H., Yu, J.X., Zhou, X., Yuan, Y.: Approximate processing of massive continuous quantile queries over high-speed data streams. IEEE Trans. Knowl. Data Eng.\u00a018(5), 683\u2013698 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR71","doi-asserted-by":"crossref","unstructured":"Manganelli, S., Engle, R.: Value at risk models in finance. In: European Central Bank Working Paper Series No. 75 (2001)","DOI":"10.2139\/ssrn.356220"},{"key":"3_CR72","doi-asserted-by":"crossref","unstructured":"Manjhi, A., Nath, S., Gibbons, P.B.: Tributaries and deltas: Efficient and robust aggregation in sensor network streams. In: SIGMOD, pp. 287\u2013298 (2005)","DOI":"10.1145\/1066157.1066191"},{"key":"3_CR73","doi-asserted-by":"crossref","unstructured":"Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (recently) frequent items in distributed data streams. In: ICDE, pp. 767\u2013778 (2005)","DOI":"10.1109\/ICDE.2005.68"},{"key":"3_CR74","series-title":"Lecture Notes in Computer Science","first-page":"346","volume-title":"Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web","author":"G.S. Manku","year":"2003","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Bressan, S., Chaudhri, A.B., Li Lee, M., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol.\u00a02590, pp. 346\u2013357. Springer, Heidelberg (2003)"},{"key":"3_CR75","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Approximate medians and other quantiles in one pass and with limited memory. In: SIGMOD, pp. 426\u2013435 (1998)","DOI":"10.1145\/276304.276342"},{"key":"3_CR76","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Random sampling techniques for space efficient online computation of order statistics of large datasets. In: SIGMOD, pp. 251\u2013262 (1999)","DOI":"10.1145\/304182.304204"},{"key":"3_CR77","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"A. Metwally","year":"2004","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 398\u2013412. Springer, Heidelberg (2004)"},{"issue":"2","key":"3_CR78","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Program.\u00a02(2), 143\u2013152 (1982)","journal-title":"Sci. Comput. Program."},{"key":"3_CR79","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: SIGMOD, pp. 635\u2013646 (2006)","DOI":"10.1145\/1142473.1142544"},{"key":"3_CR80","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci.\u00a012, 315\u2013323 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR81","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. In: SODA, pp. 413\u2013413 (2003)"},{"key":"3_CR82","doi-asserted-by":"crossref","unstructured":"Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys, pp. 250\u2013262 (2004)","DOI":"10.1145\/1031495.1031525"},{"issue":"1","key":"3_CR83","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D. Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst.\u00a030(1), 41\u201382 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR84","unstructured":"Poosala, V., Ioannidis, Y.E.: Estimation of query-result distribution and its application in parallel-join load balancing. In: VLDB, pp. 448\u2013459 (1996)"},{"key":"3_CR85","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 (2004)","DOI":"10.1145\/1031495.1031524"},{"key":"3_CR86","unstructured":"STREAM stream data manager, http:\/\/www-db.stanford.edu\/stream\/sqr"},{"key":"3_CR87","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/11663881_17","volume-title":"Foundations of Information and Knowledge Systems","author":"Y. Tao","year":"2006","unstructured":"Tao, Y., Hadjieleftheriou, M.: Processing ranked queries with the minimum space. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol.\u00a03861, pp. 294\u2013312. Springer, Heidelberg (2006)"},{"issue":"3","key":"3_CR88","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.is.2005.12.001","volume":"32","author":"Y. Tao","year":"2007","unstructured":"Tao, Y., Hristidis, V., Papadias, D., Papakonstantinou, Y.: Branch-and-bound processing of ranked queries. Inf. Syst.\u00a032(3), 424\u2013445 (2007)","journal-title":"Inf. Syst."},{"key":"3_CR89","doi-asserted-by":"crossref","unstructured":"Tao, Y., Xiao, X., Pei, J.: Efficient skyline and top-k retrieval in subspaces. IEEE Trans. Knowl. Data Eng (to appear, 2007)","DOI":"10.1109\/TKDE.2007.1051"},{"key":"3_CR90","doi-asserted-by":"crossref","unstructured":"Tsaparas, P., Palpanas, T., Kotidis, Y., Koudas, N., Srivastava, D.: Ranked join indices. In: ICDE, pp. 277\u2013288 (2003)","DOI":"10.1109\/ICDE.2003.1260799"},{"key":"3_CR91","doi-asserted-by":"crossref","unstructured":"Venkataraman, S., Song, D.X., Gibbons, P.B., Blum, A.: New streaming algorithms for fast detection of superspreaders. In: NDSS (2005)","DOI":"10.21236\/ADA461026"},{"issue":"2","key":"3_CR92","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"K.-Y. Whang","year":"1990","unstructured":"Whang, K.-Y., Zanden, B.T.V., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst.\u00a015(2), 208\u2013229 (1990)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR93","unstructured":"Xin, D., Chen, C., Han, J.: Towards robust indexing for ranked queries. In: VLDB, pp. 235\u2013246 (2006)"},{"issue":"3","key":"3_CR94","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/601858.601861","volume":"31","author":"Y. Yao","year":"2002","unstructured":"Yao, Y., Gehrke, J.: The cougar approach to in-network query processing in sensor networks. SIGMOD Record\u00a031(3), 9\u201318 (2002)","journal-title":"SIGMOD Record"},{"key":"3_CR95","unstructured":"Yi, K., Yu, H., Yang, J., Xia, G., Chen, Y.: Efficient maintenance of materialized top-k views. In: ICDE, pp. 189\u2013200 (2003)"},{"key":"3_CR96","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Lin, X., Xu, J., Korn, F., Wang, W.: Space-efficient relative error order sketch over data streams. In ICDE, page\u00a051 (2006)","DOI":"10.1109\/ICDE.2006.145"},{"key":"3_CR97","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Lin, X., Yuan, Y., Kitsuregawa, M., Zhou, X., Yu, J.X.: Summarizing order statistics over data streams with duplicates. In: ICDE, pp. 1329\u20131333 (2007)","DOI":"10.1109\/ICDE.2007.369004"},{"key":"3_CR98","series-title":"Lecture Notes in Computer Science","first-page":"358","volume-title":"Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web","author":"Y. Zhu","year":"2003","unstructured":"Zhu, Y., Shasha, D.: Statstream: Statistical monitoring of thousands of data streams in real time. In: Bressan, S., Chaudhri, A.B., Li Lee, M., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol.\u00a02590, pp. 358\u2013369. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Progress in WWW Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78849-2_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T22:47:13Z","timestamp":1738190833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78849-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788485","9783540788492"],"references-count":98,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78849-2_3","relation":{},"subject":[]}}