Arc and path consistence revisited
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Optimization of large join queries: combining heuristics and combinatorial techniques
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Relational database theory
Arc-consistency and arc-consistency again
Artificial Intelligence
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Solution Techniques for Constraint Satisfaction Problems: Foundations
Artificial Intelligence Review
Introduction to constraint databases
Introduction to constraint databases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Constraint Processing
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Structure and complexity of relational queries
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Generalized arc consistency for positive table constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
A combinatorial query is a request for tuples from multiple relations that satisfy a conjunction of constraints on tuple attribute values. Managing combinatorial queries using the traditional database systems is very challenging due to the combinatorial nature of the problem. Indeed, for queries involving a large number of constraints, relations and tuples, the response time to satisfy these queries becomes an issue. To overcome this difficulty in practice we propose a new model integrating the Constraint Satisfaction Problem (CSP) framework into the database systems. Indeed, CSPs are very popular for solving combinatorial problems and have demonstrated their ability to tackle, in an efficient manner, real life large scale applications under constraints. In order to compare the performance in response time of our CSP-based model with the traditional way for handling combinatorial queries and implemented by MS SQL Server, we have conducted several experiments on large size databases. The results are very promizing and show the superiority of our method comparing to the traditional one.