Enumeration on Trees with Tractable Combined Complexity and Efficient Updates-Reference-Cited by-同舟云学术

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19
language:
Short-container-title:

Author:

Amarilli Antoine¹,Bourhis Pierre²,Mengel Stefan³,Niewerth Matthias⁴

Affiliation:

1. LTCI, CNRS, Télécom ParisTech, Université Paris-Saclay, Paris, France

2. CRIStAL, CNRS UMR 9189, Inria Lille, Lille, France

3. CNRS, CRIL UMR 8188, Lens, France

4. University of Bayreuth, Bayreuth, Germany

Funder

Agence Nationale de la Recherche

Deutsche Forschungsgemeinschaft

Publisher

ACM Press

Reference38 articles.

1. Stephen Alstrup, Thore Husfeldt, and Theis Rauhe. 1998. hrefhttp://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.71.3834&rep=rep1&type=pdfMarked ancestor problems. In FOCS.

2. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. 2017. hrefhttp://drops.dagstuhl.de/opus/volltexte/2017/7462/pdf/LIPIcs-ICALP-2017--111.pdf A Circuit-based approach to efficient enumeration. In mboxhrefhttp://icalp17.mimuw.edu.pl/ICALP .

3. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. 2019 a. hrefhttps://arxiv.org/abs/1702.05589 A Circuit-based approach to efficient enumeration . Extended version with proofs. https://arxiv.org/abs/1702.05589.

4. Antoine Amarilli, Pierre Bourhis, and Stefan Mengel. 2018. hrefhttps://arxiv.org/abs/1709.06185?context=cs.LOEnumeration on trees under relabelings. In ICDT .

5. Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. 2019 b. hrefhttps://arxiv.org/abs/1807.09320 Constant-delay enumeration for nondeterministic document spanners. In ICDT .

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumerating grammar-based extractions;Discrete Applied Mathematics;2023-12

2. Efficient Enumeration for Annotated Grammars;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12

3. Enumeration for FO Queries over Nowhere Dense Graphs;Journal of the ACM;2022-06-11

4. CORE;Proceedings of the VLDB Endowment;2022-05

5. Probabilistic Databases under Updates;Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2021-06-20