DBScholar

Back to papers

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
7824
Venue
VLDB
Year
1984
Pagerank
5.093636e-05
Overall Rank
13,241 | 9.16%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{tan_vldb84,
        title = {{A Less Costly Constraints Checking for Join Dependency}},
        author = {Tan, K. P.},
        journal = {PVLDB},
        series = {{VLDB} '84},
        pages = {63},
        year = {1984}
}

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 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
2,422 Normal forms and relational database operators 1979 SIGMOD 8.6023273e-05
Previous Page 1 / 1 Next

Semantically Similar Papers