Conjunctive Queries on Probabilistic Graphs-Reference-Cited by-同舟云学术

Conjunctive Queries on Probabilistic Graphs

Published:2017-05-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Amarilli Antoine¹,Monet Mikaël²,Senellart Pierre³

Affiliation:

1. Université Paris-Saclay, Paris, France

2. Université Paris-Saclay & Inria Paris, Paris, France

3. École normale supérieure, PSL Research University & Inria Paris, Paris, France

Funder

Télécom ParisTech

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3034786.3056121

Reference36 articles.

1. A. Amarilli P. Bourhis M. Monet and P. Senellart. Combined tractability of query evaluation via tree automata and cycluits (extended version). ArXiv e-prints 2017. https://arxiv.org/abs/1612.04203v1. Extended version ofciteamarilli2017combined. A. Amarilli P. Bourhis M. Monet and P. Senellart. Combined tractability of query evaluation via tree automata and cycluits (extended version). ArXiv e-prints 2017. https://arxiv.org/abs/1612.04203v1. Extended version ofciteamarilli2017combined.

2. Provenance Circuits for Trees and Treelike Instances

3. A. Amarilli P. Bourhis and P. Senellart. Provenance circuits for trees and treelike instances (extended version). CoRR abs/1511.08723 2015. http://arxiv.org/abs/1511.08723. Extended version ofciteamarilli2015provenance. 10.1007/978-3-662-47666-6_5 A. Amarilli P. Bourhis and P. Senellart. Provenance circuits for trees and treelike instances (extended version). CoRR abs/1511.08723 2015. http://arxiv.org/abs/1511.08723. Extended version ofciteamarilli2015provenance. 10.1007/978-3-662-47666-6_5

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

1. An epistemic approach to model uncertainty in data-graphs;International Journal of Approximate Reasoning;2023-09

2. Probabilistic Query Evaluation: The Combined FPRAS Landscape;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18

3. The uniform measure of simple regular sets of infinite trees;Information and Computation;2021-06

4. Open-world probabilistic databases: Semantics, algorithms, complexity;Artificial Intelligence;2021-06

5. New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins;Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2020-05-29