On the public citation graph
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics
0 signed · 85 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-48309-8_8openalex-snapshot
Hybrid Simultaneous Scheduling and Mapping in SQL Multi-query Parallelization
inferredcites →https://doi.org/10.1007/978-3-030-18579-4_1openalex-snapshot
An Approach Based on Bayesian Networks for Query Selectivity Estimation
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_9openalex-snapshot
Cache-, Hash- and Space-Efficient Bloom Filters
inferredcites →https://doi.org/10.1007/s41019-020-00149-7openalex-snapshot
A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1109/cmpsac.1979.762509openalex-snapshot
An algorithm for tree-query membership of a distributed query
inferredcites →https://doi.org/10.1109/icde.2014.6816695openalex-snapshot
Evaluating multi-way joins over discounted hitting time
inferredcites →https://doi.org/10.1109/icde.2018.00048openalex-snapshot
LevelHeaded: A Unified Engine for Business Intelligence and Linear Algebra Querying
inferredcites →https://doi.org/10.1109/icde.2019.00183openalex-snapshot
HyMJ: A Hybrid Structure-Aware Approach to Distributed Multi-way Join Query
inferredcites →https://doi.org/10.1109/icde.2019.00191openalex-snapshot
How I Learned to Stop Worrying and Love Re-optimization
inferredcites →https://doi.org/10.1109/icde.2019.00242openalex-snapshot
Robust Query Processing: Mission Possible
inferredcites →https://doi.org/10.1109/icde40885.2018openalex-snapshot
2018 IEEE 34th International Conference on Data Engineering (ICDE)
inferredcites →https://doi.org/10.1109/lics56636.2023openalex-snapshot
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
inferredcites →https://doi.org/10.1109/lics56636.2023.10175769openalex-snapshot
Applications of Information Inequalities to Database Theory Problems
inferredcites →https://doi.org/10.1137/110859440openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1145/1007568.1007642openalex-snapshot
Robust query processing through progressive optimization
inferredcites →https://doi.org/10.1145/1066157.1066172openalex-snapshot
Towards a robust query optimizer
inferredcites →https://doi.org/10.1145/115790.115835openalex-snapshot
On the propagation of errors in the size of join results
inferredcites →https://doi.org/10.1145/1247480.1247569openalex-snapshot
Progressive optimization in a shared-nothing parallel database
inferredcites →https://doi.org/10.1145/1376616.1376672openalex-snapshot
Dynamic programming strikes back
inferredcites →https://doi.org/10.1145/1806689.1806790openalex-snapshot
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
inferredcites →https://doi.org/10.1145/2213556openalex-snapshot
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2588555openalex-snapshot
Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
inferredcites →https://doi.org/10.1145/2723372.2742796openalex-snapshot
Design and Implementation of the LogicBlox System
inferredcites →https://doi.org/10.1145/276304.276315openalex-snapshot
Efficient mid-query re-optimization of sub-optimal query execution plans
inferredcites →https://doi.org/10.1145/2806416.2806446openalex-snapshot
Ordering Selection Operators Under Partial Ignorance
inferredcites →https://doi.org/10.1145/2854006.2854012openalex-snapshot
Robust Query Optimization Methods With Respect to Estimation Errors
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/303976.303979openalex-snapshot
Hypertree decompositions and tractable queries
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/3318464.3389727openalex-snapshot
QuickSel: Quick Selectivity Learning with Mixture Models
inferredcites →https://doi.org/10.1145/3318464.3389741openalex-snapshot
Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries
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/3589295openalex-snapshot
Free Join: Unifying Worst-Case Optimal and Traditional Joins
inferredcites →https://doi.org/10.1145/3589330openalex-snapshot
Efficient Query Re-optimization with Judicious Subquery Selections
inferredcites →https://doi.org/10.1145/3651597openalex-snapshot
Join Size Bounds using l p -Norms on Degree Sequences
inferredcites →https://doi.org/10.1145/3709676openalex-snapshot
Data Chunk Compaction in Vectorized Execution
inferredcites →https://doi.org/10.1145/3725283openalex-snapshot
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics
inferredcites →https://doi.org/10.1145/3725423openalex-snapshot
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees
inferredcites →https://doi.org/10.1145/543613openalex-snapshot
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
inferredcites →https://doi.org/10.1145/543613.543651openalex-snapshot
Least expected cost query optimization
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.14778/1453856.1453976openalex-snapshot
Identifying robust plans through plan diagram reduction
inferredcites →https://doi.org/10.14778/1920841.1920983openalex-snapshot
On the stability of plan costs and the costs of plan stability
inferredcites →https://doi.org/10.14778/2850583.2850594openalex-snapshot
How good are query optimizers, really?
inferredcites →https://doi.org/10.14778/3090163.3090167openalex-snapshot
Looking ahead makes query plans robust
inferredcites →https://doi.org/10.14778/3184470.3184473openalex-snapshot
Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows
inferredcites →https://doi.org/10.14778/3199517.3199520openalex-snapshot
Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows
inferredcites →https://doi.org/10.14778/3236187.3236191openalex-snapshot
Robustness metrics for relational query execution plans
inferredcites →https://doi.org/10.14778/3329772.3329780openalex-snapshot
Selectivity estimation for range predicates using lightweight models
inferredcites →https://doi.org/10.14778/3342263.3342643openalex-snapshot
Optimizing subgraph queries by combining binary and worst-case optimal joins
inferredcites →https://doi.org/10.14778/3368289.3368294openalex-snapshot
Deep unsupervised cardinality estimation
inferredcites →https://doi.org/10.14778/3407790.3407797openalex-snapshot
Adopting worst-case optimal joins in relational database systems
inferredcites →https://doi.org/10.14778/3461535.3461552openalex-snapshot
Are we ready for learned cardinality estimation?
inferredcites →https://doi.org/10.14778/3648160.3648175openalex-snapshot
POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance
inferredcites →https://doi.org/10.14778/3654621.3654625openalex-snapshot
Is Your Learned Query Optimizer Behaving As You Expect? A Machine Learning Perspective
inferredcites →https://doi.org/10.14778/3681954.3681995openalex-snapshot
Robust Join Processing with Diamond Hardened Joins
inferredcites →https://doi.org/10.14778/3704965.3704971openalex-snapshot
PARQO: Penalty-Aware Robust Plan Selection in Query Optimization
inferredcites →https://doi.org/10.4230/lipics.icdt.2016.8openalex-snapshot
Worst-Case Optimal Algorithms for Parallel Query Processing
inferredcites →https://doi.org/10.46298/theoretics.25.12openalex-snapshot
PANDA: Query Evaluation in Submodular Width
inferredcites →https://doi.org/10.48550/arxiv.1503.02368openalex-snapshot
EmptyHeaded: A Relational Engine for Graph Processing
inferredcites →https://doi.org/10.48550/arxiv.1809.00677openalex-snapshot
Learned Cardinalities: Estimating Correlated Joins with Deep Learning
inferredcites →https://doi.org/10.48550/arxiv.2011.09022openalex-snapshot
FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation
inferredcites →https://doi.org/10.48550/arxiv.2208.09671openalex-snapshot
Safe Subjoins in Acyclic Joins
inferredcites →https://doi.org/10.48550/arxiv.2307.15255openalex-snapshot
Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.ipm.2026.104684openalex-snapshot
Arbiter: Towards joint and fine-grained index and partition tuning in analytical databases
inferred← citeshttps://doi.org/10.1109/icassp55912.2026.11463910openalex-snapshot
Deopt: Synergizing Large Language Models and Differential Evolution for Join Order Optimization
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00224openalex-snapshot
A Set-Theoretic Approach to Detecting Logic Bugs in DBMS Inner Join Optimizations
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00366openalex-snapshot
Is Quantum Computing Ready for Real-Time Database Optimization?
inferred← citeshttps://doi.org/10.1145/3725423openalex-snapshot
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1145/3802050openalex-snapshot
EncoderForge: Generating Efficient SQL for Encoders in Machine Learning Inference Pipelines
inferred← citeshttps://doi.org/10.1145/3810900.3810906openalex-snapshot
Output-Optimal Evaluation of Conjunctive Queries
inferred← citeshttps://doi.org/10.14778/3748191.3748196openalex-snapshot
Parachute: Single-Pass Bi-Directional Information Passing
inferred← citeshttps://doi.org/10.14778/3749646.3749683openalex-snapshot
SQLStorm: Taking Database Benchmarking into the LLM Era
inferred← citeshttps://doi.org/10.14778/3801059.3801077openalex-snapshot
OBELISK: Efficient Offline Query Planning with Bayesian Optimization-Informed Language Model Reasoning
inferred← citeshttps://doi.org/10.14778/3827998.3828038openalex-snapshot
Ultron: History-Based Query Optimization at Databricks
inferred← citeshttps://doi.org/10.14778/3827998.3828144openalex-snapshot
Instance-Optimal Acyclic Joins: From Theory to Systems
showing the first 12 of 13 · page through all 13
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.