Christoph Standke

Probabilistic Query Evaluation with Bag Semantics

2022 · arXiv (Cornell University)

We study the complexity of evaluating queries on probabilistic databases under bag semantics. We focus on self-join free conjunctive queries, and probabilistic databases where occurrences of different facts are independent, which is the natural generalization …

The Complexity of Homomorphism Reconstructibility

2023 · arXiv (Cornell University)

Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would like to …