Treffer: A dynamic approach to termination analysis for active database rules
Title:
A dynamic approach to termination analysis for active database rules
Authors:
Source:
CL 2000 : computational logic (London, 24-28 July 2000)Lecture notes in computer science. :1106-1120
Publisher Information:
Berlin: Springer, 2000.
Publication Year:
2000
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Base donnée active, Active databases, Performance programme, Program performance, Eficacia programa, Programmation fonctionnelle, Functional programming, Programación funcional, Programmation logique, Logical programming, Programación lógica, Système gestion base donnée, Database management system, Sistema gestión base datos, Système information, Information system, Sistema información
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Birkbeck College, Univ. of London, Malet Street, London WC1E 7HX, United Kingdom
ISSN:
0302-9743
Rights:
Copyright 2000 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1381470
Database:
PASCAL Archive
Weitere Informationen
An important behavioural property for sets of active database rules is that of termination. In current commercial database systems, termination is guaranteed by imposing a fixed upper limit on the number of recursive rule firings that may occur. This can have undesirable effects such as prematurely halting correct executions. We describe a new approach based on a dynamic upper limit to the number of rule firings. This limit reflects knowledge about past rule behaviour on the database and provides a more accurate measure for when the DBMS should terminate rule execution. The approach incurs little cost and can easily be integrated with current techniques for static analysis of active rules.