38 citations · 63 across the 11 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DB2019★ 1 cited
Towards Deterministic Decomposable Circuits for Safe Queries
Mikaël Monet, Dan Olteanu
There exist two approaches for exact probabilistic inference of UCQs on tuple-independent databases. In the extensional approach, query evaluation is performed within a DBMS by exp…
cs.DB2019
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases
Mikaël Monet
We consider the problem of exact probabilistic inference for Union of Conjunctive Queries (UCQs) on tuple-independent databases. For this problem, two approaches currently coexist.…
cs.DB2019
Counting Problems over Incomplete Databases
Marcelo Arenas, Pablo Barceló, Mikaël Monet
We study the complexity of various fundamental counting problems that arise in the context of incomplete databases, i.e., relational databases that can contain unknown values in th…