On the public citation graph

An extension of conflict-free multivalued dependency sets

0 signed · 30 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/cmpsac.1979.762526openalex-snapshot
Semantic aspects of data dependencies and their application to relational database design
inferredcites →https://doi.org/10.1137/0210025openalex-snapshot
Equivalence of Relational Database Schemes
inferredcites →https://doi.org/10.1137/0210059openalex-snapshot
Power of Natural Semijoins
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/320107.320115openalex-snapshot
Testing implications of data dependencies
inferredcites →https://doi.org/10.1145/320493.320489openalex-snapshot
Synthesizing third normal form relations from functional dependencies
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/322261.322263openalex-snapshot
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
inferredcites →https://doi.org/10.1145/322307.322311openalex-snapshot
On the Equivalence of Database Models
inferredcites →https://doi.org/10.1145/582095.582118openalex-snapshot
Synthesizing independent database schemas
inferredcites →https://doi.org/10.1145/582318.582337openalex-snapshot
Real-world MVD's
inferredcites →https://doi.org/10.1145/588058.588092openalex-snapshot
On the recognition of coverings of acyclic database hypergraphs
inferredcites →https://doi.org/10.1145/800076.802489openalex-snapshot
Properties of acyclic database schemes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-17187-8_50openalex-snapshot
Interaction-free multivalued dependency sets
inferred← citeshttps://doi.org/10.1007/3-540-19121-6_11openalex-snapshot
Designing alpha-acyclic BCNF-database schemes
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_14openalex-snapshot
Designing gamma-acyclic database schemes using decomposition and augmentation techniques
inferred← citeshttps://doi.org/10.1007/3-540-51171-7_31openalex-snapshot
On the normalization in Nested Relational Databases
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(89)90008-1openalex-snapshot
A characterization of finite fd-acyclicity
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(86)90016-2openalex-snapshot
Interaction-free multivalued dependency sets
inferred← citeshttps://doi.org/10.1016/0950-5849(92)90060-3openalex-snapshot
Efficient algorithm for BCNF-decomposition
inferred← citeshttps://doi.org/10.1109/icde.1987.7272429openalex-snapshot
A design method for nested relational databases
inferred← citeshttps://doi.org/10.1145/155271.155277openalex-snapshot
Solving queries by tree projections
inferred← citeshttps://doi.org/10.1145/28659.28663openalex-snapshot
Logical design of relational database schemes
inferred← citeshttps://doi.org/10.1145/38713.38733openalex-snapshot
The design of ¬ 1NF relational databases into nested normal form
inferred← citeshttps://doi.org/10.1145/38714.38733openalex-snapshot
The design of ¬ 1NF relational databases into nested normal form
inferred← citeshttps://doi.org/10.1145/6012.15413openalex-snapshot
The equivalence of solving queries and producing tree projections (extended abstract)
inferred← citeshttps://doi.org/10.1145/6012.15414openalex-snapshot
Unifying functional and multivalued dependencies for relational database design
inferred← citeshttps://doi.org/10.1145/6012.15422openalex-snapshot
Sagiv,Y-On finite FD-acyclicity
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.