Database Paper Browser

Back to papers

Solving Implication Problems in Database Applications

Summary: Graph/SAT framing of the implication problem for derived DB relations, relevant to query derivation, view maintenance, and optimization. General problem NP-hard with all six operators and both conjunctions and disjunctions; polynomial-time algorithm for restricted case (no != in Q, no disjunction in T); analyzes # and disjunctions, giving necessary conditions to detect tractable instances for heuristics. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2440
Venue
SIGMOD
Year
1989
Pagerank
5.2211593e-05
Overall Rank
6,074 | 57.79%
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
2,647 WATCHMAN: A Data Warehouse Intelligent Cache Manager 1996 VLDB 8.3750419e-05
5,136 Temporal Query Processing and Optimization in Multiprocessor Database Machines 1992 VLDB 5.6666995e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 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.00065687017
406 Global Query Optimization 1986 SIGMOD 0.00023989944
413 Computing Queries from Derived Relations 1985 VLDB 0.00023802724
927 Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates 1986 VLDB 0.00015237571
3,160 Horizontal Data Partitioning In Database Design 1982 SIGMOD 7.4649653e-05
7,882 Fragments Of Relations 1983 SIGMOD 4.6242644e-05
Previous Page 1 / 1 Next

Semantically Similar Papers