Why is an LSM better than a Hash Table to store the global index ? A LSM has O(1) insertion time but O(log(N)) search when it is sorted and O(N) worst case scenario. Could PostgreSQL with hash table index and citus be a better choice ?
Description
Description
| Status | Assigned | Task | ||
|---|---|---|---|---|
| Migrated | gitlab-migration | T3116 Roll out at least one operational mirror | ||
| Migrated | gitlab-migration | T3054 Scale out object storage design | ||
| Migrated | gitlab-migration | T3105 LSM vs Hash Table / RocksDB vs Citus |