• DocumentCode
    3079027
  • Title

    Management of composite event for active database rule scheduling

  • Author

    Jin, Ying

  • Author_Institution
    Comput. Sci. Dept., California State Univ., Sacramento, CA, USA
  • fYear
    2009
  • fDate
    10-12 Aug. 2009
  • Firstpage
    300
  • Lastpage
    304
  • Abstract
    Active database rules provide event management capability to database systems by signaling events and handling events automatically. Active rules play important roles in data management such as database integrity checking and database integration. Our past research has reported an active rule scheduling algorithm, named IRS, to schedule the execution of concurrently triggered rules to achieve the confluence property. The confluence property allows rule execution to produce the same final result regardless of the execution order of simultaneously triggered rules. The IRS algorithm schedules rules at static time with rules triggered by primitive events. This paper describes our research on extending the IRS algorithm, named CIRS algorithm, to incorporate composite events. We define a new triggering graph to represent composite events, and convert the new graph to apply the data access sub-algorithm and priority graph generation sub-algorithm. Using the CIRS algorithm, rules triggered by composite events can be scheduled at static time that guarantees the confluent execution of simultaneously triggered rules.
  • Keywords
    active databases; active database rule scheduling; composite event; data management; database integration; database integrity checking; event management; priority graph generation; Algorithm design and analysis; Computer science; Database systems; Processor scheduling; Project management; Scheduling algorithm; USA Councils; Active rules; composite events; confluence;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Reuse & Integration, 2009. IRI '09. IEEE International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    978-1-4244-4114-3
  • Electronic_ISBN
    978-1-4244-4116-7
  • Type

    conf

  • DOI
    10.1109/IRI.2009.5211569
  • Filename
    5211569