Skip to search
Skip to main content
Title starts with
Author (sorted by title)
Call number (browse)
Princeton University Library Catalog
Constraint Databases [electronic resource] / edited by Gabriel Kuper, Leonid Libkin, Jan Paredaens.
1st ed. 2000.
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
1 online resource (XVII, 428 p.)
Programming languages (Electronic computers).
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 re lational 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 con tributed 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 par ticular, the terminology and the style of presentation have been standardized, and there are multiple cross-references between the chapters. The idea of constraint databases goes back to the late Paris Kanellakis.
"With 83 Figures"--Title page.
Includes bibliographical references and index.
2. Constraint Databases, Queries, and Query Languages
3. Expressive Power: The Finite Case
4. Expressive Power: The Infinite Case
5. Query Safety with Constraints
6. Aggregate Languages for Constraint Databases
7. Datalog and Constraints
8. Geographic Information Systems
9. Linear-Constraint Databases
10. Topological Queries
11. Euclidean Query Languages
12. Genericity in Spatial Databases
13. Linear Repeating Points
14. Optimization Techniques
15. Constraint Algebras
16. I/O-Efficient Algorithms for CDBs
17. The DEDALE Prototype
18. The DISCO System
19. SQL/TP: A Temporal Extension of SQL.
Show 16 more Contents items
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage.
Ask a Question
Suggest a Correction
Report Harmful Language