I love this idea. It has worked extremely well for Observability data, and more generally I’ve realized this really works for any append-only workload. I’d love to understand more what is going on under the hood. I imagine cache oblivious data structures but I’m having a hard time finding what the exact methods are that are being used to achieve this (maybe I just need to learn more about tantivity).<p>Anyhow, it’s an early project so I assume details will get better over time. Good luck, I can’t wait to see where this goes!
Hi HN!<p>After months of quiet work, we are releasing today our first version of Quickwit.<p>We wrote a blog post about how we improve cost efficiency of traditional search engines: <a href="https://quickwit.io/blog/quickwit-first-release" rel="nofollow">https://quickwit.io/blog/quickwit-first-release</a>