The MatBase algorithm translates (E)MDM schemes into E-R data models and is proven linear, sound, complete, and semi-optimal.
ACM Transactions on Database Systems1(1), 9–36 (1976)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Object orientation's partitioning of functionality into domain-corresponding objects is neither natural nor straightforward and inevitably produces fragmentation and conflation, so software engineering should abandon it for an approach that decouples domain individuals from functional modules.
A pseudocode algorithm converts mathematical database schemes into relational ones with non-relational constraints, claimed to be fast, solid, complete, and optimal, demonstrated on genealogical trees with SQL and VBA examples.
citing papers explorer
-
MatBase algorithm for translating (E)MDM schemes into E-R data models
The MatBase algorithm translates (E)MDM schemes into E-R data models and is proven linear, sound, complete, and semi-optimal.
-
Beyond Objects
Object orientation's partitioning of functionality into domain-corresponding objects is neither natural nor straightforward and inevitably produces fragmentation and conflation, so software engineering should abandon it for an approach that decouples domain individuals from functional modules.
-
Translating database mathematical schemes into relational database software applications with MatBase
A pseudocode algorithm converts mathematical database schemes into relational ones with non-relational constraints, claimed to be fast, solid, complete, and optimal, demonstrated on genealogical trees with SQL and VBA examples.