# Overview A Sorted String Table is an on-disk, sorted, [[immutable]] data structure. # Key Considerations # Pros - Allows for efficient merging of SSTables - Improved usage of memory, because not all keys need to be stored in-memory. With sorted data, you can use a sparse index and determine all key locations based on the ranges of keys available in the sparse index. # Cons # Use Cases # Related Topics