Database Paper Browser

Back to papers

A Decision Procedure for Conjunctive Query Disjointness

Summary: Decides whether two conjunctive queries are always disjoint, resolving the view-recomputation-under-FDs problem; algorithm time is optimal unless directed reachability admits sublinear solutions. Key idea: combine FD and dense-order decision procedures via tableaux supporting <, <=, =, >=, >, !=. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
859
Venue
PODS
Year
1989
Pagerank
5.3482653e-05
Overall Rank
5,735 | 60.11%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,189 Independence of Logic Database Queries and Updates 1990 PODS 0.00013441514
2,341 Chasing Constrained Tuple-Generating Dependencies 1996 PODS 9.0034124e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
55 Efficiently Updating Materialized Views 1986 SIGMOD 0.00065762967
416 Computing Queries from Derived Relations 1985 VLDB 0.0002380776
929 Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates 1986 VLDB 0.00015241524
4,098 The Complexity Of Testing Predicate Locks 1979 SIGMOD 6.4546085e-05
Previous Page 1 / 1 Next

Semantically Similar Papers