Database Paper Browser

Back to papers

Path Expressions in Databases (Extended Abstract)

Summary: Introduces path-expression framework to analyze consistency of database states with sets of functional dependencies via weak instances and CONS(R,F) (states of R consistent with F). Gives an iff characterization for CONS(R,F)⊆CONS(R,G) and a polynomial-time tableau/chase-style algorithm using merging arguments to decide these dependency comparisons. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
673
Venue
PODS
Year
1983
Pagerank
4.1945683e-05
Overall Rank
13,050 | 9.22%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
Previous Page 1 / 1 Next

Semantically Similar Papers