DBScholar

Back to papers

A Dichotomy for Non-repeating Queries with Negation in Probabilistic Databases

Summary: Extends Dalvi–Suciu dichotomy to non-repeating conjunctive queries with negation over tuple-independent probabilistic DBs, showing each has either PTIME or #P-hard data complexity. Tractable cases = hierarchical queries, decidable in PTIME. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1624
Venue
PODS
Year
2014
Pagerank
5.7576811e-05
Overall Rank
6,839 | 53.08%
DOI
10.1145/2594538.2594549

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fink_pods14,
        address = {New York, NY, USA},
        series = {{PODS} '14},
        title = {{A Dichotomy for Non-repeating Queries with Negation in Probabilistic Databases}},
        url = {https://dl.acm.org/doi/10.1145/2594538.2594549},
        doi = {10.1145/2594538.2594549},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fink, Robert and Olteanu, Dan},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,225 Approximate Lifted Inference with Probabilistic Databases 2015 VLDB 6.310093e-05
7,640 Tractable Lineages on Treelike Instances: Limits and Extensions 2016 PODS 5.5766474e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers