(https://youtube.com/@thegeeknarrator?si=yN0zWNDAScJKv_QZ), Staff Platform Engineer @Personio
State machine thinking is one of the best ways to build reliable software. The idea is to break down complex systems into discrete states and explicit transitions between them.
State machine thinking is one of the best ways to build reliable software. The idea is to break down complex systems into discrete states and explicit transitions between them.
First-principles thinking is one of the best ways to tackle complex problems.
The idea is to break down complex problems into primitive elements and then reassemble the problem from scratch.
First-principles thinking is one of the best ways to tackle complex problems.
The idea is to break down complex problems into primitive elements and then reassemble the problem from scratch.
And guess what, Parseable is built exactly like that. All the good stuff that makes a system fast, reliable and highly scalable.
New episode 🚀
youtu.be/MugLlrf5E_g
And guess what, Parseable is built exactly like that. All the good stuff that makes a system fast, reliable and highly scalable.
New episode 🚀
youtu.be/MugLlrf5E_g
But why?
Why is it important for Kafka ecosystem ?
How does it compare with existing revolutionary technologies?
Blogged a comparison between Diskless Kafka, WarpStream and Confluent Freight. www.geeknarrator.com/blog/diskles...
But why?
Why is it important for Kafka ecosystem ?
How does it compare with existing revolutionary technologies?
Blogged a comparison between Diskless Kafka, WarpStream and Confluent Freight. www.geeknarrator.com/blog/diskles...
But why there hasn't been a simple, easy and fast solution for these problems that just works with the hassle?
But why there hasn't been a simple, easy and fast solution for these problems that just works with the hassle?
Wrote a detailed blog on why I think diskless Kafka is going to be HUGE.
Do check it out here:
www.geeknarrator.com/blog/diskless-kafka-kip-1150
Thanks Aiven for sponsoring the blog.
Wrote a detailed blog on why I think diskless Kafka is going to be HUGE.
Do check it out here:
www.geeknarrator.com/blog/diskless-kafka-kip-1150
Thanks Aiven for sponsoring the blog.
youtu.be/lAlqa9H5FQY
youtu.be/lAlqa9H5FQY
This episode lays out a good foundation for us to go into the internals of each of the amazing GCs and their tradeoffs.
Become a member to access the upcoming internals episode.. Meanwhile watch this video (free access until tomorrow). youtu.be/p1Yamdly0QE
This episode lays out a good foundation for us to go into the internals of each of the amazing GCs and their tradeoffs.
Become a member to access the upcoming internals episode.. Meanwhile watch this video (free access until tomorrow). youtu.be/p1Yamdly0QE
Experience based, Actionable insights is what you can expect from this episode.
Enjoy: youtu.be/HnyKJq8oR0M
Image taken from: martinfowler.com/articles/pat...
Experience based, Actionable insights is what you can expect from this episode.
Enjoy: youtu.be/HnyKJq8oR0M
Image taken from: martinfowler.com/articles/pat...
What are the challenges in a multithreaded environment?
Does GC play any role in object creation?
New video will answer these questions for you.
Get access here
www.youtube.com/channel/UC_m...
Link to the video:
youtu.be/qfcnB8kciCE
What are the challenges in a multithreaded environment?
Does GC play any role in object creation?
New video will answer these questions for you.
Get access here
www.youtube.com/channel/UC_m...
Link to the video:
youtu.be/qfcnB8kciCE
"converts a tradeoff between update and range query costs into a mutually beneficial synergy between batching small updates and large nodes"
"converts a tradeoff between update and range query costs into a mutually beneficial synergy between batching small updates and large nodes"
Buffers are organised into balanced binary "search" tree, ex. Red-black tree.
Buffers are organised into balanced binary "search" tree, ex. Red-black tree.
- Indices are cheap to maintain in B"-trees, so create indices for all keys used in queries.
- Ensure each index contains all necessary information to answer queries, known as a covering index.
- Design indices to support efficient range queries.
- Indices are cheap to maintain in B"-trees, so create indices for all keys used in queries.
- Ensure each index contains all necessary information to answer queries, known as a covering index.
- Design indices to support efficient range queries.
Avoid Query-Before-Update: Due to the search-insert asymmetry, avoid the read-modify-write pattern as it will be bound to the speed of a query.
Avoid Query-Before-Update: Due to the search-insert asymmetry, avoid the read-modify-write pattern as it will be bound to the speed of a query.
I believe this needs to be tuned based on the type of workloads..
𝜖 must be between 0 and 1.
I believe this needs to be tuned based on the type of workloads..
𝜖 must be between 0 and 1.
Like, repost and share..👇
Like, repost and share..👇
Now movie time. One of my favourites.
Now movie time. One of my favourites.
2025 is going to be amazing.
Stronger fundamentals.
More Deep work.
Quality content.
Along with podcasts, it will be filled with series on Distributed systems, JVM internals, Database internals and Stream processing.
2025 is going to be amazing.
Stronger fundamentals.
More Deep work.
Quality content.
Along with podcasts, it will be filled with series on Distributed systems, JVM internals, Database internals and Stream processing.