عنوان
پدید آورنده
موضوع
رده
QA76.9.C67 E358 2000
QA76
.
9
.
C67
E358
2000
کتابخانه
محل استقرار
366204031X
9783662040317
b579335
Constraint Databases
[Book]
edited by Gabriel Kuper, Leonid Libkin, Jan Paredaens.
Berlin, Heidelberg
Springer Berlin Heidelberg
2000
(xvii, 428 pages)
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.
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.
Computer science.
Database management.
QA76
.
9
.
C67
E358
2000
edited by Gabriel Kuper, Leonid Libkin, Jan Paredaens.
Gabriel Kuper
Jan Paredaens
Leonid Libkin
مطالعه متن کتاب [Book]
Y
