Titlebook: Rules in Database Systems; Proceedings of the 1 Norman W. Paton,M. Howard Williams Conference proceedings 1994 British Computer Society 199

BOAST

STRIA

Better Termination Analysis for Active Databaseste. Rule processing in active databases does not terminate when rules activate each other indefinitely. Previous approaches to termination analysis in active databases use very conservative algorithms to determine when rules may activate each other. In this paper we introduce an algebraic model for

庇護(hù)

慌張

Enforcing Confluence of Rule Executionires confluent and terminating behaviour of the rule set. In [15], we introduced a design theory for the static detection of these properties. The detection of confluence is based on commutativity of rule execution, called independence. In this article, we discuss the enforcement of confluence for t

MERIT

易于交談