Constraint satisfaction problems (CSP) are frequently solved over data residing in relational database systems. In such scenarios, the database is typically just used as a data storage back end. However, there exist important advantages, such as the wide availability of database practices and tools for modeling, to having database systems that are capable of natively modeling and solving CSPs. This paper introduces general concepts and techniques to extend a database system with constraint processing capabilities. Input CSPs are modeled via SQL, augmented with a non-deterministic guess operator as introduced by Cadoli and Mancini (TPLP 2007). Problems are represented with a combination of internal relations and parse trees, and are translated to a flexible intermediate problem representation that is subsequently translated into several common representations for SAT. Benchmarks with a prototype system show the feasibility of the approach and demonstrate the promise of a strong integration of CSP solvers and database systems.
|Title of host publication||Proceedings 25th ACM Symposium on Applied Computing (SAC'10, Sierre, Switzerland, March 22-26, 2010)|
|Editors||S.Y. Shin, S. Ossowski, M. Schumacher, M.J. Palakal, C.C. Hung|
|Place of Publication||New York NY|
|Publisher||Association for Computing Machinery, Inc|
|Publication status||Published - 2010|
Lu, J. J., Siva, S., Parekh, O., Fletcher, G. H. L., & Zhang, H. (2010). Constraint processing in relational database systems: From theory to implementation. In S. Y. Shin, S. Ossowski, M. Schumacher, M. J. Palakal, & C. C. Hung (Eds.), Proceedings 25th ACM Symposium on Applied Computing (SAC'10, Sierre, Switzerland, March 22-26, 2010) (pp. 2066-2070). Association for Computing Machinery, Inc. https://doi.org/10.1145/1774088.1774522