A Less Costly Constraints Checking for Join Dependency

Summary: Partition-based notation and method to test join dependencies while pruning redundant equalities. Partitioning the attribute universe into n disjoint sets reduces per-run time by (n-1)/2 for n>3, enabling scalable verification on large relations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7633
Venue: VLDB
Year: 1984
Pagerank: 4.1945683e-05
Overall Rank: 13,042 | 9.27%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. K. P. Tan

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
1,884	Normal forms and relational database operators	1979	SIGMOD	0.00010215563

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,168	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD	5.1716335e-05
12,950	Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction	1988	PODS	4.1945683e-05
2,275	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB	9.1262202e-05
25	Dependency Inference (Extended Abstract)	1987	VLDB	0.00083101742
7,824	Optimization of Multiple-Relation Multiple-Disjunct Queries	1988	PODS	4.6418459e-05
9,486	Quantifying the Loss of Acyclic Join Dependencies	2023	PODS	4.3341665e-05
3,515	Scalable Computation of Acyclic Joins (Extended Abstract)	2006	PODS	7.0220813e-05
441	Computing Joins Of Relations	1975	SIGMOD	0.00023058395
1,196	On Computing Restricted Projections of Representative Instances	1985	PODS	0.00013403617
6,033	Embedded Join Dependencies As A Tool For Decomposing Full Join Dependencies	1985	PODS	5.2415551e-05