The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user's task easier, and provide the database system with more opportunities for optimization. Relational database systems offer a striking proof that this premise is indeed valid. The most popular relational query language, SQL, is based upon relational algebra and calculus, i.e., a small fragment of first-order logic, and the ease of writing queries in SQL (in comparison to more...
The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity c...
This book constitutes the refereed proceedings of the 5th International Conference on Deductive and Object-Oriented Databases, DOOD'97, held in Montreux, Switzerland, in December 1997. The 22 revised full papers presented in this book were selected from a total of 59 submissions. Also included are abstracts or full versions of three invited talks and three tutorials and six short presentations. The papers are organized in topical sections on materialized view maintenance, extending DBMs features, database updates, managing change in object databases, semantics of active databases, formal...
This book constitutes the refereed proceedings of the 5th International Conference on Deductive and Object-Oriented Databases, DOOD'97, held in Montre...
Raghu Ramakrishnan Raghu Ramakrishnan Peter Stuckey
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...
Constraints and Databases contains seven contributions on the rapidly evolving research area of constraints and databases. This collection of...
The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user's task easier, and provide the database system with more opportunities for optimization. Relational database systems offer a striking proof that this premise is indeed valid. The most popular relational query language, SQL, is based upon relational algebra and calculus, i.e., a small fragment of first-order logic, and the ease of writing queries in SQL (in comparison to more...
The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity c...
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...
Constraints and Databases contains seven contributions on the rapidly evolving research area of constraints and databases. This collection of...