On the public citation graph
Finding candidate keys for relational data bases
0 signed · 24 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.1007/978-1-4684-2694-6_2openalex-snapshot
Relational Data Base Systems: A Tutorial
inferredcites →https://doi.org/10.1145/1734714.1734716openalex-snapshot
Normalized data base structure
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1147/rd.175.0374openalex-snapshot
Decomposition of a Data Base and the Theory of Boolean Switching Functions
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-10856-4_113openalex-snapshot
Key-equivalence of functional dependency statements systems
inferred← citeshttps://doi.org/10.1007/978-3-319-45321-7_23openalex-snapshot
Algorithms for Database Keys Discovery Assistance
inferred← citeshttps://doi.org/10.1007/s00778-003-0088-yopenalex-snapshot
Instance-based attribute identification in database integration
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90003-xopenalex-snapshot
On the complexity of finding the set of candidate keys for a given set of functional dependencies
inferred← citeshttps://doi.org/10.1016/0020-0190(78)90013-3openalex-snapshot
On the number of candidate keys
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90009-0openalex-snapshot
Candidate keys for relations
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90033-7openalex-snapshot
The number of keys in relational and nested relational databases
inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50035-2openalex-snapshot
A SOPHISTICATE'S INTRODUCTION TO DATABASE NORMALIZATION THEORY††This work was supported in part by the National Science Foundation under Grant MCS-77-05314.
inferred← citeshttps://doi.org/10.1023/a:1026258911996openalex-snapshot
Average Case Analysis in Database Problems
inferred← citeshttps://doi.org/10.1051/ita/1985190302131openalex-snapshot
Algorithme de décomposition de clés
inferred← citeshttps://doi.org/10.1109/cmpsac.1979.762527openalex-snapshot
Decomposition of a relation into fourth normal forms
inferred← citeshttps://doi.org/10.1109/csse.2008.441openalex-snapshot
Use Closure of Relevant Sets of Attributes to Efficiently Find Candidate Keys
inferred← citeshttps://doi.org/10.1109/iciii.2009.515openalex-snapshot
Determining All Candidate Keys Based on Karnaugh Map
inferred← citeshttps://doi.org/10.1145/2579474.2579476openalex-snapshot
An overview of recent data base research
inferred← citeshttps://doi.org/10.1145/503896.503922openalex-snapshot
A hierarchical method for synthesizing relations
inferred← citeshttps://doi.org/10.14778/3407790.3407824openalex-snapshot
Hitting set enumeration with partial information for unique column combination discovery
inferred← citeshttps://doi.org/10.2308/jeta-2024-022openalex-snapshot
REA for Dummies: A Beginner’s Guide to One of the Most Important and Perplexing Innovations in Accounting
inferred← citeshttps://doi.org/10.26180/14973144openalex-snapshot
The semantic justification for normal forms in relational database design
inferred← citeshttps://doi.org/10.4114/intartif.vol24iss68pp37-52openalex-snapshot
KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases
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.