Skip to content

Latest commit

 

History

History
57 lines (40 loc) · 1.26 KB

README.md

File metadata and controls

57 lines (40 loc) · 1.26 KB
Raw

dpdb

Solve dynamic programming problems on tree decompositions using databases

Requirements

htd

htd on github

Branch normalize_cli is required by dpdb (currently not included in htd's master)

Database

PostgreSQL

Python

  • Python 3
  • psycopg2
  • future-fstrings (for compatibility with older versions)
pip install -r requirements.txt

Configuration

Basic configuration (database connection, htd path, ...) are configured in config.json

Usage

python dpdb.py [GENERAL-OPTIONS] -f <INPUT-FILE> <PROBLEM> [PROBLEM-SPECIFIC-OPTIONS]

Currently implemented problems

  • SAT
  • #SAT
  • Minimum Vertex Cover

For additional help use

python dpdb.py --help

or

python dpdb.py <PROBLEM> --help

for problem specific help/options

TODO / Future Work

Indexing

Currently no indices are created. It is an open problem to investigate whether good indices can be determined just by the structure of the problem.

Oracle's Bitmap Indices also seem worth a try (Oracle Enterprise Feature)

Resume / Re-run

Re-construct input from database to be able to run the same instance again (without needing a seed for htd) or to resume previously unfinished jobs.