On the public citation graph
Decision Problems for Multivalued Dependencies in Relational Databases
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1145/320557.320571openalex-snapshot
Multivalued dependencies and a new normal form for relational databases
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1147/rd.216.0534openalex-snapshot
Functional Dependencies in a Relational Database and Propositional Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11663881_15openalex-snapshot
On Multivalued Dependencies in Fixed and Undetermined Universes
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_75openalex-snapshot
An almost linear time algorithm for computing a dependency basis in a relational data base
inferred← citeshttps://doi.org/10.1007/3-540-11214-6_8openalex-snapshot
Problems of relational database design
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_1openalex-snapshot
The theory of data dependencies — An overview
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_17openalex-snapshot
The implication problem for functional and multivalued dependencies : An algebraic approach
inferred← citeshttps://doi.org/10.1007/978-3-540-77684-0_7openalex-snapshot
Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes
inferred← citeshttps://doi.org/10.1007/bf00290729openalex-snapshot
Inferring multivalued dependencies from functional and join dependencies
inferred← citeshttps://doi.org/10.1007/bf01934180openalex-snapshot
On finding a worst-case optimal Fourth Normal Form database decomposition
inferred← citeshttps://doi.org/10.1007/s00236-008-0080-5openalex-snapshot
Charting the completeness frontier of inference systems for multivalued dependencies
inferred← citeshttps://doi.org/10.1007/s10472-005-9015-9openalex-snapshot
Functional and multivalued dependencies in nested databases generated by record and list constructor
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90054-copenalex-snapshot
Unifying functional and multivalued dependencies for relational database design
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90034-gopenalex-snapshot
Design of desirable relational database schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90143-3openalex-snapshot
Membership problem for embedded multivalued dependencies under some restricted conditions
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90021-1openalex-snapshot
An algebraic theory of functional and multivalued dependencies in relational databases
inferred← citeshttps://doi.org/10.1016/0306-4379(81)90015-6openalex-snapshot
On data dependency structures of relational databases
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.012openalex-snapshot
Characterisations of multivalued dependency implication over undetermined universes
inferred← citeshttps://doi.org/10.1137/0212015openalex-snapshot
Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard
inferred← citeshttps://doi.org/10.1145/1055558.1055603openalex-snapshot
Multi-valued dependencies in the presence of lists
inferred← citeshttps://doi.org/10.1145/1807085.1807126openalex-snapshot
When data dependencies over SQL tables meet the logics of paradox and S-3
inferred← citeshttps://doi.org/10.1145/2188349.2188355openalex-snapshot
The implication problem of data dependencies over SQL table definitions
inferred← citeshttps://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferred← citeshttps://doi.org/10.1145/319540.319542openalex-snapshot
On the design of relational database schemata
inferred← citeshttps://doi.org/10.1145/320107.320115openalex-snapshot
Testing implications of data dependencies
inferred← citeshttps://doi.org/10.1145/320613.320614openalex-snapshot
On the menbership problem for functional and multivalued dependencies in relational databases
inferred← citeshttps://doi.org/10.1145/322186.322190openalex-snapshot
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
inferred← citeshttps://doi.org/10.1145/322261.322263openalex-snapshot
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
inferred← citeshttps://doi.org/10.1145/322290.322296openalex-snapshot
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
inferred← citeshttps://doi.org/10.1145/322290.322297openalex-snapshot
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
inferred← citeshttps://doi.org/10.1145/582095.582119openalex-snapshot
Testing implications of data dependencies
inferred← citeshttps://doi.org/10.1145/800176.809996openalex-snapshot
Decomposition of a relation scheme into Boyce-Codd Normal Form
inferred← citeshttps://doi.org/10.1145/990511.990513openalex-snapshot
Decomposition of a relation scheme into Boyce-Codd Normal Form
inferred← citeshttps://doi.org/10.26180/14973144openalex-snapshot
The semantic justification for normal forms in relational database design
inferred← citeshttps://doi.org/10.3233/fi-2011-385openalex-snapshot
On Inferences of Full First-Order Hierarchical Decompositions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.