Get our Architecture Patterns Playbook for FREE on newsletter signup:
Presented by Postman
Postman’s new Spec Hub is a game-changer. It brings API design, testing, and documentation into one seamless experience—so you can stop syncing across platforms and start shipping faster.
Here’s what stands out:
Design with OpenAPI & AsyncAPI support
Auto-generate collections from your specs
Keep tests & docs updated automatically
Validate requests/responses with new typed collections
Whether you work spec-first or collection-first, Postman’s unified approach fits your flow.
Understanding the Various Approaches to Effective Database Indexing
Most databases require some form of indexing to keep up with performance benchmarks. Searching through a database is much simpler when the data is correctly indexed, which improves the system's overall performance.
A database index is a lot like the index on the back of a book.
It saves you time and energy by allowing you to easily find what you're looking for without having to flick through every page.
Database indexes work the same way.
An index is a key-value pair where the key is used to search for data instead of the corresponding indexed column(s), and the value is a pointer to the relevant row(s) in the table.
To get the most out of your database, you should use the right index type for the job.
One of the most commonly used indexing structures is the B-tree, where keys are sorted and organized in a hierarchical tree structure.
When searching data, the tree is traversed down to the leaf node that contains the appropriate key and pointer to the relevant rows in the table.
B-tree is most commonly used because of its efficiency in storing and searching through ordered data. Their balanced structure means that all keys can be accessed in the same number of steps, making performance consistent.
Hash indexes are best used when you are searching for an exact value match.
The key component of a hash index is the hash function.
When searching for a specific value, the search value is passed through a hash function which returns a hash value. That hash value tells the database where the key and pointers are located in the hash table.
For indexing columns with a low set of unique values, bitmap indexing can be used.
With bitmap indexing, each bitmap represents a unique value. A bitmap indicates the presence or absence of a value in a dataset, using 1’s and 0’s. For existing values, the position of the 1 in the bitmap shows the location of the row in the table.
Bitmap indexes are very effective in handling complex queries where multiple columns are used.
When you are indexing a table, make sure to carefully select the columns to be indexed based on the most frequently used columns in WHERE clauses.
A composite index may be used when multiple columns are often used in a WHERE clause together.
With a composite index, a combination of two or more columns are used to create a concatenated key. The keys are then stored based on the index strategy, such as the options mentioned above.
Indexing can be a double-edged sword. It significantly speeds up queries, but it also takes up storage space and adds overhead to operations. Balancing performance and optimal storage is crucial to get the most out of your database without introducing inefficiencies.
Subscribe to get simple-to-understand, visual, and engaging system design articles straight to your inbox: