#databases
Read more stories on Hashnode
Articles with this tag
It is a probabilistic space-efficient data structure with O(1) insertion and retrieval. It is used to find if a key exists (with false positives) or...
Database partitioning in simplest terms refers to dividing a big table into smaller tables for ease of maintenance, query optimization,...
Why Indexes? Database indexes are used for faster data retrieval. Let's explore the underlying data structure behind these indexes that enables faster...