Database Sharding

What it does

This skill enables AI agents to implement database sharding strategies for horizontal scaling. It provides templates and guidance for distributing large databases across multiple servers using hash, range, or directory-based approaches. The goal is to improve performance and scalability by avoiding full scans of the entire dataset when querying.

When to use it

• When dealing with a rapidly growing database that exceeds the capacity of a single server.
• To optimize query performance for large datasets where scanning all data would be slow.
• For applications requiring high availability and fault tolerance through data distribution.
• In multi-tenant environments needing isolation and resource allocation per tenant (directory-based sharding).

Key capabilities

• Provides templates for hash-based, range-based, and directory-based sharding strategies.
• Offers guidance on selecting appropriate shard key criteria (high cardinality, even distribution, immutability, query alignment).
• Includes example code demonstrating how to implement a router using the chosen strategy.
• Outlines critical rules for successful database sharding implementation, including monitoring and rebalancing considerations.

Example prompts

• "Implement hash-based sharding for my user database."
• "Show me an example of range-based sharding for time series data."
• "What are the best practices for choosing a shard key?"

Tips & gotchas

• The chosen shard key must be immutable; changing it later requires a complex and disruptive data migration.
• Always include the shard key in your queries to avoid scanning all shards, which is significantly slower.
• Plan for rebalancing upfront as adding shards after initial implementation can be difficult.