Deductive databases—theory meets practice
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
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
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Scheduling a Major College Basketball Conference
Operations Research
Scheduling a Major College Basketball Conference--Revisited
Operations Research
Combining relational algebra, SQL, constraint modelling, and local search
Theory and Practice of Logic Programming
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Challenging research issues in data mining, databases and information retrieval
ACM SIGKDD Explorations Newsletter
An efficient light solver for querying the semantic web
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
It has long been recognized that practical contexts for constraint satisfaction problems (CSP) often involve large relational databases (RDB). Early attempts to marry constraint solving systems and relational database systems include deductive and constraint databases that reuse important ideas from logic programming. These techniques required knowledge outside the scope of traditional database users. The recent proposal by Cadoli and Mancini, "consql", shows that a simple extension to SQL provides a viable basis for modeling CSP. This opens the possibility for transparently integrating CSP with databases using SQL - the most widely known and popular database language. Such an extension brings the power of constraint problem solving to SQL knowledgeable users. Towards that end, the current research describes a case study in the engineering details of designing and implementing such a prototype. The SQL-based constraint data engine (SCDE) supports key concepts of "consql", with several new syntax to better align the administration of CSP related notions with ordinary SQL. SCDE manages the internal representation and solving of constraints through a combination of ordinary SQL and a satisfiability solver, SATO. Initial performance tests on the 1997-98 ACC Basketball Scheduling problem shows the feasibility and potential of the SCDE design. Ongoing and future work include completing a programming environment for end-users to specify, test and debug constraint problem specification; combining the database engine with a more interactive version of SATO to support objective functions, and automatic problem analysis and decomposition for improving the performance of hard constraint problems.