Differing from other books on the subject, this one uses the framework of constraint databases to provide a natural and powerful generalization of relational databases. An important theme running through the text is showing how relational databases can smoothly develop into constraint databases, without sacrificing any of the benefits of relational databases whilst gaining new advantages. Peter Revesz begins by discussing data models and how queries may be addressed to them. From here, he develops the theory of relational and constraint databases, including Datalog and the relational calculus, concluding with three sample constraint database systems -- DISCO, DINGO, and RATHER. Advanced undergraduates and graduates in computer science will find this a clear introduction to the subject, while professionals and researchers will appreciate this novel perspective on their subject.

This is the first comprehensive survey of the field of constraint databases, written by leading researchers. Constraint databases are a fairly new and active area of database research. Their ability to deal with infinite sets makes them 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.

Constraints; Simplification, optimization and implication; Finite constraint domains; Constraint logic programming; Simple modeling; Using data structures; Controlling search; Modelling with finite domain constraints; Advanced programming techniques; CLP systems; Other constraint programming languages; Constraint databases; Index.

Introduced forty years ago, relational databases proved unusually succe- ful and durable. However, relational database systems were not designed for modern applications and computers. As a result, specialized database systems now proliferate trying to capture various pieces of the database market. Database research is pulled into di?erent directions, and speci- ized database conferences are created. Yet the current chaos in databases is likely only temporary because every technology, including databases, becomes standardized over time. The history of databases shows periods of chaos followed by periods of dominant technologies. For example, in the early days of computing, users stored their data in text ?les in any format and organization they wanted. These early days were followed by information retrieval systems, which required some structure for text documents, such as a title, authors, and a publisher. The information retrieval systems were followed by database systems, which added even more structure to the data and made querying easier. In the late 1990s, the emergence of the Internet brought a period of relative chaos and interest in unstructured and “semistructured data” as it wasenvisionedthateverywebpagewouldbelikeapageinabook.However, with the growing maturity of the Internet, the interest in structured data was regained because the most popular websites are, in fact, based on databases. The question is not whether future data stores need structure but what structure they need.

Constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management science, and applied mathematics. In Constraint Processing, Rina Dechter synthesizes these contributions, as well as her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.

The ?rst International Symposium on the Applications of Constraint Databases (CDB2004) took place in Paris, France, on June 12–13, 2004, just before the ACM SIGMOD and PODS conferences. Since the publication of the paper “Constraint Query Languages” by Kan- lakis, Kuper and Revesz in 1990, the last decade has seen a growing interest in constraint database theory, query evaluation, and applications, re?ected in a variety of conferences, journals, and books. Constraint databases have proven to be extremely ?exible and adoptable in environments that relational database systems cannot serve well, such as geographic information systems and bioinf- matics. This symposium brought together people from several diverse areas all c- tributing to the practice and the application of constraint databases. It was a continuation and extension of previous workshops held in Friedrichshafen, G- many (1995), Cambridge, USA (1996), Delphi, Greece (1997), and Seattle, USA (1998) as well as of the work in the comprehensive volume “Constraint Data- ses” edited by G. Kuper, L. Libkin and J. Paredaens (2000) and the textbook “Introduction to Constraint Databases” by P. Revesz (2002). The aim of the symposium was to open new and future directions in c- straint database research; to address constraints over domains other than the reals; to contribute to a better implementation of constraint database systems, in particular of query evaluation; to address e?cient quanti?er elimination; and to describe applications of constraint databases.