TL;DR Are you dreaming about breaking a monolithic application? Some of us do. What I'd prefer to hear is breaking a monolithic application into pieces that fit. This would be much appropriate and much more advantageous than just breaking this monolith, wouldn't it? We want it to work, after all. Let's go through different approaches … Continue reading On breaking the monolith
design
The subtle art of caching
TL;DR It's often said that there are only two hard things in Computer Science: cache invalidation and naming things. In this blog post we'll reconsider this statement against the modern databases and approaches. We'll start with no-cache rule and move to some situations where applying caching might be good, or even, vital. If you never … Continue reading The subtle art of caching
Bounded design
If you wake up a Domain Driven Design fan and scream the word "Bounded" the answer will be immediate and always the same: "Context". It's funny that this word is having so much trouble in leaving DDD context. I'd like to encourage you for broadening it a little bit, to a design, architecture space. Reality … Continue reading Bounded design
Pearls: the protocol for monitoring NServiceBus
It's time for another pearl of design, speed and beauty at the same time. Today, I'm bringing you a protocol used by NServiceBus to efficiently report its measurements to a monitoring endpoint. It's really cool. Take a look! Not that I co-authored it or something... 😉 Measure everything One of the assumptions behind monitoring NServiceBus … Continue reading Pearls: the protocol for monitoring NServiceBus
Pearls: putting EventStore in reverse
Pearls of design, beautiful patterns, efficient approaches. After covering Jil and its extremely efficient serialization of primitives it's time to put things in reverse. By things, in this case, I mean EventStore, the event centric database that I already presented once. Now, it's time to visit its ability to move back in time and traverse … Continue reading Pearls: putting EventStore in reverse
Pearls: Jil, serialization of primitives
The last pearl of design that I covered was an implementation for the discriminated union in the probuf-net library. Now, it's time to move to an area that is less esoteric in terms of the format, but still intriguing in terms of performance. Time to take a look at the fastest JSON serializer available for … Continue reading Pearls: Jil, serialization of primitives
Pearls: the protobuf’s discriminated union
Google Protocol Buffers is a proven protocol for serializing data efficiently. It has a wide adoption, enabling serialization for almost every platform, making the data easy to exchange between platforms. To store its schema, you can use .proto files, that enable describing messages in a platform agnostic format. You can see an example below: message … Continue reading Pearls: the protobuf’s discriminated union
