On the public citation graph
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
0 signed · 33 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/978-1-4684-2694-6_4openalex-snapshot
A Data Base Search Problem
inferredcites →https://doi.org/10.1137/0208017openalex-snapshot
Equivalences among Relational Expressions
inferredcites →https://doi.org/10.1137/0210030openalex-snapshot
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
inferredcites →https://doi.org/10.1145/320083.320091openalex-snapshot
The theory of joins in relational databases
inferredcites →https://doi.org/10.1145/320107.320112openalex-snapshot
Efficient optimization of a class of relational expressions
inferredcites →https://doi.org/10.1145/320473.320479openalex-snapshot
Decomposition—a strategy for query processing
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/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1147/rd.203.0244openalex-snapshot
Optimization of Single Expressions in a Relational Data Base System
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-18625-5_54openalex-snapshot
An O(n2) algorithm for fan-out free query optimization
inferred← citeshttps://doi.org/10.1007/3-540-45495-0_3openalex-snapshot
Improving Query Evaluation with Approximate Functional Dependency Based Decompositions
inferred← citeshttps://doi.org/10.1007/3-540-50171-1_11openalex-snapshot
An O(N2) equivalence algorithm for fan-out free queries
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_68openalex-snapshot
Finding two-tree-factor elements of tableau-defined monoids in time O(n 3)
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_95openalex-snapshot
Optimization of a subclass of conjunctive queries
inferred← citeshttps://doi.org/10.1007/bf01185403openalex-snapshot
Optimization of a subclass of conjunctive queries
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00040-9openalex-snapshot
Some results on the containment and minimization of (in) equality queries
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90032-6openalex-snapshot
Minimizing restricted-fanout queries
inferred← citeshttps://doi.org/10.1109/69.649315openalex-snapshot
Implication and referential constraints: a new formal reasoning
inferred← citeshttps://doi.org/10.1109/sfcs.1981.33openalex-snapshot
Optimizing conjunctive queries when attribute domains are not disjoint
inferred← citeshttps://doi.org/10.1137/0217001openalex-snapshot
On Bounded Database Schemes and Bounded Horn-Clause Programs
inferred← citeshttps://doi.org/10.1145/102782.102787openalex-snapshot
Evaluation of queries in independent database schemes
inferred← citeshttps://doi.org/10.1145/1739041.1739103openalex-snapshot
Subsumption and complementation as data fusion operators
inferred← citeshttps://doi.org/10.1145/325405.325427openalex-snapshot
On computing restricted projections of representative instances
inferred← citeshttps://doi.org/10.1145/356924.356928openalex-snapshot
Query Optimization in Database Systems
inferred← citeshttps://doi.org/10.1145/42267.42273openalex-snapshot
On conjunctive queries containing inequalities
inferred← citeshttps://doi.org/10.1145/602259.602280openalex-snapshot
Optimal computation of total projections with unions of simple chase join expressions
inferred← citeshttps://doi.org/10.1145/602259.602298openalex-snapshot
An optimizing prolog front-end to a relational query system
inferred← citeshttps://doi.org/10.1145/602296.602298openalex-snapshot
An optimizing prolog front-end to a relational query system
inferred← citeshttps://doi.org/10.1145/63500.63520openalex-snapshot
Efficient optimization of simple chase join expressions
inferred← citeshttps://doi.org/10.1145/971697.602280openalex-snapshot
Optimal computation of total projections with unions of simple chase join expressions
inferred← citeshttps://doi.org/10.1145/971697.602298openalex-snapshot
An optimizing prolog front-end to a relational query system
inferred← citeshttps://doi.org/10.20381/ruor-4622openalex-snapshot
Tabular Representation of Schema Mappings: Semantics and Algorithms
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.