On the public citation graph

Rewriting systems as a tool for relational data base design

https://doi.org/10.1007/bfb0025717
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.
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.1007/3-540-08921-7_66openalex-snapshot
Deriving structures from structures
inferredcites →https://doi.org/10.1007/bf00289616openalex-snapshot
Deriving graphs from graphs by applying a production
inferredcites →https://doi.org/10.1007/bf02241984openalex-snapshot
Formal languages of labelled graphs
inferredcites →https://doi.org/10.1016/s0019-9958(70)90135-xopenalex-snapshot
Separable graphs, planar graphs and web grammars
inferredcites →https://doi.org/10.1145/1734714.1734718openalex-snapshot
A data base sublanguage founded on the relational calculus
inferredcites →https://doi.org/10.1145/320576.320580openalex-snapshot
Independent components of relations
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
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/509383.509398openalex-snapshot
A constructive definition of third normal form
inferredcites →https://doi.org/10.1145/984395.984399openalex-snapshot
Research directions in data base management systems
inferredcites →https://doi.org/10.1147/rd.175.0374openalex-snapshot
Decomposition of a Data Base and the Theory of Boolean Switching Functions
inferredcites →https://doi.org/10.1147/rd.191.0071openalex-snapshot
Segment Synthesis in Logical Data Base Design

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-10291-4_13openalex-snapshot
Schema hypergraphs:A formalism to investigate logical data base design
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_15openalex-snapshot
Graph algorithms for the synthesis and manipulation of data base schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5_13openalex-snapshot
A Port Graph Rewriting Approach to Relational Database Modelling
inferred← citeshttps://doi.org/10.1007/978-3-7091-4338-4_5openalex-snapshot
Minimal Representations of Directed Hypergraphs and Their Application to Database Design
inferred← citeshttps://doi.org/10.1007/bf02249935openalex-snapshot
On the generative power of sequential and parallel programmed graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0022515openalex-snapshot
Node-label controlled graph grammars (Extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0025721openalex-snapshot
Decomposition of graph grammar productions and derivations
inferred← citeshttps://doi.org/10.1016/0306-4379(80)90014-9openalex-snapshot
Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90026-3openalex-snapshot
An architecture for processing graph-grammar applications
inferred← citeshttps://doi.org/10.1051/ita/1983170200971openalex-snapshot
Relational data base design using refinement rules
inferred← citeshttps://doi.org/10.1145/2157.322404openalex-snapshot
Graph Algorithms for Functional Dependency Manipulation
inferred← citeshttps://doi.org/10.1145/3414080.3414090openalex-snapshot
Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting
inferred← citeshttps://doi.org/10.21936/si2011_v32.n4b.129openalex-snapshot
Projektowanie wizualne z wykorzystaniem hierarchicznych hipergrafów
inferred← citeshttps://doi.org/10.4204/eptcs.288.5openalex-snapshot
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting
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.