Small synopses for group-by query verification on outsourced data streams

ACM Transactions on Database Systems

Volumn 34, Issue 3, 2009, Pages

  Yi, Ke ^a   Li, Feifei ^b   Cormode, Graham ^c   Hadjieleftheriou, Marios ^c   Kollios, George ^d   Srivastava, Divesh ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b FLORIDA STATE UNIVERSITY   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d BOSTON UNIVERSITY   (United States)

Author keywords

Data streams; Outsourcing; Synopses

Indexed keywords

COLLISION-RESISTANT HASH FUNCTIONS; CRYPTOGRAPHIC PRIMITIVES; DATA OUTSOURCING; DATA STREAM; DATA STREAMS; EMPIRICAL EVALUATIONS; LIVE NETWORK TRAFFIC; NEW SOLUTIONS; PROBABILISTIC TECHNIQUE; PROBABILITY OF FAILURE; QUERY RESULTS; SEMANTIC LOAD SHEDDING; STREAMING DATA; SUM-QUERY; SYNOPSES;

HASH FUNCTIONS; INTERNET; OUTSOURCING; SERVERS;

DATA COMMUNICATION SYSTEMS;

EID: 70349124128     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1567274.1567277     Document Type: Article

References (54)

1. ABADI, D., AHMAD, Y., BALAZINSKA, M., C? ETINTEMEL, U., CHERNIACK, M., HWANG, J., LINDNER, W., MASKEY, A., RASIN, A., RYVKINA, E., TATBUL, N., XING, Y., AND ZDONIK, S. 2005. The design of the Borealis stream processing engine. In Proceedings of the Biennial Conference on Innovative Data Systems Research.
2. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the ACM Symposium on Theory of Computation, 20-29.
3. ARASU, A., BABCOCK, B., BABU, S., DATAR, M., ITO, K., NISHIZAWA, I., ROSENSTEIN, J., ANDWIDOM, J. 2003. STREAM: The Stanford stream data manager. IEEE Data Engin. Bull. 26, 1, 19-26.
4. ARASU, A. AND MANKU, G. S. 2004. Approximate counts and quantiles over sliding windows. In Proceedings of the ACM Symposium on Principles of Database Systems, 286-296.
5. ARLITT, M. AND JIN, T. ITA, 1998 world cupWeb site access logs. http://www.acm.org/ sigcomm/ITA/.
6. BABCOCK, B., BABU, S., DATAR, M., MOTWANI, R., AND WIDOM, J. 2002. Models and issues in data stream systems. In Proceedings of the ACM Symposium on Principles of Database Systems.
7. BABCOCK, B., DATAR, M., AND MOTWANI, R. 2004. Load shedding for aggregation queries over data streams. In Proceedings of the IEEE International Conference on Data Engineering, 350-361.
8. BABCOCK, B., DATAR, M., MOTWANI, R., AND O?CALLAGHAN, L. 2003. Maintaining variance and kmedians over data stream windows. In Proceedings of the ACM Symposium on Principles of Database Systems, 234-243.
9. BAR-YOSSEF, Z., JAYRAM, T. S., KUMAR, R., SIVAKUMAR, D., AND TREVISAN, L. 2002. Counting distinct elements in a data stream. In Proceedings of the International Workshop on Randomization and Approximation Techniques (RANDOM), 1-10.
10. BELLARE, M., GOLDREICH, O., AND GOLDWASSER, S. 1994. Incremental cryptography: The case of hashing and signing. In Proceedings of the Conference on Advances in Cryptology (CRYPTO), 216-233.
11. BELLARE, M., GUERIN, R., AND ROGAWAY, P. 1995. Xor macs: New methods for message authentication using finite pseudorandom functions. In Proceedings of the Conference on Advances in Cryptology (CRYPTO), 15-28.
12. BERTINO, E., CARMINATI, B., FERRARI, E., THURAISINGHAM, B., AND GUPTA, A. 2004. Selective and authentic third-party distribution of XML documents. IEEE Trans. Knowl. Data Engin. 16, 10, 1263-1278.
13. CARNEY, D., CETINTEMEL, U., CHERNIACK, M., CONVEY, C., LEE, S., SEIDMAN, G., STONEBRAKER, M., TATBUL, N., AND ZDONIK, S. 2003. Monitoring streams-A new class of data management applications. In Proceedings of the International Conference on Very Large Databases, 215-226.
14. CHAN, H., PERRIG, A., AND SONG, D. 2006. Secure hierarchical in-network aggregation in sensor networks. In Proceedings of the ACM Conference on Computer and Communications Security, 278-287. (Pubitemid 47131376)
15. CHANDRASEKARAN, S., COOPER, O., DESHPANDE, A., FRANKLIN, M. J., HELLERSTEIN, J. M., HONG, W., KRISHNAMURTHY, S., MADDEN, D., RAMAN, V., REISS, F., AND SHAH, M. A. 2003. Telegraph CQ: Continuous dataflow processing for an uncertain world. In Proceedings of the Biennial Conference on Innovative Data Systems Research.
16. CORMODE, G. AND MUTHUKRISHNAN, S. 2003. What?s hot and what?s not: Tracking most frequent items dynamically. In Proceedings of the ACM Symposium on Principles of Database Systems, 296-306.
17. CORMODE, G. AND MUTHUKRISHNAN, S. 2005. An improved data stream summary: The count-min sketch and its applications. J. Algor. 55, 1, 58-75.
18. CORMODE, G., MUTHUKRISHNAN, S., AND ROZENBAUM, I. 2005. Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In Proceedings of the International Conference on Very Large Databases, 25-36.
19. CRANOR, C., JOHNSON, T., SPATSCHECK, O., AND SHKAPENYUK, V. 2003. Gigascope: A stream database for internet databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 647-651.
20. DATAR, M., GIONIS, A., INDYK, P., ANDMOTWANI, R. 2002. Maintaining stream statistics over sliding windows. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 635-644.
21. DEVANBU, P., GERTZ, M., MARTEL, C., AND STUBBLEBINE, S. 2003. Authentic data publication over the internet. J. Comput. Secur. 11, 3, 291-314.
22. FLAJOLET, P. ANDMARTIN, G. N. 1985. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31, 2, 182-209.
23. FREIVALDS, R. 1979. Fast probabilistic algorithms. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, 57-69.
24. GANGULY, S., GAROFALAKIS, M., AND RASTOGI, R. 2004. Tracking set-expression cardinalities over continuous update streams. The VLDB J. 13, 4, 354-369.
25. GAROFALAKIS, M., HELLERSTEIN, J. M., AND MANIATIS, P. 2007. Proof sketches: Verifiable in-network aggregation. In Proceedings of the IEEE International Conference on Data Engineering.
26. GILBERT, A. C., KOTIDIS, Y., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002. How to summarize the universe: Dynamic maintenance of quantiles. In Proceedings of the International Conference on Very Large Databases, 454-465.
27. GREENWALD, M. AND KHANNA, S. 2001. Space-Efficient online computation of quantile summaries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 58-66.
28. HACIGUMUS, H., IYER, B. R., ANDMEHROTRA, S. 2002. Providing database as a service. In Proceedings of the IEEE International Conference on Data Engineering, 29-40.
29. HAMMAD, M. A., MOKBEL, M. F., ALI, M. H., AREF, W. G., CATLIN, A. C., ELMAGARMID, A. K., ELTABAKH, M., ELFEKY, M. G., GHANEM, T. M., GWADERA, R., ILYAS, I. F., MARZOUK, M., AND XIONG, X. 2004. Nile: A query processing engine for data streams. In Proceedings of the IEEE International Conference on Data Engineering, 851.
30. INDYK, P. AND WOODRUFF, D. 2005. Optimal approximations of the frequency moments of data streams. In Proceedings of the ACM Symposium on Theory of Computation.
31. KARP, R. M., SHENKER, S., AND PAPADIMITRIOU, C. H. 2003. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Datab. Syst. 28, 1, 51-55.
32. KNUTH, D. E. 1997. The Art of Computer Programming. Addison-Wesley.
33. KUSHILEVITZ, E. AND NISAN, N. 1997. Communication Complexity. Cambridge University Press.
34. LI, F., CHANG, Q., KOLLIOS, G., AND BESTAVROS, A. 2006a. Characterizing and exploiting reference locality in data stream applications. In Proceedings of the IEEE International Conference on Data Engineering.
35. LI, F., HADJIELEFTHERIOU, M., KOLLIOS, G., AND REYZIN, L. 2006b. Dynamic authenticated index structures for outsourced databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 121-132.
36. LI, F., YI, K., HADJIELEFTHERIOU, M., AND KOLLIOS, G. 2007. Proof-Infused streams: Enabling authentication of sliding window queries on streams. In Proceedings of the International Conference on Very Large Databases.
37. MANKU, G. S. AND MOTWANI, R. 2002. Approximate frequency counts over data streams. In Proceedings of the International Conference on Very Large Databases, 346-357.
38. MARTEL, C., NUCKOLLS, G., DEVANBU, P., GERTZ, M., KWONG, A., AND STUBBLEBINE, S. 2004. A general model for authenticated data structures. Algorithmica 39, 1, 21-41.
39. METWALLY, A., AGRAWAL, D., AND ABBADI, A. E. 2006. An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans. Datab. Syst. 31, 3, 1095-1133.
40. MOTWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press.
41. MUTHUKRISHNAN, S. 2003. Data Streams: Algorithms and Applications. www.cs.rutgers.edu/~mathu/stream-1-1.ps
42. NAGELL, T. 1981. Introduction to Number Theory, 2nd ed. Chelsea Publishing Company.
43. PANG, H., JAIN, A., RAMAMRITHAM, K., AND TAN, K.-L. 2005. Verifying completeness of relational query results in data publishing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 407-418.
44. PANG, H. AND TAN, K.-L. 2004. Authenticating query results in edge computing. In Proceedings of the IEEE International Conference on Data Engineering, 560-571.
45. PAPADOPOULOS, S., YANG, Y., AND PAPADIAS, D. 2007. CADS: Continuous authentication on data streams. In Proceedings of the International Conference on Very Large Databases, 135-146.
46. RUSU, F. AND DOBRA, A. 2007. Pseudo-Random number generation for sketch-based estimations. ACM Trans. Database Syst. 32, 2.
47. SCHWARTZ, J. T. 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 4, 701-717.
48. TATBUL, N., CETINTEMEL, U., ZDONIK, S., CHERNIACK, M., AND STONEBRAKER, M. 2003. Load shedding in a data stream manager. In Proceedings of the International Conference on Very Large Databases, 309-320.
49. TATBUL, N. AND ZDONIK, S. 2006. Window-Aware load shedding for aggregation queries over data streams. In Proceedings of the International Conference on Very Large Databases, 799-810.
50. THORUP, M. 2000. Even strongly universal hashing is pretty fast. In Proceedings of the ACMSIAM Symposium on Discrete Algorithms.
51. WEGMAN, M. N. AND CARTER, J. L. 1981. New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22, 3.
52. YI, K., LI, F., HADJIELEFTHERIOU, M., KOLLIOS, G., AND SRIVASTAVA, D. 2008. Randomized synopses for query assurance on data streams. In Proceedings of the IEEE International Conference on Data Engineering.
53. ZHANG, R., KOUDAS, N., OOI, B. C., AND SRIVASTAVA, D. 2005. Multiple aggregations over data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 299-310.
54. ZHAO, Q., XU, J., AND LIU, Z. 2006. Design of a novel statistics counter architecture with optimal space and time efficiency. In Proceedings of the Conference on ACM SIGMETRICS, 323-334.