Constraint Databases
By: edited by Gabriel Kuper, Leonid Libkin, Jan Paredaens
Contributors: Libkin, Leonid; Paredaens, Jan
Publisher: Springer Berlin Heidelberg
Published: 2000
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 428
ISBN-13: 9783642085420; 9783662040317
Subjects: Computer science; Database management
Description: This book 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. 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.