Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. In Dan Suciu, Sebastian Skritek, Christoph Koch 0001, editors, Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019. pages 89-103, ACM, 2019. [doi]
@inproceedings{AmarilliBMN19-0,
title = {Enumeration on Trees with Tractable Combined Complexity and Efficient Updates},
author = {Antoine Amarilli and Pierre Bourhis and Stefan Mengel and Matthias Niewerth},
year = {2019},
doi = {10.1145/3294052.3319702},
url = {https://doi.org/10.1145/3294052.3319702},
researchr = {https://researchr.org/publication/AmarilliBMN19-0},
cites = {0},
citedby = {0},
pages = {89-103},
booktitle = {Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019},
editor = {Dan Suciu and Sebastian Skritek and Christoph Koch 0001},
publisher = {ACM},
isbn = {978-1-4503-6227-6},
}