Tractable Conjunctive Queries over Static and Dynamic Relations
<|reference_start|>Tractable Conjunctive Queries over Static and Dynamic Relations: We investigate the evaluation of conjunctive queries over static and dynamic relations. While static relations are given as input and do not change, dynamic relations are subject to inserts and deletes.   We characterise syntactically three classes of queries that admit constant update time and constant enumeration delay. We call such queries tractable. Depending on the class, the preprocessing time is linear, polynomial, or exponential (under data complexity, so the query size is constant).   To decide whether a query is tractable, it does not suffice to analyse separately the sub-query over the static relations and the sub-query over the dynamic relations. Instead, we need to take the interaction between the static and the dynamic relations into account. Even when the sub-query over the dynamic relations is not tractable, the overall query can become tractable if the dynamic relations are sufficiently constrained by the static ones.<|reference_end|>
@article{kara2024tractable,
    title={Tractable Conjunctive Queries over Static and Dynamic Relations},
    author={Ahmet Kara, Zheng Luo, Milos Nikolic, Dan Olteanu, Haozhe Zhang},
    journal={arXiv preprint arXiv:2404.16224},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.16224},
    primaryClass={cs.DB}
}