On the public citation graph
Selectivity and Cost Estimation for Joins Based on Random Sampling
0 signed · 139 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.1006/jcss.1995.1050openalex-snapshot
Query Size Estimation by Adaptive Sampling
inferredcites →https://doi.org/10.1007/3-540-57818-8_58openalex-snapshot
On the estimation of join result sizes
inferredcites →https://doi.org/10.1007/978-0-387-87835-5openalex-snapshot
Stopped Random Walks: Limit Theorems and Applications
inferredcites →https://doi.org/10.1007/s007780050043openalex-snapshot
S eek ing the truth about ad hoc join costs
inferredcites →https://doi.org/10.1017/s0305004100076386openalex-snapshot
Large-sample theory of sequential estimation
inferredcites →https://doi.org/10.1080/00401706.1971.10488826openalex-snapshot
Some Results Relevant to Choice of Sum and Sum-of-Product Algorithms
inferredcites →https://doi.org/10.1109/icde.1993.344047openalex-snapshot
A polynomial time algorithm for optimizing join queries
inferredcites →https://doi.org/10.1109/icde.1995.380361openalex-snapshot
Sampling-based selectivity estimation for joins using augmented frequent value statistics
inferredcites →https://doi.org/10.1145/115790.115837openalex-snapshot
Error-constrained COUNT query evaluation in relational databases
inferredcites →https://doi.org/10.1145/128762.128764openalex-snapshot
Join processing in relational databases
inferredcites →https://doi.org/10.1145/130283.130335openalex-snapshot
Sequential sampling procedures for query size estimation
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/153850.153872openalex-snapshot
Multiple join size estimation by virtual domains (extended abstract)
inferredcites →https://doi.org/10.1145/153850.153875openalex-snapshot
Fixed-precision estimation of join selectivity
inferredcites →https://doi.org/10.1145/169725.169708openalex-snapshot
Optimal histograms for limiting worst-case error propagation in the size of join results
inferredcites →https://doi.org/10.1145/182591.182594openalex-snapshot
On the relative cost of sampling for join selectivity estimation
inferredcites →https://doi.org/10.1145/298514.298540openalex-snapshot
Query size estimation by adaptive sampling (extended abstract)
inferredcites →https://doi.org/10.1145/308386.308455openalex-snapshot
Statistical estimators for relational algebra expressions
inferredcites →https://doi.org/10.1145/582095.582099openalex-snapshot
Access path selection in a relational database management system
inferredcites →https://doi.org/10.1145/602259.602261openalex-snapshot
Implementation techniques for main memory database systems
inferredcites →https://doi.org/10.1145/66926.66933openalex-snapshot
Processing aggregate relational queries with hard time constraints
inferredcites →https://doi.org/10.1145/93597.93611openalex-snapshot
Practical selectivity estimation through adaptive sampling
inferredcites →https://doi.org/10.1214/aoms/1177697737openalex-snapshot
An Extension of a Theorem of Chow and Robbins on Sequential Confidence Intervals for the Mean
inferredcites →https://doi.org/10.1287/ijoc.5.4.410openalex-snapshot
A Bayesian Approach to Database Query Optimization
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-45726-7_1openalex-snapshot
Counting Distinct Elements in a Data Stream
inferred← citeshttps://doi.org/10.1007/3-540-45876-x_39openalex-snapshot
A Framework for the Physical Design Problem for Data Synopses
inferred← citeshttps://doi.org/10.1007/978-3-540-28608-0_2openalex-snapshot
Data-Stream Sampling: Basic Techniques and Results
inferred← citeshttps://doi.org/10.1007/978-3-540-89506-0_14openalex-snapshot
Parametric Modeling of Some Biosignals Using Optimization Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-23783-6_42openalex-snapshot
The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling
inferred← citeshttps://doi.org/10.1007/978-981-96-1242-0_8openalex-snapshot
First Past the Post: Evaluating Query Optimization in MongoDB
inferred← citeshttps://doi.org/10.1007/s00453-017-0287-3openalex-snapshot
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
inferred← citeshttps://doi.org/10.1007/s00778-017-0480-7openalex-snapshot
Query optimization through the looking glass, and what we found running the Join Order Benchmark
inferred← citeshttps://doi.org/10.1007/s007780000026openalex-snapshot
Progressive evaluation of nested aggregate queries
inferred← citeshttps://doi.org/10.1007/s10115-024-02142-2openalex-snapshot
Automating localized learning for cardinality estimation based on XGBoost
inferred← citeshttps://doi.org/10.1007/s11390-017-1731-1openalex-snapshot
EntityManager: Managing Dirty Data Based on Entity Resolution
inferred← citeshttps://doi.org/10.1007/s11704-016-5551-1openalex-snapshot
Efficient histogram-based range query estimation for dirty data
inferred← citeshttps://doi.org/10.1007/s41019-018-0074-4openalex-snapshot
Approximate Query Processing: What is New and Where to Go?
inferred← citeshttps://doi.org/10.1016/b978-012369389-1/50010-3openalex-snapshot
Counting and data sampling in physical design exploration
inferred← citeshttps://doi.org/10.1016/b978-155860869-6/50034-2openalex-snapshot
Progressive Merge Join
inferred← citeshttps://doi.org/10.1016/s0306-4379(02)00050-9openalex-snapshot
Automatic tuning of data synopses
inferred← citeshttps://doi.org/10.1023/a:1009835310546openalex-snapshot
Informix under CONTROL: Online Query Processing
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9672047openalex-snapshot
Efficient Selectivity Estimation for Relation-Tree Joins in Multi-Model Databases
inferred← citeshttps://doi.org/10.1109/focs.2018.00058openalex-snapshot
Perfect Lp Sampling in a Data Stream
inferred← citeshttps://doi.org/10.1109/icac.2017.37openalex-snapshot
AccStream: Accuracy-Aware Overload Management for Stream Processing Systems
inferred← citeshttps://doi.org/10.1109/icde.1995.380361openalex-snapshot
Sampling-based selectivity estimation for joins using augmented frequent value statistics
inferred← citeshttps://doi.org/10.1109/icde.2009.124openalex-snapshot
Join Reordering by Join Simulation
inferred← citeshttps://doi.org/10.1109/icde.2013.6544899openalex-snapshot
Predicting query execution time: Are optimizer cost models really unusable?
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00108openalex-snapshot
Salvaging failing and straggling queries
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00068openalex-snapshot
Active Sampling for Sparse Table by Bayesian Optimization with Adaptive Resolution
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00019openalex-snapshot
Towards Exploratory Query Optimization for Template-Based SQL Workloads
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00013openalex-snapshot
Exqutor: Extended Query Optimizer for Vector-Augmented Analytical Queries
inferred← citeshttps://doi.org/10.1109/ssdm.1997.621151openalex-snapshot
Large-sample and deterministic confidence intervals for online aggregation
inferred← citeshttps://doi.org/10.1109/ssdm.1999.787616openalex-snapshot
Techniques for online exploration of large object-relational datasets
inferred← citeshttps://doi.org/10.1109/tsc.2021.3073006openalex-snapshot
LYRIC: Deadline and Budget Aware Spatio-Temporal Query Processing in Cloud
inferred← citeshttps://doi.org/10.1109/wsc.2014.7019943openalex-snapshot
Improving the efficiency of stochastic composite simulation models via result caching
inferred← citeshttps://doi.org/10.1137/18m1229912openalex-snapshot
Perfect $L_p$ Sampling in a Data Stream
inferred← citeshttps://doi.org/10.1145/1066157.1066172openalex-snapshot
Towards a robust query optimizer
inferred← citeshttps://doi.org/10.1145/1066157.1066222openalex-snapshot
A disk-based join with probabilistic guarantees
inferred← citeshttps://doi.org/10.1145/1066157.1066223openalex-snapshot
When can we trust progress estimators for SQL queries?
inferred← citeshttps://doi.org/10.1145/1066157.1066224openalex-snapshot
Relational confidence bounds are easy with the bootstrap
inferred← citeshttps://doi.org/10.1145/1247480.1247560openalex-snapshot
Scalable approximate query processing with the DBO engine
inferred← citeshttps://doi.org/10.1145/1412331.1412335openalex-snapshot
Scalable approximate query processing with the DBO engine
inferred← citeshttps://doi.org/10.1145/1508857.1508858openalex-snapshot
The design of a query monitoring system
inferred← citeshttps://doi.org/10.1145/1516360.1516487openalex-snapshot
Estimating aggregates in time-constrained approximate queries in Oracle
inferred← citeshttps://doi.org/10.1145/1559795.1559804openalex-snapshot
Size and treewidth bounds for conjunctive queries
inferred← citeshttps://doi.org/10.1145/1739041.1739123openalex-snapshot
An experimental study of time-constrained aggregate queries
inferred← citeshttps://doi.org/10.1145/1807085.1807095openalex-snapshot
Understanding cardinality estimation using entropy maximization
inferred← citeshttps://doi.org/10.1145/2109196.2109202openalex-snapshot
Understanding cardinality estimation using entropy maximization
inferred← citeshttps://doi.org/10.1145/2220357.2220363openalex-snapshot
Size and Treewidth Bounds for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/2391229.2391245openalex-snapshot
Balancing reducer skew in MapReduce workloads using progressive sampling
inferred← citeshttps://doi.org/10.1145/2882903.2882914openalex-snapshot
Sampling-Based Query Re-Optimization
inferred← citeshttps://doi.org/10.1145/304181.304208openalex-snapshot
Ripple joins for online aggregation
inferred← citeshttps://doi.org/10.1145/304182.304208openalex-snapshot
Ripple joins for online aggregation
inferred← citeshttps://doi.org/10.1145/3085504.3085524openalex-snapshot
A Unified Correlation-based Approach to Sampling Over Joins
inferred← citeshttps://doi.org/10.1145/3299869.3300087openalex-snapshot
Exact Cardinality Query Optimization with Bounded Execution Cost
inferred← citeshttps://doi.org/10.1145/3318464.3380567openalex-snapshot
On the Optimization of Recursive Relational Queries: Application to Graph Queries
inferred← citeshttps://doi.org/10.1145/3340531.3417460openalex-snapshot
A Cost Estimation Technique for Recursive Relational Algebra
inferred← citeshttps://doi.org/10.1145/3389795openalex-snapshot
Using an Inverted Index Synopsis for Query Latency and Performance Prediction
inferred← citeshttps://doi.org/10.1145/3400903.3400921openalex-snapshot
Selectivity Estimation for Relation-Tree Joins
inferred← citeshttps://doi.org/10.1145/3448016.3452821openalex-snapshot
Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries
inferred← citeshttps://doi.org/10.1145/3517804.3524139openalex-snapshot
Truly Perfect Samplers for Data Streams and Sliding Windows
inferred← citeshttps://doi.org/10.1145/3603719.3603728openalex-snapshot
Less is More: How Fewer Results Improve Progressive Join Query Processing
inferred← citeshttps://doi.org/10.1145/3689209openalex-snapshot
Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries
inferred← citeshttps://doi.org/10.1145/3725243openalex-snapshot
Perfect Sampling in Turnstile Streams Beyond Small Moments
inferred← citeshttps://doi.org/10.1145/3725335openalex-snapshot
PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees
inferred← citeshttps://doi.org/10.1145/381854.381897openalex-snapshot
Database research at the Indian Institute of Technology, Bombay
inferred← citeshttps://doi.org/10.1145/564691.564721openalex-snapshot
A scalable hash ripple join algorithm
inferred← citeshttps://doi.org/10.1147/sj.421.0098openalex-snapshot
LEO: An autonomic query optimizer for DB2
inferred← citeshttps://doi.org/10.14778/1687627.1687723openalex-snapshot
Consistent histograms in the presence of distinct value counts
inferred← citeshttps://doi.org/10.14778/2556549.2556563openalex-snapshot
A sampling algebra for aggregate estimation
inferred← citeshttps://doi.org/10.14778/2733085.2733092openalex-snapshot
Uncertainty aware query execution time prediction
inferred← citeshttps://doi.org/10.14778/2735479.2735485openalex-snapshot
Rapid sampling for visualizations with ordering guarantees
inferred← citeshttps://doi.org/10.14778/2850583.2850594openalex-snapshot
How good are query optimizers, really?
inferred← citeshttps://doi.org/10.14778/3213880.3213882openalex-snapshot
Improved selectivity estimation by combining knowledge from sampling and synopses
inferred← citeshttps://doi.org/10.14778/3529337.3529339openalex-snapshot
Accurate summary-based cardinality estimation through the lens of cardinality estimation graphs
inferred← citeshttps://doi.org/10.14778/3681954.3682030openalex-snapshot
Hit the Gym: Accelerating Query Execution to Efficiently Bootstrap Behavior Models for Self-Driving Database Management Systems
inferred← citeshttps://doi.org/10.14778/3696435.3696438openalex-snapshot
Cardinality Estimation for Having-Clauses
inferred← citeshttps://doi.org/10.14778/3797919.3797922openalex-snapshot
Sample-based Distinct Cardinality Estimation for Multiple Attributes in Multi-Dataset Queries
inferred← citeshttps://doi.org/10.1561/1900000004openalex-snapshot
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
inferred← citeshttps://doi.org/10.21817/indjcse/2020/v11i5/201105116openalex-snapshot
SAMPLING BASED JOIN-AGGREGATE QUERY PROCESSING TECHNIQUE FOR BIG DATA
inferred← citeshttps://doi.org/10.21817/indjcse/2020/v11i6/201106014openalex-snapshot
APPROXIMATE QUERY PROCESSING TECHNIQUE FOR EXECUTING JOINAGGREGATE QUERIES ON BIG DATA
inferred← citeshttps://doi.org/10.22028/d291-25714openalex-snapshot
Query estimation techniques in database systems
inferred← citeshttps://doi.org/10.3990/1.9789036531115openalex-snapshot
ROX : Run-Time Opitization of XQueries
inferred← citeshttps://doi.org/10.48550/arxiv.0909.2030openalex-snapshot
Size Bounds for Conjunctive Queries with General Functional Dependencies
inferred← citeshttps://doi.org/10.48550/arxiv.1101.5805openalex-snapshot
The VC-Dimension of Queries and Selectivity Estimation Through Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.1601.04233openalex-snapshot
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1601.05118openalex-snapshot
Perfect and Maximum Randomness in Stratified Sampling over Joins
inferred← citeshttps://doi.org/10.48550/arxiv.2002.01531openalex-snapshot
Providing Insights for Queries affected by Failures and Stragglers
inferred← citeshttps://doi.org/10.48550/arxiv.2009.03520openalex-snapshot
Leam: An Interactive System for In-situ Visual Text Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00307openalex-snapshot
Understanding the hardness of approximate query processing with joins
inferred← citeshttps://doi.org/10.48550/arxiv.2108.02715openalex-snapshot
Q-error Bounds of Random Uniform Sampling for Cardinality Estimation
inferred← citeshttps://doi.org/10.5555/2693848.2693958openalex-snapshot
Improving the efficiency of stochastic composite simulation models via result caching
inferred← citeshttps://doi.org/10.6688/jise.2015.31.5.13openalex-snapshot
A Cardinality Estimation Approach Based on Two Level Histograms
inferred← citeshttps://doi.org/10.70675/685071cdz78caz493azae3az7e4d4e7770f0openalex-snapshot
On Cost Estimation for the Recursive Relational Algebra
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.