An Investigation into Managing SQL-Cardinality Constraints Open Access

Wang, Lesi (2008)

Permanent URL: https://etd.library.emory.edu/concern/etds/0p096702n?locale=en%255D
Published

Abstract

Abstract An Investigation into Managing SQL-Cardinality Constraints By Lesi Wang Constraint Satisfaction Problems (CSP) are commonly found in practice and finding effective representation language and efficient constraint solving techniques are important research areas. A recent development is the integration of CSP (specifically SAT) solvers with relational database systems to enable CSPs to be modeled using SQL, and solved within the database system. A key challenge in this integration is to keep the SAT encoding of SQL constraints small. In this work, we describe a divide-and-conquer technique for reducing the encoding of cardinality constraints. We present a number of experiments to show the improvements on performance.

Table of Contents

Contents

1 Introduction 1 2 Background 6 2.1 System Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Case study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Improvement of SAT solver . . . . . . . . . . . . . . . . . . . . . . 9 3 Divide and conquer by traits 12 4 Experiments 20 4.1 Case studies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 4.2 A Real World Example . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5 Conclusion and future work 25

About this Dissertation

Rights statement
  • Permission granted by the author to include this thesis or dissertation in this repository. All rights reserved by the author. Please contact the author for information regarding the reproduction and use of this thesis or dissertation.
School
Department
Degree
Submission
Language
  • English
Research Field
Keyword
Committee Chair / Thesis Advisor
Committee Members
Last modified

Primary PDF

Supplemental Files