Database indexes are data structures that accelerate retrieval operations by providing fast lookup paths for rows based on key values. They reduce query latency and improve read performance but add storage and maintenance overhead during writes. Proper index selection and monitoring balance speed, cost and consistency in production systems.
Use this profile to understand the building block briefly, place it in the model, and switch to the 360° assessment when needed.
Theoretical construct: explains a term, principle, or mental model.
What organizes, connects, or makes decisions possible.
A database index is an extra data structure beside the table that organizes selected values so queries can find specific rows faster.
Indexes emerged in database systems from the practical problem of not having to scan large tables row by row for every lookup. Rather than relying on linear scans, they add a separate access path over key values and usually make retrieval much faster. The same structure can also enforce rules such as UNIQUE, PRIMARY KEY, or FOREIGN KEY efficiently, but the benefit comes with extra storage and maintenance work when data changes.
Think of the table as the complete archive and the index as a card catalog beside it. The catalog arranges selected key values and points to the matching rows. A query consults that catalog first to narrow candidates for WHERE, JOIN, or ORDER BY parts; only then does the database read the actual records. Each additional index saves search work, but it also slows writes a little and consumes space.
The index leads from a key value to a small set of candidate rows instead of the whole table.
The benefit is strongest for filters, sorting, and targeted single-row access.
INSERT, UPDATE, and DELETE operations must maintain the index structure.
Rules such as UNIQUE, PRIMARY KEY, and FOREIGN KEY can be checked efficiently through indexes.
B-tree, hash, and other structures fit different query and sorting patterns.
The term is useful in schema design, query tuning, code reviews, and performance analysis. It matters most when reads dominate, filter and sort paths are stable, or rules like PRIMARY KEY need enforcement. Too many or poorly chosen indexes slow writes, consume storage, and can still fail to help when queries or data distribution change.
Where this building block is located in the topic model.
Explore how this building block connects to concepts, methods, technologies, and tools.
These sources establish the term and its professional meaning.
All direct connections of the current building block in a compact text view.
This classification shows where the building block typically matters, how demanding it is, and what kind of impact it has in the model.
The level within the organization (enterprise, domain, team) at which the AssetBlock is applied.