skills.rest
hung-phan
hung-phanCOMMUNITY
Explore all skills by this author →
GitHub

indexing

Analyze database indexing strategies for B-tree, LSM-tree, hash, and bitmap structures.

Updated Jun 5, 2026
Search Tags:#performance optimization#data storage#database performance#database indexing#index structure
One-click install
npx skills add https://github.com/hung-phan/system-skills --skill indexing-hung-phan
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: indexing
Source: https://github.com/hung-phan/system-skills/tree/main/skills/system-review/references/data-systems/indexing
Command: npx skills add https://github.com/hung-phan/system-skills --skill indexing-hung-phan

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) and assets (resource) components.

What problem does it solve?

This Skill helps users determine the most effective indexing strategy for their database, optimizing for performance and efficiency by analyzing access patterns and storage considerations.

Core Features & Use Cases

  • Index Structure Selection: Evaluates and suggests appropriate index structures like B-tree, LSM-tree, hash, or bitmap based on query patterns.
  • Write and Read Amplification Analysis: Identifies and minimizes write amplification and read amplification trade-offs.
  • Use Case: When planning a new database or optimizing an existing one, this Skill assists in choosing the right primary and secondary indexes.

Quick Start

Use the indexing skill to evaluate the indexing strategy for your database considering read/write patterns and dataset size.

Frequently Asked Questions about indexing

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I choose the best database indexing strategy for my access patterns?▼

To choose the best database indexing strategy, analyze your query patterns to select between B-tree, LSM-tree, hash, or bitmap structures. This minimizes read and write amplification trade-offs while optimizing storage efficiency.

When should I use an LSM-tree versus a B-tree for database performance optimization?▼

Use an LSM-tree for write-heavy workloads to minimize write amplification, and a B-tree for read-heavy relational database workloads requiring efficient data retrieval. The choice depends on your specific read and write ratios.

What is read amplification and how does it impact NoSQL index structure selection?▼

Read amplification is the extra disk reads required to fetch data. In NoSQL systems, selecting the right index structure like LSM-tree or hash directly minimizes this overhead and accelerates data retrieval performance.

Can I evaluate secondary index structures for both relational databases and NoSQL systems?▼

Yes, you can evaluate secondary index structures for both relational databases and NoSQL systems. The analysis covers space utilization and write amplification to ensure efficient data storage and retrieval across different architectures.

How do I reduce space utilization when planning primary and secondary indexes?▼

Reduce space utilization by evaluating index structure efficiency, selecting bitmap or hash indexes where appropriate. This balances storage overhead against read and write amplification based on your dataset size.

Related Skills

Explore More Software Engineering Skills→
DVNghiemDVNghiem
20

postgres-patterns

Optimize PostgreSQL schema, indexing and query performance with proven patterns.

Community
Intermediate
hung-phanhung-phan

storage-engines

Analyze and optimize B-tree and LSM-tree database storage engines.

Community
Advanced
wigxelwigxel
3

convex-performance-audit

Diagnose and resolve performance issues in Convex applications.

Official
Advanced
yeeehaoooyeeehaooo

caching-strategy

Define explicit caching strategies for .NET data access with TTL-based invalidation.

Community
Intermediate