On the public citation graph

Answering queries on embedded-complete database schemes

0 signed · 48 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/978-1-4684-3384-5_2openalex-snapshot
Data Base: Theory vs. Interpretation
inferredcites →https://doi.org/10.1016/0020-0190(82)90087-4openalex-snapshot
Strong equivalence of relational expressions under dependencies
inferredcites →https://doi.org/10.1016/0022-0000(84)90079-5openalex-snapshot
Independent database schemas
inferredcites →https://doi.org/10.1016/0167-9236(86)90037-0openalex-snapshot
Query answering and schema analysis under the weak instance model
inferredcites →https://doi.org/10.1109/vldb.1979.718118openalex-snapshot
Towards A Universal Relation Interface
inferredcites →https://doi.org/10.1137/0208017openalex-snapshot
Equivalences among Relational Expressions
inferredcites →https://doi.org/10.1137/0210025openalex-snapshot
Equivalence of Relational Database Schemes
inferredcites →https://doi.org/10.1137/0210059openalex-snapshot
Power of Natural Semijoins
inferredcites →https://doi.org/10.1137/0213001openalex-snapshot
On the Existence of Cook Semantics
inferredcites →https://doi.org/10.1137/0213006openalex-snapshot
Formal Systems for Tuple and Equality Generating Dependencies
inferredcites →https://doi.org/10.1137/0214026openalex-snapshot
Some Results on the Representative Instance in Relational Databases
inferredcites →https://doi.org/10.1137/0216055openalex-snapshot
Independent and Separable Database Schemes
inferredcites →https://doi.org/10.1145/1270.1209openalex-snapshot
SYSTEM/U: a database system based on the universal relation assumption
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/319732.319735openalex-snapshot
A simplied universal relation assumption and its properties
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/320107.320115openalex-snapshot
Testing implications of data dependencies
inferredcites →https://doi.org/10.1145/322217.322221openalex-snapshot
Equivalences Among Relational Expressions with the Union and Difference Operators
inferredcites →https://doi.org/10.1145/322326.322330openalex-snapshot
Testing satisfaction of functional dependencies
inferredcites →https://doi.org/10.1145/322344.322347openalex-snapshot
Horn clauses and database dependencies
inferredcites →https://doi.org/10.1145/325405.325429openalex-snapshot
Efficient query answering in the representative instance approach
inferredcites →https://doi.org/10.1145/329.318579openalex-snapshot
Database states and their tableaux
inferredcites →https://doi.org/10.1145/329.318580openalex-snapshot
On the foundations of the universal relation model
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/4904.4798openalex-snapshot
Notions of dependency satisfaction
inferredcites →https://doi.org/10.1145/509383.509403openalex-snapshot
A generalized access path model and its application to a relational data base system
inferredcites →https://doi.org/10.1145/509404.509408openalex-snapshot
An algorithm for servicing multi-relational queries
inferredcites →https://doi.org/10.1145/582318.582336openalex-snapshot
Can we use the universal instance assumption without using nulls?
inferredcites →https://doi.org/10.1145/588011.588051openalex-snapshot
Querying weak instances
inferredcites →https://doi.org/10.1145/6012.15411openalex-snapshot
On the properties and characterization of connection-trap-free schemes

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-17187-8_32openalex-snapshot
On the desirability of γ-acyclic BCNF database schemes
inferred← citeshttps://doi.org/10.1007/bf01261656openalex-snapshot
Independent database schemes under functional and inclusion 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/0169-023x(89)90028-1openalex-snapshot
A survey of the universal relation model
inferred← citeshttps://doi.org/10.1016/0169-023x(90)90031-8openalex-snapshot
UDH: A universal relation system
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/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
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/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/146931.146936openalex-snapshot
Updating relational databases through weak instance interfaces
inferred← citeshttps://doi.org/10.1145/308386.308431openalex-snapshot
Independence-reducible database schemes
inferred← citeshttps://doi.org/10.1145/63500.63520openalex-snapshot
Efficient optimization of simple chase join expressions
inferred← citeshttps://doi.org/10.1145/73721.73731openalex-snapshot
Updating databases in the weak instance model
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.