On the public citation graph
Equivalence of Keyed Relational Schemas by Conjunctive Queries
0 signed · 26 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.1016/0022-0000(80)90029-xopenalex-snapshot
Adequacy of decompositions of relational databases
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
inferredcites →https://doi.org/10.1016/0304-3975(82)90038-xopenalex-snapshot
Inclusion and equivalence between relational database schemata
inferredcites →https://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.
inferredcites →https://doi.org/10.1137/0210025openalex-snapshot
Equivalence of Relational Database Schemes
inferredcites →https://doi.org/10.1137/0215061openalex-snapshot
Relative Information Capacity of Simple Relational Database Schemata
inferredcites →https://doi.org/10.1145/176567.176568openalex-snapshot
Tools and transformations—rigorous and otherwise—for practical database design
inferredcites →https://doi.org/10.1145/263661.263667openalex-snapshot
Conjunctive query equivalence of keyed relational schemas (extended abstract)
inferredcites →https://doi.org/10.1145/27633.27634openalex-snapshot
A comparative analysis of methodologies for database schema integration
inferredcites →https://doi.org/10.1145/319566.319583openalex-snapshot
An improved third normal form for relational databases
inferredcites →https://doi.org/10.1145/319732.319749openalex-snapshot
A new normal form for the design of relational database schemata
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/588111.588116openalex-snapshot
On equivalences of database schemes
inferredcites →https://doi.org/10.1145/96602.96604openalex-snapshot
Federated database systems for managing distributed, heterogeneous, and autonomous databases
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-44957-4_66openalex-snapshot
Linearly Bounded Reformulations of Conjunctive Databases
inferred← citeshttps://doi.org/10.1007/978-3-031-15743-1_56openalex-snapshot
Formalization of Data Integration Transformations
inferred← citeshttps://doi.org/10.1109/aike.2019.00019openalex-snapshot
On Preserving Information in Schema Transformations: A Constructive Perspective
inferred← citeshttps://doi.org/10.1142/s1793351x20400024openalex-snapshot
A Study on Information-Preserving Schema Transformations
inferred← citeshttps://doi.org/10.1145/1059513.1059519openalex-snapshot
An information-theoretic approach to normal forms for relational and XML data
inferred← citeshttps://doi.org/10.1145/1142351.1142369openalex-snapshot
On redundancy vs dependency preservation in normalization
inferred← citeshttps://doi.org/10.1145/3158144openalex-snapshot
Verifying equivalence of database-driven applications
inferred← citeshttps://doi.org/10.1145/354756.354854openalex-snapshot
Theoretical foundations of schema restructuring in heterogeneous multidatabase systems
inferred← citeshttps://doi.org/10.1145/773153.773155openalex-snapshot
An information-theoretic approach to normal forms for relational and XML data
inferred← citeshttps://doi.org/10.14778/3342263.3342267openalex-snapshot
Automated verification of query equivalence using satisfiability modulo theories
inferred← citeshttps://doi.org/10.4018/jkm.2012010102openalex-snapshot
Knowledge Bases Over Algebraic Models
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.