{'fraction_non_alphanumeric': 0.022085889570552148, 'fraction_numerical': 0.0, 'mean_word_length': 5.325581395348837, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Specifying and solving Boolean constraint problems in relational databases: a case study

A two-part approach for extending relational database systems to solve boolean constraint problems is presented. The first is a SQL-extension frontend for specifying boolean constraint problems, and the second is a coupling of constraint solvers with the database engine in the backend. The language extension is high-level and domain-specific, thereby allowing users to focus on writing specifications at the abstraction level of the problem domain. Both a stand-alone solver and a stored-procedure solver are integrated in the backend, and a simple approach for finding "acceptable answers" to overly-constrained problems is discussed. A prototype system is described along with an application to scheduling tennis matches.