First asymptotically optimal uniform sampling and approximate counting algorithms for matrix, star, and chain join-project queries, with matching communication-complexity lower bounds.
AGMpQ ¯y,t|𝑅 𝑒 | : 𝑒PEuq . Note that 𝜋 V´y𝑠 is a valid join result of Q¯ypR𝑠 q (a “success
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries
First asymptotically optimal uniform sampling and approximate counting algorithms for matrix, star, and chain join-project queries, with matching communication-complexity lower bounds.