DBScholar

Back to papers

Optimal Dynamic Parameterized Subset Sampling

Summary: Optimal DPSS in Word RAM: O(n) preprocessing, O(1+mu_S) per-query, O(1) updates, linear space. Hardness: deletion-only DPSS with float weights would imply sorting; also presents O(1) expected-time Bernoulli and truncated-geometric variate generation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1977
Venue
PODS
Year
2024
Pagerank
5.2571354e-05
Overall Rank
9,513 | 34.74%
DOI
10.1145/3695827

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gan_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{Optimal Dynamic Parameterized Subset Sampling}},
        url = {https://dl.acm.org/doi/10.1145/3695827},
        doi = {10.1145/3695827},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Gan, Junhao and Umboh, Seeun William and Wang, Hanzhi and Wirth, Anthony and Zhang, Zhuo},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,719 Subset Sampling over Joins 2026 PODS 5.2319816e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers