edited by Gabriel Kuper, Leonid Libkin, and Jan Paredaens
Springer Verlag, 2000

From the preface:

This book is the first comprehensive survey of the field of constraint
databases. Constraint databases are a fairly new and active area of
database research. The key idea is that constraints, such as linear or
polynomial equations, are used to represent large, or even infinite,
sets in a compact way. The ability to deal with infinite sets makes
constraint databases particularly promising as a technology for
integrating spatial and temporal data with standard relational
databases. Constraint databases bring techniques from a variety of
fields, such as logic and model theory, algebraic and computational
geometry, as well as symbolic computation, to the design and analysis
of data models and query languages.

The book is a collaborative effort involving many authors who have
contributed chapters on their fields of expertise. Despite this, the
book is designed to be read as a whole, as opposed to a collection of
individual surveys. In particular, the terminology and the style of
presentation have been standardized, and there are multiple
cross-references between the chapters.

Preface and Table of Contents

To order:
from Springer, click here
from Amazon, click here
from Barnes and Noble, click here