FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
Logic in Computer Science
2025-06-25 v1
Abstract
Enumerating the result set of a first-order query over a relational structure of bounded degree can be done with linear preprocessing and constant delay. In this work, we extend this result towards the compressed perspective where the structure is given in a potentially highly compressed form by a straight-line program (SLP). Our main result is an algorithm that enumerates the result set of a first-order query over a structure of bounded degree that is represented by an SLP satisfying the so-called apex condition. For a fixed formula, the enumeration algorithm has constant delay and needs a preprocessing time that is linear in the size of the SLP.
Cite
@article{arxiv.2506.19421,
title = {FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree},
author = {Markus Lohrey and Sebastian Maneth and Markus L. Schmid},
journal= {arXiv preprint arXiv:2506.19421},
year = {2025}
}