Database Paper Browser

Back to papers

On The Satisfiability Of Dependency Constraints In Entity-Relationship Schemata

Summary: Strong satisfiability for ER cardinality constraints; ordinary satisfiability ignores emptiness of entities/relationships. Models constraints as linear inequalities; strong satisfiability holds iff a solution exists, and shows how to spot cons-sets blocking it. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7797
Venue
VLDB
Year
1987
Pagerank
5.41182e-05
Overall Rank
8,903 | 38.13%
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
9,832 Projection-Compliant Database Generation 2022 VLDB 5.2644956e-05
12,955 A Deductive Method for Entity-Relationship Modeling (Extended Abstract) 1989 VLDB 5.1725247e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers