DBScholar

Back to papers

On Equivalences of Database Schemes

Summary: Shows natural equivalence equals fixpoint equivalence for database schemas without any restriction on constraints, proving the weaker-seeming notion already captures the full semantics. For schemas with functional dependencies, gives a compact syntactic characterization of natural equivalence. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
604
Venue
PODS
Year
1982
Pagerank
7.5732637e-05
Overall Rank
3,276 | 77.53%
DOI
10.1145/588111.588116

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{rissanen_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{On Equivalences of Database Schemes}},
        url = {https://dl.acm.org/doi/10.1145/588111.588116},
        doi = {10.1145/588111.588116},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Rissanen, Jorma},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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
495 A Complete Axiomatization For Functional And Multivalued Dependencies In Database Relations 1977 SIGMOD 0.00017513721
Previous Page 1 / 1 Next

Semantically Similar Papers