Database Paper Browser

Back to papers

Differential Constraints

Summary: Define differential constraints—finite-difference equations on functions 2^U→R; characterize implication via lattice decompositions, give a sound and complete inference system, and prove coNP-completeness. Apply to concise frequent-itemset representations (disjunctive rules) and connect to positive boolean dependencies in relational DBs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1368
Venue
PODS
Year
2005
Pagerank
4.1945683e-05
Overall Rank
12,533 | 12.81%
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 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
36 Fast Algorithms for Mining Association Rules 1994 VLDB 0.00076161096
1,803 A Normal Form for XML Documents 2002 PODS 0.00010504331
3,240 Information Dependencies 2000 PODS 7.3316755e-05
8,315 Computational Complexity of Itemset Frequency Satisfiability 2004 PODS 4.5435639e-05
8,316 Multi-valued Dependencies in the Presence of Lists 2004 PODS 4.5435639e-05
8,321 A Condensed Representation to Find Frequent Patterns 2001 PODS 4.5435639e-05
Previous Page 1 / 1 Next

Semantically Similar Papers