On the public citation graph
Practical Algorithms for Tracking Database Join Sizes
0 signed · 36 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.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferredcites →https://doi.org/10.1007/3-540-45465-9_59openalex-snapshot
Finding Frequent Items in Data Streams
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_7openalex-snapshot
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-24741-8_33openalex-snapshot
Processing Data-Stream Join Aggregates Using Skimmed Sketches
inferredcites →https://doi.org/10.1007/978-3-540-28608-0_16openalex-snapshot
STREAM: The Stanford Data Stream Management System
inferredcites →https://doi.org/10.1007/b95852openalex-snapshot
LATIN 2004 : theoretical informatics : 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 : proceedings
inferredcites →https://doi.org/10.1016/b978-155860869-6/50027-5openalex-snapshot
Monitoring Streams — A New Class of Data Management Applications
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.001openalex-snapshot
An improved data stream summary: the count-min sketch and its applications
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-snapshot
Finding frequent items in data streams
inferredcites →https://doi.org/10.1145/233269.233340openalex-snapshot
Bifocal sampling for skew-resistant join size estimation
inferredcites →https://doi.org/10.1145/237814.237823openalex-snapshot
The space complexity of approximating the frequency moments
inferredcites →https://doi.org/10.1145/303976.303978openalex-snapshot
Tracking join and self-join sizes in limited storage
inferredcites →https://doi.org/10.1145/308386.308455openalex-snapshot
Statistical estimators for relational algebra expressions
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/564691.564699openalex-snapshot
Processing complex aggregate queries over data streams
inferredcites →https://doi.org/10.1145/93597.93611openalex-snapshot
Practical selectivity estimation through adaptive sampling
inferredcites →https://doi.org/10.5555/982792.982884openalex-snapshot
Tabulation based 4-universal hashing with applications to second moment estimation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841036_16openalex-snapshot
Estimating Entropy over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_35openalex-snapshot
On Estimating Frequency Moments of Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_5openalex-snapshot
CR-precis: A Deterministic Summary Structure for Update Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_10openalex-snapshot
Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_44openalex-snapshot
Taylor Polynomial Estimator for Estimating Frequency Moments
inferred← citeshttps://doi.org/10.1007/s00453-008-9260-5openalex-snapshot
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams
inferred← citeshttps://doi.org/10.1007/s00778-024-00869-6openalex-snapshot
WavingSketch: an unbiased and generic sketch for finding top-k items in data streams
inferred← citeshttps://doi.org/10.1109/focs.2008.76openalex-snapshot
Sketching and Streaming Entropy via Approximation Theory
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4809224openalex-snapshot
Survey on Query Estimation in Data Streams
inferred← citeshttps://doi.org/10.1145/1247480.1247503openalex-snapshot
Statistical analysis of sketch estimators
inferred← citeshttps://doi.org/10.1145/1386118.1386121openalex-snapshot
Sketches for size of join estimation
inferred← citeshttps://doi.org/10.1145/3588910openalex-snapshot
TreeSensing: Linearly Compressing Sketches with Flexibility
inferred← citeshttps://doi.org/10.1145/3588935openalex-snapshot
JoinSketch: A Sketch Algorithm for Accurate and Unbiased Inner-Product Estimation
inferred← citeshttps://doi.org/10.3390/math13213468openalex-snapshot
Improving Utility of Private Join Size Estimation via Shuffling
inferred← citeshttps://doi.org/10.48550/arxiv.1005.0809openalex-snapshot
On Estimating the First Frequency Moment of Data Streams
inferred← citeshttps://doi.org/10.5555/1109557.1109634openalex-snapshot
Simpler algorithm for estimating frequency moments of data streams
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.