edited by Gabriel Kuper, Leonid Libkin, Jan Paredaens.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Berlin, Heidelberg
Name of Publisher, Distributor, etc.
Springer Berlin Heidelberg
Date of Publication, Distribution, etc.
2000
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
(xvii, 428 pages)
CONTENTS NOTE
Text of Note
1. Introduction --; 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.
SUMMARY OR ABSTRACT
Text of Note
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.
TOPICAL NAME USED AS SUBJECT
Computer science.
Database management.
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QA76
.
9
.
C67
Book number
E358
2000
PERSONAL NAME - PRIMARY RESPONSIBILITY
edited by Gabriel Kuper, Leonid Libkin, Jan Paredaens.