Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
High-performance complex event processing over streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
What is "next" in event processing?
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient pattern matching over event streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Sequence Pattern Query Processing over Out-of-Order Event Streams
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
ZStream: a cost-based query processor for adaptively detecting composite events
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Microsoft CEP server and online behavioral targeting
Proceedings of the VLDB Endowment
Submodular Function Minimization under Covering Constraints
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Active complex event processing: applications in real-time health care
Proceedings of the VLDB Endowment
MaskIt: privately releasing user context streams for personalized mobile applications
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Utility-maximizing event stream suppression
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been adopted in a variety of applications, the privacy implications of event pattern reporting mechanisms have yet to be studied - a stark contrast to the significant amount of attention that has been devoted to privacy for relational systems. In this paper we present a privacy problem that arises when the system must support desired patterns (those that should be reported if detected) and private patterns (those that should not be revealed). We formalize this problem, which we term privacy-preserving, utility maximizing CEP (PP-CEP), and analyze its complexity under various assumptions. Our results show that this is a rich problem to study and shed some light on the difficulty of developing algorithms that preserve utility without compromising privacy.