ACM Home Page
Please provide us with feedback. Feedback
A SQL database system for solving constraints
Full text PdfPdf (264 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 2nd PhD workshop on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: Session 1 table of contents
Pages 1-8  
Year of Publication: 2008
ISBN:978-1-60558-257-3
Authors
Sebastien Siva  Emory University, Atlanta, GA, USA
Lesi Wang  Emory University, Atlanta, GA, USA
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 105,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458550.1458552
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
F. Bacchus, CSPs: Adding Structure to SAT. In SAT, 10, 2006.
 
4
H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV, 175--188, 2004.
 
5
 
6
J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19/20:503--581, 1994.
 
7
 
8
J. Liu, X. Dong and A. Halevy. Answering Structured Queries on Unstructured Data, In WebDB, 37--65, 2006.
 
9
 
10
K. Marriott, P. Stuckey. Programming with constraints. MIT Press, Cambridge, MA, 1998.
 
11
 
12
S. Siva. Ph.D. Thesis, in progress.
 
13
 
14
 
15
H. Zhang. The SatBox Library http://www.cs.uiowa.edu/~hzhang/satbox/, 2006
 
16
H. Zhang, Generating college conference basketball schedules by a SAT solver, Fifth International Symposium on Theory and Applications of Satisfiability Testing, 281--291, 2002.
 
17
H. Zhang, D. Li, and H. Shen. A SAT based scheduler for tournament schedules. In SAT, 2005.

Collaborative Colleagues:
Sebastien Siva: colleagues
Lesi Wang: colleagues