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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.