|
|
|
 |
|
 |
|
Scalable Trigger Processing
|
E.N. Hanson,
C. Carnes,
L. Huang,
M. Konyala,
L. Noronha,
S. Parthasarathy,
J.B. Park,, and
A. Vernon
View Paper (PDF)
Return to Session 8: Advanced Topics
Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of triggers is achieved with a trigger cache to use main memory effectively, and a memory-conserving selection predicate index based on the use of unique expression formats called expression signatures. A key observation is that if a very large number of triggers are created, many will have the same structure, except for the appearance of different constant values. When a trigger is created, tuples are added to special relations created for expression signatures to hold the trigger's constants. These tables can be augmented with a database index or main-memory index structure to serve as a predicate index. The design presented also uses a number of types of concurrency to achieve scalability, including token (tuple)-level, condition-level, rule action-level, and data-level concurrency.
Copyright(C) 2000 ACM
|
|
|
|
|
|
|
