Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
Posts by Tag
- java 3
- springboot 2
- star 2
- array 2
- dsa 2
- openapi 1
- scalability 1
- batch 1
- integration 1
- performance 1
- php 1
- kotlin 1
- concurrency 1
- consistency 1
- streaming 1
- observability 1
- metrics 1
- prometheus 1
- postgres 1
- docker 1
- heap 1
- binaryheap 1
- heapsort 1
- tree 1
- trie 1
- prefix 1
- search 1
- map 1
java
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
springboot
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
OpenAPI documentation for your spring boot service
OpenAPI Specification is a good way to define and describe your API for anyone who is interested in using your apis. So, I found a couple of open source impl...
star
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
Historical Data and Near Real Time Data are not the same!
When extracting data from a third party api service that generates a lot of data - the amount of work needed to then maintain the stored data starts to compo...
array
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
dsa
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
openapi
OpenAPI documentation for your spring boot service
OpenAPI Specification is a good way to define and describe your API for anyone who is interested in using your apis. So, I found a couple of open source impl...
scalability
Historical Data and Near Real Time Data are not the same!
When extracting data from a third party api service that generates a lot of data - the amount of work needed to then maintain the stored data starts to compo...
batch
Historical Data and Near Real Time Data are not the same!
When extracting data from a third party api service that generates a lot of data - the amount of work needed to then maintain the stored data starts to compo...
integration
Historical Data and Near Real Time Data are not the same!
When extracting data from a third party api service that generates a lot of data - the amount of work needed to then maintain the stored data starts to compo...
performance
Historical Data and Near Real Time Data are not the same!
When extracting data from a third party api service that generates a lot of data - the amount of work needed to then maintain the stored data starts to compo...
php
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
kotlin
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
concurrency
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
consistency
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
streaming
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
observability
Introducing observability with prometheus
Using open source observability tools like prometheus, it is convenient to track and understand how your application performs, especially if cloud providers ...
metrics
Introducing observability with prometheus
Using open source observability tools like prometheus, it is convenient to track and understand how your application performs, especially if cloud providers ...
prometheus
Introducing observability with prometheus
Using open source observability tools like prometheus, it is convenient to track and understand how your application performs, especially if cloud providers ...
postgres
Introducing observability with prometheus
Using open source observability tools like prometheus, it is convenient to track and understand how your application performs, especially if cloud providers ...
docker
Introducing observability with prometheus
Using open source observability tools like prometheus, it is convenient to track and understand how your application performs, especially if cloud providers ...
heap
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
binaryheap
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
heapsort
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
tree
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
trie
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
prefix
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
search
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
map
Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...