Constraints and Databases
Raghu Ramakrishnan, Peter Stuckey
Springer Science & Business Media, Dec 31, 1997 - Computers - 192 pages
Constraints and Databases contains seven contributions on the rapidly evolving research area of constraints and databases. This collection of original research articles has been compiled as a tribute to Paris C. Kanellakis, one of the pioneers in the field.
Constraints have long been used for maintaining the integrity of databases. More recently, constraint databases have emerged where databases store and manipulate data in the form of constraints. The generality of constraint databases makes them highly attractive for many applications. Constraints provide a uniform mechanism for describing heterogenous data, and advanced constraint solving methods can be used for efficient manipulation of constraint data.
The articles included in this book cover the range of topics involving constraints and databases; join algorithms, evaluation methods, applications (e.g. data mining) and implementations of constraint databases, as well as more traditional topics such as integrity constraint maintenance.
Constraints and Databases is an edited volume of original research comprising invited contributions by leading researchers.
What people are saying - Write a review
We haven't found any reviews in the usual places.
The CCUBE Constraint ObjectOriented Database System
Toward Practical Query Evaluation for Constraint Databases
A Decompositional Approach for Computing Least FixedPoints of Datalog Programs with ZCounters
Memoing Evaluation for Constraint Extensions of Datalog
Refining Restriction Enzyme Genome Maps
Maintaining Global Integrity Constraints in Distributed Databases
Implementation and Evaluation of Decision Trees with Range and Region Splitting
Other editions - View all
algorithm allows answer appear application approach arithmetic assume atomic attributes automaton bottom-up bound called CCUBE clause clone collection complete compute condition conjunction consider consistent constants constraint databases construct contains corresponding cost Database Systems Datalog dataset decision tree decomposition defined definition deletion denote efficient eliminate estimation evaluation example expression extensible Figure filtering finite formula function genome map given holds implementation insertion instance integer International join language least linear Logic Programming lower method node Note objects operations optimization pair path perform Petri plans possible practical predicates present Principles problem Proc projection Proof query query evaluation range reachability region relation remote representation represented restriction result rules satisfied selection splitting step Theorem transformation transitions tuples variables x-monotone