DBScholar

Back to papers

Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory

Summary: Apply property testing to homomorphism inadmissibility for conjunctive queries: with constant queries and one-sided error, distinguish A→B from B that is far (needs deleting a constant fraction of tuples) from admitting a homomorphism. Main result: constant-query one-sided testability iff core(A) is α-acyclic; injective variant also testable for α-acyclic A, subsuming subgraph-freeness results. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1773
Venue
PODS
Year
2019
Pagerank
5.093636e-05
Overall Rank
11,832 | 18.83%
DOI
10.1145/3294052.3319679

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{chen_pods19,
        address = {New York, NY, USA},
        series = {{PODS} '19},
        title = {{Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory}},
        url = {https://dl.acm.org/doi/10.1145/3294052.3319679},
        doi = {10.1145/3294052.3319679},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chen, Hubie and Yoshida, Yuichi},
        year = {2019}
}

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