DBScholar

Back to papers

A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies

Summary: Polynomial-time algorithm for testing whether X[R] and F imply X[S], under S ⊆ R and F embedded in R. Uses extended complete intersection graphs instead of tableaus, offering a new graph-based toolkit for join-dependency reasoning in data schemas. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2459
Venue
SIGMOD
Year
1988
Pagerank
5.093636e-05
Overall Rank
13,155 | 9.75%
DOI
10.1145/50202.50229

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{leuchner_sigmod88,
        title = {{A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies}},
        author = {Leuchner, J. and Miller, L. and Slutzki, G.},
        series = {{SIGMOD} '88},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/50202.50229},
        url = {https://dl.acm.org/doi/10.1145/50202.50229},
        year = {1988}
}

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 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1,111 The U. R. Strikes Back 1982 PODS 0.00012131168
6,987 Embedded Join Dependencies As A Tool For Decomposing Full Join Dependencies 1985 PODS 5.7303405e-05
Previous Page 1 / 1 Next

Semantically Similar Papers