On the public citation graph

SafeBound: A Practical System for Generating Cardinality Bounds

0 signed · 40 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/2220357.2220363openalex-snapshot
Size and Treewidth Bounds for Conjunctive Queries
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/2902251.2902289openalex-snapshot
Computing Join Queries with Functional Dependencies
inferredcites →https://doi.org/10.1145/3034786.3056105openalex-snapshot
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?
inferredcites →https://doi.org/10.1145/3299869.3319894openalex-snapshot
Pessimistic Cardinality Estimation
inferredcites →https://doi.org/10.1145/3329859.3329875openalex-snapshot
Cardinality estimation with local deep learning models
inferredcites →https://doi.org/10.1145/3401071.3401658openalex-snapshot
Best of both worlds
inferredcites →https://doi.org/10.1145/3448016.3452830openalex-snapshot
A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimation
inferredcites →https://doi.org/10.1145/3514221.3526154openalex-snapshot
Learned Cardinality Estimation: An In-depth Study
inferredcites →https://doi.org/10.14778/3384345.3384349openalex-snapshot
DeepDB
inferredcites →https://doi.org/10.14778/3389133.3389135openalex-snapshot
The PGM-index
inferredcites →https://doi.org/10.14778/3421424.3421432openalex-snapshot
NeuroCard
inferredcites →https://doi.org/10.14778/3461535.3461539openalex-snapshot
FLAT
inferredcites →https://doi.org/10.14778/3461535.3461552openalex-snapshot
Are we ready for learned cardinality estimation?
inferredcites →https://doi.org/10.14778/3476249.3476254openalex-snapshot
Fauce
inferredcites →https://doi.org/10.14778/3476249.3476259openalex-snapshot
Flow-loss
inferredcites →https://doi.org/10.14778/3485450.3485458openalex-snapshot
FACE
inferredcites →https://doi.org/10.14778/3503585.3503586openalex-snapshot
Cardinality estimation in DBMS
inferredcites →https://doi.org/10.14778/3529337.3529339openalex-snapshot
Accurate summary-based cardinality estimation through the lens of cardinality estimation graphs
inferredcites →https://doi.org/10.18637/jss.v053.i09openalex-snapshot
fastcluster : Fast Hierarchical, Agglomerative Clustering Routines for R and Python
inferredcites →https://doi.org/10.5555/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers

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-032-39820-8_2openalex-snapshot
Reproducible Query Optimization Research for Data Systems
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653651openalex-snapshot
Sidorenko-Inspired Pessimistic Estimation
inferred← citeshttps://doi.org/10.1145/3635138.3654765openalex-snapshot
Closing the Gap between Theory and Practice in Query Optimization
inferred← citeshttps://doi.org/10.1145/3639300openalex-snapshot
ASM: Harmonizing Autoregressive Model, Sampling, and Multi-dimensional Statistics Merging for Cardinality Estimation
inferred← citeshttps://doi.org/10.1145/3651597openalex-snapshot
Join Size Bounds using l p -Norms on Degree Sequences
inferred← citeshttps://doi.org/10.1145/3698799openalex-snapshot
A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions
inferred← citeshttps://doi.org/10.1145/3709659openalex-snapshot
An Elephant Under the Microscope: Analyzing the Interaction of Optimizer Components in PostgreSQL
inferred← citeshttps://doi.org/10.1145/3712311.3712313openalex-snapshot
Pessimistic Cardinality Estimation
inferred← citeshttps://doi.org/10.1145/3716378openalex-snapshot
Degree Sequence Bounds
inferred← citeshttps://doi.org/10.1145/3722212.3725637openalex-snapshot
Reproducible Prototyping of Query Optimizer Components
inferred← citeshttps://doi.org/10.1145/3725233openalex-snapshot
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
inferred← citeshttps://doi.org/10.1145/3725301openalex-snapshot
Galley: Modern Query Optimization for Sparse Tensor Programs
inferred← citeshttps://doi.org/10.1145/3725321openalex-snapshot
LpBound : Pessimistic Cardinality Estimation Using ℓ p -Norms of Degree Sequences
inferred← citeshttps://doi.org/10.1145/3733620.3733623openalex-snapshot
Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
inferred← citeshttps://doi.org/10.1145/3785021.3787997openalex-snapshot
Reproducibility Report for ACM SIGMOD 2025 Paper: 'LpBound: Pessimistic Cardinality Estimation Using ? p -Norms of Degree Sequences'
inferred← citeshttps://doi.org/10.1145/3786633openalex-snapshot
CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations
inferred← citeshttps://doi.org/10.14778/3705829.3705834openalex-snapshot
Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
inferred← citeshttps://doi.org/10.14778/3746405.3746428openalex-snapshot
Path-Centric Cardinality Estimation for Subgraph Matching
inferred← citeshttps://doi.org/10.14778/3827998.3828052openalex-snapshot
How Out-of-Bounds Are Your Cardinality Estimates?
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.