Database Paper Browser

Back to papers

Constraint Satisfaction and Database Theory: a Tutorial

Summary: Tutorial that recasts CSPs as conjunctive queries/homomorphisms and vice versa, formalizing the intimate CSP–database correspondence. Draws consequences for tractability and algorithms—structural and algebraic restrictions, query evaluation and join-based techniques—from both perspectives. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1197
Venue
PODS
Year
2000
Pagerank
5.7881576e-05
Overall Rank
4,977 | 65.38%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers