In general it is a very simple pattern. You just wrap your function/method/behaviour with another function which keeps track of the failures/success of the that function (service/DB calls) and opens or closes the circuit for you. Sounds simple enough. It is simple.
Hello! Welcome to the part-2 of "How search engine works" series. Previous part was all about the basic concepts that go behind a search engine at a low level. If you want to refer the previous part, feel free and read it here. This part will be focussed on how things work in elastic search… Continue reading How search engine works ? Elastic search – (Part-2)
Most software today is very much like an Egyptian pyramid with millions of bricks piled on top of each other, with no structural integrity, but just done by brute force and thousands of slaves. - Alan Kay Writing code is simple. Yes, you read it right. It is simple, but writing code as readable as… Continue reading Readable Code : Just like a fairy tale
For understanding our first scenario we have to ride a car in a small Village where you have very narrow lanes. Adding to your pain you have buffaloes leading you. I hope you are enjoying the ride 🙂 . After several rounds of heavy honking you get to overtake the buffaloes HURRAAYY!!, but WAIT. You find yourself in a worse… Continue reading Deadlock in simple terms
Have you ever wondered how a search engine works ? If yes then this article can help you understand the basics of search engine. We will talk about how a search engine is able to search for your queries within milliseconds. So lets start with the steps involved in building fast search queries : 1) Lexical analysis… Continue reading How search engine works ? – Elastic Search (Part – 1)