On the public citation graph
On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs
0 signed · 32 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.1007/3-540-08921-7_60openalex-snapshot
On the completeness of query languages for relational data bases
inferredcites →https://doi.org/10.1007/978-1-4612-0333-9openalex-snapshot
The Graph Isomorphism Problem
inferredcites →https://doi.org/10.1007/s002240000087openalex-snapshot
Expressiveness and Complexity of Generic Graph Machines
inferredcites →https://doi.org/10.1016/0020-0190(78)90055-8openalex-snapshot
On the expressive power of the relational algebra
inferredcites →https://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferredcites →https://doi.org/10.1109/icde.2005.126openalex-snapshot
Schema Matching Using Duplicates
inferredcites →https://doi.org/10.1145/1055558.1055560openalex-snapshot
The Lixto data extraction project
inferredcites →https://doi.org/10.1145/1065167.1065176openalex-snapshot
Schema mappings, data exchange, and metadata management
inferredcites →https://doi.org/10.1145/1142351.1142397openalex-snapshot
Structural characterizations of the semantics of XPath as navigation tool on a document
inferredcites →https://doi.org/10.1145/1376916.1376921openalex-snapshot
On the complexity of deriving schema mappings from database instances
inferredcites →https://doi.org/10.1145/76359.76364openalex-snapshot
A uniform approach toward handling atomic and structured information in the nested relational database model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-10562-3_2openalex-snapshot
Towards a General Framework for Effective Solutions to the Data Mapping Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-41660-6_3openalex-snapshot
High-Level Rules for Integration and Analysis of Data: New Challenges
inferred← citeshttps://doi.org/10.1016/j.ic.2015.07.003openalex-snapshot
The complexity of higher-order queries
inferred← citeshttps://doi.org/10.1109/69.390249openalex-snapshot
G-Log: a graph-based query language
inferred← citeshttps://doi.org/10.1145/1807085.1807091openalex-snapshot
Positive higher-order queries
inferred← citeshttps://doi.org/10.1145/1989323.1989338openalex-snapshot
Designing and refining schema mappings via data examples
inferred← citeshttps://doi.org/10.1145/2448496.2448514openalex-snapshot
Definability problems for graph query languages
inferred← citeshttps://doi.org/10.1145/2452376.2452479openalex-snapshot
Schema mappings and data examples
inferred← citeshttps://doi.org/10.1145/2457317.2457349openalex-snapshot
What we talk about when we talk about graphs
inferred← citeshttps://doi.org/10.1145/2483574.2483576openalex-snapshot
Learning queries for relational, semi-structured, and graph databases
inferred← citeshttps://doi.org/10.1145/2818637openalex-snapshot
Learning Join Queries from User Examples
inferred← citeshttps://doi.org/10.1145/2886095openalex-snapshot
The Exact Complexity of the First-Order Logic Definability Problem
inferred← citeshttps://doi.org/10.1145/3034786.3056112openalex-snapshot
Reverse Engineering SPJ-Queries from Examples
inferred← citeshttps://doi.org/10.1145/3641832.3641834openalex-snapshot
Fitting Algorithms for Conjunctive Queries
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2015.161openalex-snapshot
The Product Homomorphism Problem and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1801.06258openalex-snapshot
Towards a Theory of Data-Diff: Optimal Synthesis of Succinct Data Modification Scripts
inferred← citeshttps://doi.org/10.5287/ora-pp0apyvb2openalex-snapshot
Higher-order queries and applications
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.