Optimal Uncoordinated Unique IDs
Summary: Formalize the Uncoordinated Unique Identifiers Problem (UUIDP): n independent ID generators over universe [m] with an adversary issuing requests, no inter-instance communication, minimize cross-instance collision probability — first theoretical study. Provide and analyze algorithms: one worst-case optimal against oblivious adversaries, one within O(log) of optimal against adaptive adversaries, and one competitively optimal against both oblivious and adaptive adversaries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Peter C. Dillinger (Meta)
- 2. Martín Farach-Colton (Rutgers University)
- 3. Guido Tagliavini (Rutgers University)
- 4. Stefan Walzer (University of Cologne)
BibTeX Citation
@inproceedings{dillinger_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Optimal Uncoordinated Unique IDs}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588674},
doi = {10.1145/3584372.3588674},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Dillinger, Peter C. and Farach-Colton, Martín and Tagliavini, Guido and Walzer, Stefan},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 471 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.00017905409 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,235 | Distributed Algorithms For Dynamic Replication Of Data | 1992 | PODS |
| 2 | 3,240 | Privacy-preserving Anonymization of Set-valued Data | 2008 | VLDB |
| 3 | 2,009 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS |
| 4 | 6,581 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD |
| 5 | 11,427 | Towards Better Bounds for Finding Quasi-Identifiers * | 2023 | PODS |
| 6 | 6,575 | Optimal Splitters for Temporal and Multi-version Databases | 2013 | SIGMOD |
| 7 | 7,148 | Submodularity of Distributed Join Computation | 2018 | SIGMOD |
| 8 | 7,408 | Compact Histograms for Hierarchical Identifiers | 2006 | VLDB |
| 9 | 2,899 | Distributed Data Deduplication | 2016 | VLDB |
| 10 | 4,743 | Optimal Random Perturbation at Multiple Privacy Levels | 2009 | VLDB |