I am not sure whether my understanding is right or not:
If Size Tiered Compaction strategy is used, the sstables on disk are not ordered, so if the target row is not in memory, you have to go through all the sstables to find all the records(with different timstamp), and compare them to get the newest one.
If Leveled Compaction strategy is used, the sstables on lower level is newer than the higher level. so if the target row is not in memory, you just have to travese from level 0 to level N. Once you find the record, you can stop travesing and return the record, because it is the newest one.
so the read path with Leveled Compaction strategy is shorter and more efficent?