Štefan Miklošovič on dictionary compression with Zstd, CEP-54, which lands in 6.0, and probably as one of 6.0's best example of broad community collaboration, giving up to three fold storage cost stavings at 4kb chunk sizes, double at 16kb
Youki Shiraishi, a researcher at NTT, presents comprehensive benchmark theory and results on Accord's fast path, transaction overhead, and ephemeral reads against simple, complicated and contented transactions.
Francisco Guerrero and Saranya Krishnakumar showing how the Analytics library reads SSTables through Sidecar, bypassing the read and write path entirely.
Bloomberg replaced its own in-house sidecar with the Apache one, and then started contributing back. Andrés Beck-Ruiz and Isaac Reath cover Sidecar’s architecture and features
Stefan Stoicescu from TU Delft, Software Engineering Research Group, finding non-trivial linearizability bugs by a model-guided approach that maps concrete executions to abstract TLA+ states, turning an unbounded trace-discovery graph into a usable coverage metric.
Patrick Mcfadin on adding columnar format and using Cassandra as a HTAP database.
And community health, dealing with the increased contribution rate, and shipping releases on time.
Tejal Chakeres and Abhijeet Dubey wrapping up the day with"CEP-60: Flexible Placements"
Now ownership changes are linearizable, topology changes can happen in smaller steps that can be paused and resumed.
Memtables are the single largest contributor to Cassandra’s garbage collection overhead.
Kamil Leśniak's talk describes the final stage of a long progression: a fully off-heap memtable implementation building on the trie memtable
Cassandra 6.0 write performance improvements from Dmitry Konstantinov
the low down on how to "do less work" and "allocate less" and "contend less" and "helping the JIT"
A jammed pack Cassandra Track room has started!
Scott Andreas kicks it off with some great slides on "Cassandra: A Normal Database", describing how these things are getting implemented in lots of details.