Search

• < Previous
• 1
• 2
• Next >

Enumerating Answers to First-Order Queries over Databases of Low Degree

A class of relational databases has low degree if for all $\delta>0$, all but finitely many databases in the class have degree at most $n^{\delta}$, where $n$ is the size of the database. Typical examples are databases of bounded degree or of degree bounded by $\log n$. It is known that over a&nbsp;[&hellip;]