skip to content
An algebraic approach to rule analysis in expert database systems Preview this item
ClosePreview this item
Checking...

An algebraic approach to rule analysis in expert database systems

Author: Elena Baralis; Jennifer Widom; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1994]
Series: Report (Stanford University. Computer Science Department), STAN- CS-TR-94-1504.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Condition-Action rules in database systems are very powerful, they also can be very difficult to program, due to the unstructured and unpredictable nature of rule processing. We provide methods for static analysis of Condition-  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Elena Baralis; Jennifer Widom; Stanford University. Computer Science Department.
OCLC Number: 31972774
Notes: Cover title.
"February 1994."
Description: 25 pages : illustrations ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), STAN- CS-TR-94-1504.
Responsibility: by Elena Baralis and Jennifer Widom.

Abstract:

Abstract: "Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Condition-Action rules in database systems are very powerful, they also can be very difficult to program, due to the unstructured and unpredictable nature of rule processing. We provide methods for static analysis of Condition- Action rules; our methods determine whether a given rule set is guaranteed to terminate, and whether rule execution is confluent (has a guaranteed unique final state). Our methods are based on previous methods for analyzing rules in active database systems. We improve considerably on the previous methods by providing analysis criteria that are much less conservative: our methods often determine that a rule set will terminate or is confluent when previous methods could not. Our improved analysis is based on a 'propagation' algorithm, which uses a formal approach based on an extented relational algebra to accurately determine when the action of one rule can affect the condition of another. Our algebraic approach yields methods that are applicable to a broad class of expert database rule languages."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/31972774>
library:oclcnum"31972774"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/31972774>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:author
schema:contributor
schema:contributor
schema:datePublished"1994"
schema:description"Abstract: "Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Condition-Action rules in database systems are very powerful, they also can be very difficult to program, due to the unstructured and unpredictable nature of rule processing. We provide methods for static analysis of Condition- Action rules; our methods determine whether a given rule set is guaranteed to terminate, and whether rule execution is confluent (has a guaranteed unique final state). Our methods are based on previous methods for analyzing rules in active database systems. We improve considerably on the previous methods by providing analysis criteria that are much less conservative: our methods often determine that a rule set will terminate or is confluent when previous methods could not. Our improved analysis is based on a 'propagation' algorithm, which uses a formal approach based on an extented relational algebra to accurately determine when the action of one rule can affect the condition of another. Our algebraic approach yields methods that are applicable to a broad class of expert database rule languages.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/34089788>
schema:inLanguage"en"
schema:name"An algebraic approach to rule analysis in expert database systems"
schema:publisher
rdf:typeschema:Organization
schema:name"Stanford University, Dept. of Computer Science"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.