Get the latest tech news
SQL, Homomorphisms and Constraint Satisfaction Problems
Database queries are a pretty surprisingly powerful tool that can solve seemingly intractable problems.
The SELECT fields are bits that aren’t being existentially bound and therefore hidden, aka free variables. As a subcase of this capability, if the database is holding an edge table and attributes, then a query is a graph homomorphism solver. A class of CSP problems is allowing the connecvtivity graph to vary, while keeping the target (the types of constraints fixed).
Or read this on Hacker News
