Academic Journal
Exploiting Database Management Systems and Treewidth for Counting.
| Τίτλος: | Exploiting Database Management Systems and Treewidth for Counting. |
|---|---|
| Συγγραφείς: | FICHTE, JOHANNES K., HECHER, MARKUS, THIER, PATRICK, WOLTRAN, STEFAN |
| Πηγή: | Theory & Practice of Logic Programming; Jan2022, Vol. 22 Issue 1, p128-157, 30p |
| Θεματικοί όροι: | Databases, Counting, Dynamic programming, Relation algebras, Algorithms, SQL |
| Περίληψη: | Bounded treewidth is one of the most cited combinatorial invariants in the literature. It was also applied for solving several counting problems efficiently. A canonical counting problem is #Sat, which asks to count the satisfying assignments of a Boolean formula. Recent work shows that benchmarking instances for #Sat often have reasonably small treewidth. This paper deals with counting problems for instances of small treewidth. We introduce a general framework to solve counting questions based on state-of-the-art database management systems (DBMSs). Our framework takes explicitly advantage of small treewidth by solving instances using dynamic programming (DP) on tree decompositions (TD). Therefore, we implement the concept of DP into a DBMS (PostgreSQL), since DP algorithms are already often given in terms of table manipulations in theory. This allows for elegant specifications of DP algorithms and the use of SQL to manipulate records and tables, which gives us a natural approach to bring DP algorithms into practice. To the best of our knowledge, we present the first approach to employ a DBMS for algorithms on TDs. A key advantage of our approach is that DBMSs naturally allow for dealing with huge tables with a limited amount of main memory (RAM). [ABSTRACT FROM AUTHOR] |
| Copyright of Theory & Practice of Logic Programming is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
καταχωρήστε σχόλιο πρώτοι!