On the public citation graph

Transformations of data base structures

https://doi.org/10.1007/bfb0025723
0 signed · 19 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.1016/s0019-9958(70)90135-xopenalex-snapshot
Separable graphs, planar graphs and web grammars
inferredcites →https://doi.org/10.1109/tse.1977.231131openalex-snapshot
Use of Psychological Experimentation as an Aid to Development of a Query Language
inferredcites →https://doi.org/10.1145/1282480.1282482openalex-snapshot
Query-by-example
inferredcites →https://doi.org/10.1145/1499949.1500034openalex-snapshot
Query by example
inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferredcites →https://doi.org/10.1145/362588.362590openalex-snapshot
Introduction to “feature analysis of generalized data base management systems”
inferredcites →https://doi.org/10.1145/509404.509406openalex-snapshot
An algebra of quotient relations
inferredcites →https://doi.org/10.1145/509404.509413openalex-snapshot
Formal definition of mappings in a data base
inferredcites →https://doi.org/10.5555/800253.807714openalex-snapshot
The design of data type specifications

What points at this work

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

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/bfb0000101openalex-snapshot
Specification of data bases through rewriting rules
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/0022-0000(82)90029-0openalex-snapshot
Processes of transforming structures
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90016-xopenalex-snapshot
Parallelism and concurrency of graph manipulations
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/984532.984535openalex-snapshot
An informal approach to formal specifications
inferred← citeshttps://doi.org/10.1145/984540.984544openalex-snapshot
An informal approach to formal specifications
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.