Change Details

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](https://hakibenita.com/postgresql-hash-index) and [citrus](https://www.citusdata.com/product/community) be a better choice ?

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](https://hakibenita.com/postgresql-hash-index) and [citus](https://www.citusdata.com/product/community) be a better choice ?

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](https://hakibenita.com/postgresql-hash-index) and [citrus](https://www.citusdata.com/product/community) be a better choice ?