On the complexity of privacy-preserving complex event processing

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2011, Pages 165-174

  He, Yeye ^a   Barman, Siddharth ^a   Wang, Di ^b   Naughton, Jeffrey F ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

CEP stream processing; Complexity; Privacy

Indexed keywords

COMPLEX EVENT PROCESSING; COMPLEXITY; EVENT PATTERN; EVENT STREAMS; PRIVACY PRESERVING; PRIVACY PROBLEMS; RELATIONAL SYSTEMS; STREAM PROCESSING; STREAM PROCESSING SYSTEMS;

PARTICULATE EMISSIONS;

RELATIONAL DATABASE SYSTEMS;

EID: 79960189403     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989304     Document Type: Conference Paper

References (22)

1. Coral8: www.coral8.com.
2. Streambase: www.streambase.com.
3. Streaminsight: http://www.microsoft.com/sqlserver/2008/en/us/r2- complexevent.aspx.
4. J. Agrawal, Y. Diao, D. Gyllstrom, and N. Immerman. Efficient pattern matching over event streams. In SIGMOD, 2008.
5. M. H. Ali and C. G. et al. Microsoft cep server and online behavioral targeting. In VLDB, 2009.
6. N. Bansal, N. Korula, V. Nagarajan, and A. Srinivasan. On k-column sparse packing programs. CoRR, 0908.2256, 2009.
7. R. S. Barga, J. Goldstein, M. Ali, and M. Hong. Consistent streaming through time: A vision for event stream processing. 2007.
8. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45 (4), 1998.
9. S. Fujishige. Submodular functions and optimization. 2005.
10. D. Gyllstrom, E. Wu, H.-J. Chae, Y. Diao, P. Stahlberg, and G. Anderson. SASE: Complex event processing over streams. In CIDR, 2007.
11. S. Iwata and K. Nagano. Submodular function minimization under covering constraints. In FOCS, 2009.
12. P. Kall and S. W. Wallace. Stochastic Programming. Wiley, 1994.
13. C. Koufogiannakis and N. E. Young. Greedy $δ$- approximation algorithm for covering with arbitrary constraints and submodular cost. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I, pages 634-652, Berlin, Heidelberg, 2009. Springer-Verlag.
14. E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik. Quantitative System Performance. Prentice Hall, 1984.
15. H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operation Research, 1983.
16. M. Liu, M. Li, D. Golovnya, E. A. Rundensteiner, and K. Claypool. Sequence pattern query processing over out-of-order event streams. In ICDE, 2009.
17. Y. Mei and S. Madden. Zstream: A cost-based query processor for adaptively detecting composite events. In SIGMOD, 2009.
18. D. Pritchard and D. Chakrabarty. Approximability of sparse integer programs. CoRR, 0904.0859, 2009.
19. L. Trevisan. Inapproximability of combinatorial optimization problems. Technical report, University of California Berkeley, 2004.
20. D. Wang, E. Rundensteiner, and R. Ellison. Active complex event processing for realtime health care. In VLDB, 2010.
21. W. White, M. Riedewald, J. Gehrke, and A. Demers. What is "next" in event processing? In PODS, 2007.
22. E. Wu, Y. Diao, and S. Rizvi. High-performance complex event processing over streams. In SIGMOD, 2006.