DBScholar

Back to papers

The Inference Problem for Template Dependencies

Summary: Template dependencies: integrity constraints stipulating that whenever tuples agree on certain attributes an additional agreeing tuple must exist. Proves implication/inference for template dependencies undecidable (no algorithm for logical consequence from a finite set), holds under both finite and unrestricted database semantics. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
630
Venue
PODS
Year
1982
Pagerank
6.8314006e-05
Overall Rank
4,210 | 71.12%
DOI
10.1145/588111.588148

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gurevich_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{The Inference Problem for Template Dependencies}},
        url = {https://dl.acm.org/doi/10.1145/588111.588148},
        doi = {10.1145/588111.588148},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gurevich, Yuri and Lewis, Harry R.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
3,291 The Implication And Finite Implication Problems For Typed Template Dependencies 1982 PODS 7.5526697e-05
3,485 The Complexity of Data Exchange 2006 PODS 7.3703451e-05
6,987 Embedded Join Dependencies As A Tool For Decomposing Full Join Dependencies 1985 PODS 5.7303405e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
3,291 The Implication And Finite Implication Problems For Typed Template Dependencies 1982 PODS 7.5526697e-05
Previous Page 1 / 1 Next

Semantically Similar Papers