State management and concurrency in event processing

ABSTRACT

State management in stream and event processing applications is a long-standing problem. There is a conflict between individual stream processing (SP) operators as transformational units, whose purpose is to generate business events, and (explicit) state that evolves with time. In the paper, we propose a new scalable design solution for this problem using functional state transformer (ST) component(s) combined with a traditional stream processor.

REFERENCES

• 1: Agha, G.: Concurrent object-oriented programming, Communications of the ACM, 33/9 (1990).
• 2: Armstrong, J. L.: Concurrent programming in Erlang (Second Edition), Prentice Hall (2005).
• 3: Henderson, F., Conway, T., Somogyi, Z., et al.: Mercury Reference Manual, http://www.cs.mu.oz.au/research/mercury/information/doc-release/reference_manual.pdf
• 4: Peyton Jones, S. L. and Launchbury, J.: State in Haskell, Lisp and Symbolic Computation 8(4), Dec 1995, pp 293--341.
• 5: Peyton Jones, S. L. et al: The Haskell 98 Language and Libraries: The Revised Report, Journal of Functional Programming 13, 1, (2003).
• 6: Wan, Z., Hudak, P.: Functional Reactive Programming from First Principles, in Proc. SIGPLAN'00, (2000).
• 7: Aleri FlexStreams, http://www.aleri.com/files/FlexStream.pdf: 2008.
• 8: Hwang, J.-H, Balazinska, M., et al: High-availability algorithms for distributed stream processing., In Proc. of the 21st Int. Conf. on Data Engineering (ICDE) (2005).
• 9: Sharon, G. and Etzion, O.: Event Processing Networks -- model and implementation. IBM System Journal, 47, 2, 321--334, (2008).

INDEX TERMS

Primary Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
      D.1.1 Applicative (Functional) Programming

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
      D.1.3 Concurrent Programming

General Terms:
Algorithms, Design, Languages, Performance, Theory

Keywords:
concurrency control, event and stream processing, functional approach, state management