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
.
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
[article]
2022
arXiv
pre-print
We study the question of when we can provide direct access to the k-th answer to a Conjunctive Query (CQ) according to a specified order over the answers in time logarithmic in the size of the database, following a preprocessing step that constructs a data structure in time quasilinear in database size. Specifically, we embark on the challenge of identifying the tractable answer orderings, that is, those orders that allow for such complexity guarantees. To better understand the computational
arXiv:2012.11965v4
fatcat:pdzgbad4kbbn3et4d6rmo5z3d4