Random Sampling and Size Estimation Over Cyclic Joins.

DOI10.4230/LIPICS.ICDT.2020.7MaRDI QIDQ5874360zbMATH OpenOpenAlexFDO

Authors

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.ICDT.2020.7

zbMATH Keywords

join size estimationjoinsrandom sampling

Mathematics Subject Classification ID

Database theory (68P15)

Cited in

(7)

• Estimating list sizes in partial joins
• Finding smallest witnesses for conjunctive queries
• Join sampling under acyclic degree constraints and (cyclic) subgraph sampling
• Join and subgraph sampling under degree constraints
• Towards optimal dynamic indexes for approximate (and exact) triangle counting
• A simple algorithm for worst case optimal join and sampling
• Near uniform triangle sampling over adjacency list graph streams

This page was built for publication: Random Sampling and Size Estimation Over Cyclic Joins.

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