Tracking join and self-join sizes in limited storage

DOI10.1006/JCSS.2001.1813zbMATH Open1051.68136OpenAlexW2040063291MaRDI QIDQ696969FDOQ696969

Mario Szegedy, Noga Alon, Y. Matias, Phillip B. Gibbons

Publication date: 12 September 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1813

zbMATH Keywords

query optimizerstug-of-war signatures

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• The space complexity of approximating the frequency moments
• Random sampling with a reservoir
• Query size estimation by adaptive sampling
• Title not available (Why is that?)

Cited In (12)

• The space complexity of approximating the frequency moments
• Space‐efficient tracking of persistent items in a massive data stream
• Randomized numerical linear algebra: Foundations and algorithms
• Fast Private Norm Estimation and Heavy Hitters
• Private multiparty sampling and approximation of vector combinations
• Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
• Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
• Summary Data Structures for Massive Data
• Size bounds and query plans for relational joins
• Estimating list sizes in partial joins
• Sublinear-time algorithms for counting star subgraphs via edge sampling
• Indexing for summary queries

   Recommendations

• Query size estimation by adaptive sampling 👍 👎
• Efficient sampling strategies for relational database operations 👍 👎
• Faster joins, self-joins and multi-way joins using join indices 👍 👎
• Selectivity and cost estimation for joins based on random sampling 👍 👎
• Size bounds and query plans for relational joins 👍 👎

This page was built for publication: Tracking join and self-join sizes in limited storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696969)