Constraint databases

Author(s)

Bibliographic Information

Constraint databases

Gabriel Kuper, Leonid Libkin, Jan Paredaens (eds.)

Springer, c2000

Available at  / 15 libraries

Search this Book/Journal

Description and Table of Contents

Description

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.

Table of Contents

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.

by "Nielsen BookData"

Details

  • NCID
    BA47277817
  • ISBN
    • 3540661514
  • LCCN
    00021716
  • Country Code
    gw
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Berlin
  • Pages/Volumes
    xvii, 428 p.
  • Size
    24 cm
Page Top