Attribute-pair range rules

Abstract

This paper examines the properties of metadata in the form of IF THEN rules which contain two predicates on attributes of a relational database table. For example: a(15 .. 30) ⇒ d(243 .. 271), which means "if the value of attribute 'a' in a tuple is in the range 15 to 30 then the value of attribute 'd' will be in the range 243 to 271." Metadata of this kind is useful in Semantic Query Optimisation and Remote Cache Management. The two predicates (antecedent and consequent) in each rule are Selection Conditions or constraints of the type found in database queries. Each condition therefore denotes a subset of a database table. Rules can be cascaded, using subrange containment as the link between successive rules. The set of rules can therefore be regarded as a set of edges in a Condition Dependency Graph, and using the rule-set is path discovery in the graph. The purpose of the current paper is to introduce some of the properties of attribute-pair range rules.

Extending the Re-use of Query Results at Remote Client Sites

“…In previous work [12,15,16,17] on 'semantic query optimisation' [10,18,19,20] the authors developed a particular type of subset descriptor, which the data server used for query optimisation (rewriting the query in a form that is answerable more quickly). The current paper extends the use of rules for query optimisation, by utilizing descriptors in the Server to provide new subset descriptors for remote client caches, and so extends current research on 'associative caching' [e.g.…”

“…If A ⇒ B and A ⇒ C then A ⇒ B ∧ C. This is the rule by which Attribute Pair rules [ 16 ] with the same antecedent condition are combined into a single multi-consequent rule.…”

“…It uses them for query reformulation to provide faster query processing, as explained in [12,15,16,17] for example. Deriving cache descriptors from them is therefore an extension to the value of an existing system.…”