Constraint query languages (preliminary report)

  • Authors:
  • Paris C. Kanellakis;Gabriel M. Kuper;Peter Z. Revesz

  • Affiliations:
  • Brown University, Providence, RI;IBM T.J. Watson Research Center, Yorktown Heights, NY;Brown University, Providence, RI

  • Venue:
  • PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We discuss the relationship between constraint programming and database query languages. We show that bottom-up, efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction of constraints. We describe the basic Constraint Query Language design principles, and illustrate them with four different classes of constraints: Polynomial, rational order, equality, and Boolean constraints.