DBScholar

Back to papers

Smallest Synthetic Witnesses for Conjunctive Queries

Summary: Defines synthetic witnesses D for a self-join-free CQ Q and S; ESW in P, SSW in P when Q is head-dominant. Dichotomy: SSW poly-time for head-dominant Berge-acyclic Q; NP-hard without head-domination and for some cyclic queries; applications to test-data generation and compression. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h93c0ef5169dd5c99
Venue
PODS
Year
2025
Pagerank
4.9793485e-05
Overall Rank
11,095 | 25.41%
DOI
10.1145/3725250

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{esmailpour_pods25,
        address = {New York, NY, USA},
        series = {{PODS} '25},
        title = {{Smallest Synthetic Witnesses for Conjunctive Queries}},
        url = {https://dl.acm.org/doi/10.1145/3725250},
        doi = {10.1145/3725250},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Esmailpour, Aryan and Glavic, Boris and Hu, Xiao and Sintos, Stavros},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

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

Rank Cited Paper Year Venue Pagerank
17 Provenance Semirings 2007 PODS 0.00059752575
57 On Random Sampling over Joins 1999 SIGMOD 0.00040108301
590 On Propagation of Deletions and Annotations Through Views 2002 PODS 0.00015890019
747 QAGen: Generating Query-Aware Test Databases 2007 SIGMOD 0.00014283935
795 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013938779
819 Provenance for Aggregate Queries 2011 PODS 0.00013666629
2,067 Explaining Missing Answers to SPJUA Queries 2010 VLDB 9.0924963e-05
4,062 The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries 2016 VLDB 6.8247395e-05
4,323 Multi-Tuple Deletion Propagation: Approximations and Complexity 2013 VLDB 6.6658586e-05
4,437 Maximizing Conjunctive Views in Deletion Propagation 2011 PODS 6.6001218e-05
4,475 Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins 2016 PODS 6.5838041e-05
4,747 New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins 2020 PODS 6.4374568e-05
4,847 Explaining Wrong Queries Using Small Examples 2019 SIGMOD 6.3823876e-05
6,221 Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing 2021 SIGMOD 5.8463347e-05
6,589 Mining Approximate Acyclic Schemes from Relations 2020 SIGMOD 5.7427998e-05
7,383 Aggregated Deletion Propagation for Counting Conjunctive Query Answers 2021 VLDB 5.5387855e-05
7,419 A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations 2023 SIGMOD 5.5326094e-05
8,761 Is Integer Linear Programming All You Need for Deletion Propagation? A Unified and Practical Approach for Generalized Deletion Propagation 2025 VLDB 5.283642e-05
8,762 Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries 2024 PODS 5.283642e-05
9,875 Quantifying the Loss of Acyclic Join Dependencies 2023 PODS 5.1176637e-05
Previous Page 1 / 1 Next

Semantically Similar Papers