On the public citation graph

Some Results on the Representative Instance in Relational Databases

0 signed · 35 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.1145/319628.319630openalex-snapshot
Consequences of assuming a universal relation
inferredcites →https://doi.org/10.1145/319983.319988openalex-snapshot
A characterization of globally consistent databases and their correct access paths
inferredcites →https://doi.org/10.1145/320064.320066openalex-snapshot
Computational problems related to the design of normal form relational schemas
inferredcites →https://doi.org/10.1145/320083.320091openalex-snapshot
The theory of joins in relational databases
inferredcites →https://doi.org/10.1145/320107.320115openalex-snapshot
Testing implications of data dependencies
inferredcites →https://doi.org/10.1145/322326.322330openalex-snapshot
Testing satisfaction of functional dependencies
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.4690220303openalex-snapshot
Optimizing universal queries in relational databases
inferred← citeshttps://doi.org/10.1002/scj.4690220304openalex-snapshot
A method to detect distinctive features from boundary data
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_32openalex-snapshot
On the desirability of γ-acyclic BCNF database schemes
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_171openalex-snapshot
Incremental database design revisited
inferred← citeshttps://doi.org/10.1007/978-3-7091-2704-9_5openalex-snapshot
The Weak Instance Model
inferred← citeshttps://doi.org/10.1007/bf00279950openalex-snapshot
On generating database schemes bounded or constant-time-maintainable by extensibility
inferred← citeshttps://doi.org/10.1007/bf01261656openalex-snapshot
Independent database schemes under functional and inclusion dependencies
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90180-9openalex-snapshot
Testing unboundedness of database schemes and functional dependencies
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90032-gopenalex-snapshot
A new interpretation for null values in the weak instance model
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90001-yopenalex-snapshot
Connection-trap-free database schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90012-5openalex-snapshot
On the desirability of γ-acyclic BCNF database schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90172-eopenalex-snapshot
Efficient and optimal query answering on independent schemes
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90308-3openalex-snapshot
On characterizing boundedness of database schemes with bounded dependencies
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferred← citeshttps://doi.org/10.1137/0217001openalex-snapshot
On Bounded Database Schemes and Bounded Horn-Clause Programs
inferred← citeshttps://doi.org/10.1137/0218030openalex-snapshot
A Design Theory for Solving the Anomalies Problem
inferred← citeshttps://doi.org/10.1137/0222003openalex-snapshot
On the Boundedness of Constant-Time-Maintainable Database Schemes
inferred← citeshttps://doi.org/10.1137/s009753979325799xopenalex-snapshot
Efficient Database Updates with Independent Schemes
inferred← citeshttps://doi.org/10.1145/102782.102787openalex-snapshot
Evaluation of queries in independent database schemes
inferred← citeshttps://doi.org/10.1145/115234.115362openalex-snapshot
Independence-reducible database schemes
inferred← citeshttps://doi.org/10.1145/115302.115301openalex-snapshot
Constant-time-maintainable BCNF database schemes
inferred← citeshttps://doi.org/10.1145/23005.23007openalex-snapshot
Answering queries on embedded-complete database schemes
inferred← citeshttps://doi.org/10.1145/6012.15411openalex-snapshot
On the properties and characterization of connection-trap-free schemes
inferred← citeshttps://doi.org/10.1145/63500.63520openalex-snapshot
Efficient optimization of simple chase join expressions
inferred← citeshttps://doi.org/10.1145/73721.73733openalex-snapshot
Can constant-time-maintainability be more practical?
inferred← citeshttps://doi.org/10.1145/93597.93624openalex-snapshot
Polynomial time designs toward both BCNF and efficient data manipulation
inferred← citeshttps://doi.org/10.1145/93605.93624openalex-snapshot
Polynomial time designs toward both BCNF and efficient data manipulation
inferred← citeshttps://doi.org/10.1145/971701.50228openalex-snapshot
A characterization of constant-time maintainability for BCNF database schemes
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.