DBScholar

Back to papers

Extremal Fitting Problems for Conjunctive Queries

Summary: Defines extremal refinements of CQ fitting (most-general, most-specific, unique) and gives constructive characterizations via homomorphism dualities, frontiers, and direct products. Determines complexity and size bounds for existence/verification and extends results to UCQs and tree CQs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1906
Venue
PODS
Year
2023
Pagerank
5.093636e-05
Overall Rank
11,363 | 22.04%
DOI
10.1145/3584372.3588655

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{cate_pods23,
        address = {New York, NY, USA},
        series = {{PODS} '23},
        title = {{Extremal Fitting Problems for Conjunctive Queries}},
        url = {https://dl.acm.org/doi/10.1145/3584372.3588655},
        doi = {10.1145/3584372.3588655},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Cate, Balder ten and Dalmau, Victor and Funk, Maurice and Lutz, Carsten},
        year = {2023}
}

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 6 of 6 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