A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Complexity Analysis
[article]
2022
arXiv
pre-print
Even though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-joins. We study how self-joins affect enumeration complexity, with the aim of building upon the known results to achieve general classifications. We do this by examining the extension of two known dichotomies: one with respect to linear delay, and one with respect to constant delay after linear preprocessing. As this
arXiv:2206.04988v2
fatcat:nw5plldfh5hkbhu2o5vq6haz7i