DBScholar

Back to papers

On the Satisfiability of Dependency Constraints in Entity-Relationship Schemata

Summary: Recasts ER cardinality-ratio dependency satisfiability as “strong satisfiability,” excluding schemas forcing entities or relationships empty. Characterizes it exactly via feasibility of a linear inequality system and identifies constraint sets causing failure. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
7987
Venue
VLDB
Year
1987
Pagerank
5.3292816e-05
Overall Rank
9,029 | 38.06%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lenzerini_vldb87,
        title = {{On the Satisfiability of Dependency Constraints in Entity-Relationship Schemata}},
        author = {Lenzerini, Maurizio and Nobili, Paolo},
        journal = {PVLDB},
        series = {{VLDB} '87},
        pages = {147},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
9,985 Projection-Compliant Database Generation 2022 VLDB 5.1842045e-05
13,140 A Deductive Method for Entity-Relationship Modeling (Extended Abstract) 1989 VLDB 5.093636e-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