> An SSTable will consist of multiple sorted files called segments. [---] Recall that LSM trees only perform sequential writes. Assuming either that you only h

> An SSTable will consist of multiple sorted files called segments. [---] Recall that LSM trees only perform sequential writes. Assuming either that you only have one table, or file systems are magic things that don't make that argument moot. > Once the compaction process has written a new segment for the input segments, the old segment files are deleted. ... and the assumption of only a single table isn't enough! Thank you, file system developers, for making SSTables sound so easy. > Bloom filter I did some research a couple of weeks ago about Approximate member query data structures. Bloom filters are from 1970, Quotient filters arrived in 1984, then Pagh improved Bloom filters in 2004, and we got Cuckoo filters in 2014 [1]. Has there been progress since? Did I miss any key achievement in-between? [1] https://en.wikipedia.org/wiki/Cuckoo_filter https://en.wikipedia.org/wiki/Cuckoo_filter