| Rosenthal, A., Chakravarthy, S., and Blautein, B., "Situation Monitoring for Active Databases", VLDB 1989, pp. 455-464. |
.... An event may be a temporal event, the execution of a database 8 operation on an object, transaction related event, an arbitrary application signal [Dayal88, Rama92] or a user defined method [IsKu93] A condition is a boolean expression on the state of the data or on the result of queries [RCB89]. An action is a sequence of operations. ECA rules can be used to express integrity constraints, access constraints, derived data, and alerters. A transaction contains a sequence of operations that changes the database from one consistent state to another. Some of the operations trigger events. ....
Rosenthal, A., Chakravarthy, S., and Blautein, B., "Situation Monitoring for Active Databases", VLDB 1989, pp. 455-464.
....downward hereditary if its validity over an interval implies its validity on each of the subintervals; a proposition is clay like if whenever it holds on two consecutive intervals, it holds in their union. iv) Existing mechanisms for propagating changes across derived objects [ELL190] HUDS90] [ROSE89]. 6 Existing Techniques Sections 3 and 5 posed the requirements of temporal GIS; this section will review some available software technology relevant to these requirements. As could be expected, some of these features come from other non conventional applications of DBMSs, mainly from those used ....
A. Rosenthal, U.S. Chakravarthy, B. Blaustein, J.A. Blakeley, "Situation monitoring for active databases" , Proceedings 15th international conference on very large databases, pp. 455-464, August 1989.
.... [Rou91] RK91] Val87] The use and refreshment of materialized views has been de2 scribed in [BM90] CKPS95] GL95] GMR95] HK95] Han87] LMSS95] SJGP90] SR87] ZGMHW95] Incremental techniques has been described for active databases [CSL 90] CW91] HCKW90] Han92] RCBB89] WDSY91] for deductive databases [GMS93] and for temporal databases [BM95c] JMR91] McK88] However, we are not aware of existing incremental algorithms that combine materialized view, partially materialized views, and ViewCaches. In Section 2 we discuss a set of methods that can be used ....
A. Rosenthal, S. Chakravarthe, B. Blaustein, and J. Blakeley. Situation Monitoring for Active Databases. In 1989 Proceedings of the 15th International Conference on Very Large Data Bases, Amsterdam, The Netherlands, 1989.
....in the research literature at length during the last ten years. Many different individual methods have been proposed, so that it already becomes hard to keep track of the state of the art. Also for active database systems condition monitoring by means of update propagation has been proposed [RCB89]. This work has been supported in part by the Commission of the European Community under ESPRIT project number 6333 (IDEA) 1 1.1 Incremental Approaches to Update Propagation All the approaches introduced so far share a common goal, in that they try to reduce the overhead arising from a naive ....
A. Rosenthal, S. Chakravarthy, and B. Blaustein: "Situation monitoring for active databases", in: Proc. VLDB'89, Amsterdam, 455-464
....(Advanced Information Technology Division of Computer Corporation of America) and later migrated to Xerox Advanced Information Technology Center. The HiPAC prototype is an extension of the PROBE DBMS [CN90] but does not implement the full functionality of the HiPAC model. References: MD89] RCBB89] Cha89] DBBC88] DBM88] HLM88] Secondary: Cha93] Day88] HW93] PDW 93] VK93] ZB90] 2.9 Iris Iris was developed at the Hewlett Packard Laboratories in Palo Alto. Although Iris does not claim to be active, its capability to evaluate functionally defined attributes propose many ....
.... to detect basic events are described in: References: BJ93] CM93] GD93a] HK89] Ris89] SHP88] SJGP90] Complex Event Detection Mechanisms to detect complex events are described in: References: BJ93] BL92] Cha92] CKAK94] CM93] GD93a] GD94] GHJ93] GJS92a] NTC92] RCBB89] SW92] Wid92a] Parameter Context Handling The handling of parameters for basic events, and context information for complex events are described in: References: CM93] Transactions The following papers address rule execution in the presence of regular transactions within the DBMS: ....
[Article contains additional citation context not shown here]
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proc. 15th Conf. on Very Large Data Bases, Amsterdam, August 1989.
....while the algorithm presented in [LS93] applies to more general queries than we consider here (e.g. recursive queries) their model for database updates is considerably simpler than ours. Finally, our Propagation Algorithm is somewhat related to incremental evaluation, as in [BW93, QW91,RCBB89] both problems address the effect of a database modification on a relational expression. However, incremental evaluation techniques are designed for run time, when the actual modifications are known, while our techniques apply at compile time, when the modifications are expressed as database ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, pages 455--464, Amsterdam, The Netherlands, August 1989.
....update, activation and deactivation of rules) The paradigm of active databases is useful for implementing or extending several database functions. Some examples are integrity control, handling of derived data, processing of view updates, and monitoring of events (e.g. Mor83, Mor84, Ris89, RCBB89, MD89] Most of the published research on active databases discusses the support of static integrity constraints using E,C,A rules. In such a framework, rule components have the following meaning: the Event is an update request; the Condition is the constraint s predicate; and the Action, ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proc. 15th VLDB, 1989.
....query transformation algorithm, it has been difficult to relax it [2] when following their definition of continuous queries. This is one of the motivations for our new definition in Section 3 under a new name, continual queries. Active Databases: Rules are used extensively in active databases [5, 14, 18, 20] for monitoring changes of database state. Despite their conceptual generality, rules have been so far supported in a fairly restrictive form in practical systems, for example, by triggers in relational database management systems such as Oracle, Sybase, and Informix. A trigger is an ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakely. Situation monitoring for active databases. In Proceedings of the 15th International Conference on Very Large Data Bases, pages 469--478, Amsterdam, Holland, September 1989.
.... may be specified as the following ECA rule: ON Update(salary(x; new) IF 9old salary(x; old) old new) THEN reject; Many approaches advocating the use of active rules for the specification and enforcement of integrity constraints have appeared in the literature of the recent years (e.g. RCBB89] Cas89] ELW90] UKN92] FPT92] GJS92] GJ91] GL93] Ger94] CT94] Several research prototypes provide for active rule specification and execution (e.g. ODE [GJ91] HIPAC [DBB88] POSTGRES [SJGP90] STARBURST [LLPS91] WCL91] CHIMERA [CFP94] RDL1 [SKdM92] REFLEX [NI93] LAURE ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation Monitoring for Active Databases. In Proceedings, VLDB-89, pages 455--464, 1989.
....the query. Furthermore, while the algorithm presented in [18] applies to more general queries than we consider here (e.g. recursive queries) their model for database updates is considerably simpler than ours. Finally, our Propagation Algorithm is somewhat related to incremental evaluation, as in [4, 19, 20]: both problems address the effect of a database modification on a relational expression. However, incremental evaluation techniques are designed for run time, when the actual modifications are known, while our techniques apply at compile time, when the modifications are expressed as database ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proc. Fifteenth Int'l Conf. on Very Large Data Bases, pages 455--464, August 1989.
....our method as an attribute grammar; this allows a direct implementation of the method using a compiler generator such as YACC [Joh75] 1. 1 Previous Related Work There is a clear connection between our work and the well studied problem of incremental evaluation, especially as addressed in [QW91,RCBB89] RCBB89] proposes an incremental optimization technique for rule conditions with similar goals to ours. However, rule conditions are restricted to Select Project Join (SPJ) expressions, and all relations are required to have user accessible tuple identifiers. In contrast, our rule conditions ....
....as an attribute grammar; this allows a direct implementation of the method using a compiler generator such as YACC [Joh75] 1. 1 Previous Related Work There is a clear connection between our work and the well studied problem of incremental evaluation, especially as addressed in [QW91,RCBB89] RCBB89] proposes an incremental optimization technique for rule conditions with similar goals to ours. However, rule conditions are restricted to Select Project Join (SPJ) expressions, and all relations are required to have user accessible tuple identifiers. In contrast, our rule conditions are more ....
[Article contains additional citation context not shown here]
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, pages 455--464, Amsterdam, The Netherlands, August 1989.
....specify our method as an attribute grammar; this allows a direct implementation of the method using a compiler generator such as YACC [10] 1. 1 Previous Related Work There is a clear connection between our work and the well studied problem of incremental evaluation, especially as addressed in [12, 13, 16]. 13] proposes an incremental optimization technique for rule conditions, with similar goals to ours. However, rule conditions are restricted to Select Project Join (SPJ) expressions, and all relations are required to have user accessible tuple identifiers. In contrast, our rule conditions are ....
....method as an attribute grammar; this allows a direct implementation of the method using a compiler generator such as YACC [10] 1. 1 Previous Related Work There is a clear connection between our work and the well studied problem of incremental evaluation, especially as addressed in [12, 13, 16] [13] proposes an incremental optimization technique for rule conditions, with similar goals to ours. However, rule conditions are restricted to Select Project Join (SPJ) expressions, and all relations are required to have user accessible tuple identifiers. In contrast, our rule conditions are more ....
[Article contains additional citation context not shown here]
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proc. of the Fifteenth Int. Conf. on Very Large Data Bases, pages 455--464, Amsterdam, The Netherlands, Aug. 1989.
....this information could be returned by the algorithm in [LS93] as well, in which case their algorithm could be used in our rule analysis techniques in place of our Propagation Algorithm. Finally, our Propagation Algorithm is somewhat related to incremental evaluation, as in, e.g. BW95,QW91,RCBB89] Both problems address the effect of a data modification on a relational expression. However, incremental evaluation techniques are designed for run time, when the actual modifications are known, while our techniques apply at compile time, when the modifications are represented as relational ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, pages 455--464, Amsterdam, The Netherlands, August 1989.
....most common constraint types, such as referential integrity and mutual exclusion. See the earlier technical report version of this paper [GW94] for a complete definition of the class of constraints considered. The problem of incremental constraint checking has been studied extensively (see, e.g. [BLT86, GA90, Nic82, RCB89, QW91, Ull89]) The protocols we present can be extended in a straightforward way to constraints over more than two relations; the two relation restriction is adopted for clarity and brevity only. We assume that constraints are expressed as queries, where the constraint is satisfied iff the query result is ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation monitoring for active databases. In Procs. 15th Int. Conf. on Very Large Data Bases, Amsterdam, The Netherlands, 1989.
....triggering conditions should observe the same query results over time, while continual queries with the same query expression but different triggering conditions should be considered different. Other advantages of our semantics will be discussed in Section 3. 2. 2 Active Databases Active databases [6, 15, 20, 22] allow users to specify, in the form of rules, actions to be performed following changes of database state. Despite their conceptual generality, rules have been so far supported in a fairly restrictive form in practical systems, for example, by triggers [9] in relational database management ....
A. Rosenthal, S. Chakravarthy, B. Blaustein, and J. Blakely. Situation monitoring for active databases. In Proceedings of the 15th International Conference on Very Large Data Bases, pages 469--478, Amsterdam, Holland, September 1989.
....inserted into the body of a Horn clause, but are instead evaluated when a stored relation is updated. This can be compared to how triggers [3] are executed, except that screener predicates only determine if the change is interesting for any deferred rules, while triggers react immediately. HiPAC[64] defined incremental propagation of D relations through selectproject join. It is generalized in Sentinel [18] HiPac used ECA rules, while our method uses CA rules with logical events where the physical events are calculated by the rule compiler. The method extinguishes complementary positive ....
....is generalized in Sentinel [18] HiPac used ECA rules, while our method uses CA rules with logical events where the physical events are calculated by the rule compiler. The method extinguishes complementary positive and negative physical events detected during a transaction. The chain rule of HiPAC[64] was defined as one large complete differential expression, while we are using a simpler partial differentiation when only a few functions are updated during a transaction. POSTGRES [69] and Starburst [53] both use ECA rules similar to HiPac. Starburst supports transition tables which correspond ....
Rosenthal A., Chakravarthy S., Blaustein B., Blakely J.: Situation Monitoring for Active Databases, VLDB conf. Amsterdam, 1989
....of the query (condition) and the action (transaction) associated with that event. As the situation (event condition) optimization is typically done by an optimizer, we will restrict our discussion to situation evaluation. Most of the work on active database systems [C 89, DBAB 88, RCBB89, SR86, SHP87, DB90, KDM88, WCB91, WF90, GJ91b, GJS92b, Han89, Int90a, Anw92b, CM91, CHS93, GrD93, DPG91] is aimed at supporting some form of rule processing capability (e.g. alerters, triggers, situationaction rules) and techniques for their management and optimization (e.g. lazy, eager, ....
....likely to have priorities or timing requirements associated with their execution. Optimization of such rules requires different techniques, such as exhaustive optimization, novel buffering strategies, use of main memory, and appropriate processing techniques (e.g. use of parallelism) In HiPAC [RCBB89, C 89] incremental operators, a chain rule (which was generalized in [CG91] and a signal graph was proposed for optimizing situations. The chain rule and incremental forms are similar to the transformations performed by a conventional query optimizer (e.g. 4 commuting the selection with ....
A. Rosenthal, U. S. Chakravarthy, B. Blaustein, and J. Blakeley. Situation Monitoring in Active Databases. In Proc. of the 15th Int'l Conf. on Very Large Databases, pages 455--464, Amsterdam, Aug. 1989.
No context found.
A. Rosenthal, S. Chakravarthy, and B. Blaustein. Situation Monitoring for Active Databases. Proc. 15th Int'l. Conference on Very Large Data Bases, 455-464, Amsterdam, 1989.
No context found.
RCB89 A. Rosenthal, S. Charavarthy, B. Blaustein: "Situation Monitoring for Active Databases", Proc. of the 17th International Conference on Very Large Data Bases, Barcelona, 1991.
No context found.
Rosenthal, A.; Chakravarthy,S.; Blaustein, B.; Blakeley, J. "Situation monitoring for active databases", Proc. of the 15th VLDB Conf., Amsterdam, 1989, pp. 455-464.
No context found.
Rosenthal,A.; Chakravarthy,S.; Blaustein,B; Blakeley,J. "Situation monitoring for active databases", Proc. of the 15th VLDB Conf., Amsterdam, 1989, pp. 455-464.
No context found.
Rosenthal, A.; Chakravarthy,S.; Blaustein, B.; Blakeley, J. "Situation Monitoring for Active Databases", 15th Int.Conf. on Very Large Databases (VLDB), Amsterdam, 1989, pp. 455-464.
No context found.
Rosenthal,A.; Chakravarthy,S.; Blaustein,B; Blakeley,J, "Situation monitoring for active databases", Proc. of the 15th VLDB Conf., Amsterdam, 1989, pp. 455-464.
No context found.
Rosenthal, A.; Chakravarthy, S.; Blaustein, B.; Blakeley, J. "Situation monitoring for active databases", VLDB'89, Amsterdam, 1989, pp. 455464.
No context found.
Rosenthal, A.; Chakravarthy,S.; Blaustein, B.; Blakeley, J. "Situation Monitoring for Active Databases", 15th Int.Conf. on Very Large Databases (VLDB), Amsterdam, 1989, pp. 455-464.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC