Dynamic adaptive data structures for monitoring data streams

Aguilar-Saborit, 2006, Dynamic count filters, SIGMOD Record, 35, 26, 10.1145/1121995.1122000 N. Alon, P.B. Gibbons, Y. Matias, M. Szegedy, Tracking join and self-join sizes in limited storage, in: PODS’99: Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 1999, pp. 10–20. N. Alon, Y. Matias, M. Szegedy, The space complexity of approximating the frequency moments, in: STOC’96: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 20–29. Babu, 2001, Continuous queries over data streams, SIGMOD Record, 30, 109, 10.1145/603867.603884 Bernstein, 1981, Using semi-joins to solve relational queries, J. ACM, 28, 25, 10.1145/322234.322238 Bloom, 1970, Space/time trade-offs in hash coding with allowable errors, Commun. ACM, 13, 422, 10.1145/362686.362692 L. Breslau, P. Cao, F. Fan, G. Phillips, S. Shenker, Web caching and zipf-like distributions: evidence and implications, in: Proceedings of the IEEE Infocom Conference, 1999. A. Broder, M. Mitzenmacher, Network applications of bloom filters: a survey, in: Proceedings of the Allerton Conference, 2002. Chen, 1997, On applying hash filters to improving the execution of multi-join queries, VLDB J., 6, 121, 10.1007/s007780050036 S. Cohen, Y. Matias, Spectral bloom filters, in: SIGMOD’03: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2003, pp. 241–252. G. Cormode, S. Muthukrishnan, Summarizing and mining skewed data streams, 2005. M.E. Crovella, M.S. Taqqu, A. Bestavros, Heavy-tailed probability distributions in the world wide web (1998) 3–25. D.J. DeWitt, R.H. Gerber, G. Graefe, M.L. Heytens, K.B. Kumar, M. Muralikrishna, Gamma – a high performance dataflow database machine, in: VLDB’86: Proceedings of the 12th International Conference on Very Large Data Bases, 1986, pp. 228–237. D.J. DeWitt, S. Ghanderaizadeh, D. Schneider, A performance analysis of the gamma database machine, in: SIGMOD’88: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1988, pp. 350–360. S. Dharmapurikar, P. Krishnamurthy, D.E. Taylor, Longest prefix matching using bloom filters, in: SIGCOMM’03: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2003, pp. 201–212. A. Dobra, M. Garofalakis, J. Gehrke, R. Rastogi, Processing complex aggregate queries over data streams, in: SIGMOD’02: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2002, pp. 61–72. Fan, 2000, Summary cache: a scalable wide-area web cache sharing protocol, IEEE Trans. Networking, 8, 281, 10.1109/90.851975 M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, J.D. Ullman, Computing iceberg queries efficiently, in: VLDB’98: Proceedings of the 24rd International Conference on Very Large Data Bases, 1998, pp. 299–310. S. Ganguly, M.N. Garofalakis, A. Kumar, R. Rastogi, Join-distinct aggregate estimation over update streams, in: PODS’05: Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005, pp. 259–270. A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss, Surfing wavelets on streams: one-pass summaries for approximate aggregate queries, in: VLDB’01: Proceedings of the 27th International Conference on Very Large Data Bases, 2001, pp. 79–88. G. Graefe, Sort-merge-join: an idea whose time has(h) passed? in: ICDE’94: Proceedings of the 10th International Conference on Data Engineering, 1994, pp. 406–417. A. Kemper, D. Kossmann, C.Wiesner, Generalised hash teams for join and group-by, in: VLDB’99: Proceedings of the 25th International Conference on Very Large Data Bases, 1999, pp. 30–41. J. Ledlie, L. Serban, D. Toncheva, Scaling filename queries in a large-scale distributed file systems, TR-03-02, January, 2002. Z. Li, K.A. Ross, Better Semijoins using tuple bit-vectors, Columbia University Technical Report CUCS-010-94, 1994. L.F. Mackert, G.M. Lohman, R∗ optimizer validation and performance evaluation for distributed queries, in: VLDB’86: Proceedings of the 12th International Conference on Very Large Data Bases, 1986, pp. 149–159. G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: VLDB’02: Proceedings of the 28th International Conference on Very Large Data Bases, 2002, pp. 346–357. Mitzenmacher, 2002, Compressed bloom filters, IEEE/ACM Trans. Networking, 10, 604, 10.1109/TNET.2002.803864 Mullin, 1983, A second look at bloom filters, Commun. ACM, 26, 570, 10.1145/358161.358167 Ramakrishna, 1989, Practical performance of bloom filters and parallel free-text searching, Commun. ACM, 32, 1237, 10.1145/67933.67941 W. Wang, H. Jiang, H. Lu, J.X. Yu, Bloom histogram: path selectivity estimation for XML data with updates, in: VLDB’04: Proceedings of the 30th International Conference on Very Large Data Bases, 2004, pp. 240–251.