Database Paper Browser

Back to papers

Partition Semantics for Relations

Summary: Introduce partition semantics for relations, defining partition dependencies (PDs) via the product/sum duality of partitions, generalizing FDs and able to express both functional determination and transitive closure. Characterize PD inference as the uniform word problem in a lattice, give polynomial-time inference and consistency algorithms, and relate PDs to variants of the weak-instance assumption. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
743
Venue
PODS
Year
1985
Pagerank
0.0001721247
Overall Rank
751 | 94.78%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers