Viewing profile — tsenart

This was missing in the Go world.

Proprietary.

Author here, indeed a variation of bloom filters: https://x.com/lemire/status/1971279371131646063

This is to implement a database, not use one.

Yes! A typical use case is to efficiently implement ORDER BY LIMIT N in SQL databases in a way that doesn’t require sorting the entire column just to get those first N items.

Author here! Will do eventually.

Do share your findings!

Author here. Agree 100%! It's often what didn't work that is omitted. But there's so much juice in failed experiments — it's important to share with others.

Our Go ULID package has millisecond precision + monotonic random bytes for disambiguation while preserving ordering within the same millisecond. https://github.com/oklog/ulid

This, please! Native support for read-replicas would be awesome. Ideally it would now if a query is read-only or not without application changes.

Could you elaborate on the differences a bit deeper? I’m really interested in understanding.

How does it compare to https://github.com/tdunning/t-digest ?

#MakeMonolithsGreatAgain https://twitter.com/tsenart/status/1017061272188280833

http://blog.aventine.se/2014/03/09/a-silly-review-of-dec64.h...

OptioPay | Engineering | Berlin, Germany | ONSITE, VISA, FULL-TIME We're on a mission to create the most beneficial payout ecosystem in the world and fundamentally change the way p…

OptioPay | Frontend UI Engineer, Backend Engineer, SRE, Security Engineer | Berlin, Germany | ONSITE, VISA, FULL-TIME We're on a mission to create the most beneficial payout ecosys…