A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract)

Authors:
Sebastien Siva;James J. Lu;Hantao Zhang
Affiliations:
Mathematics and Computer Science, Emory University, Atlanta, USA GA 30322-1950;Mathematics and Computer Science, Emory University, Atlanta, USA GA 30322-1950;Computer Science, University of Iowa, Iowa City, USA IA 52240
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 7
Cited 0

Deductive databases—theory meets practice

EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
The LDL System Prototype

IEEE Transactions on Knowledge and Data Engineering
Constraint Programming and Database Query Languages

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Scheduling a Major College Basketball Conference

Operations Research
Answer Set Programming Based on Propositional Satisfiability

Journal of Automated Reasoning
Combining relational algebra, SQL, constraint modelling, and local search

Theory and Practice of Logic Programming
Compiling problem specifications into SAT

Artificial Intelligence - Special volume on reformulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Practical contexts for constraint satisfaction problems (CSP) often involve large relational databases. The recent proposal by Cadoli and Mancini, CONSQL, shows that a simple extension to SQL provides a viable basis for modeling CSP [1]. This enables the transparent integration of CSP solvers with databases using SQL --- the most widely known and popular database language, and opens the possibility for making the power of CSP technology accessible to SQL knowledgeable users.