data-structures

What problem does it solve?

This Skill provides a framework for selecting the most efficient data structures for database query operations, optimizing performance by considering factors like data size, key types, and hardware cache.

Core Features & Use Cases

• Data Structure Selection: Guides the choice between hash tables, bloom filters, sorted arrays, and direct arrays based on specific query needs (joins, aggregations, filtering).
• Memory Estimation: Provides formulas to estimate memory footprints for different structures, crucial for avoiding cache thrashing.
• Use Case: When planning a join operation on a large table, this skill helps determine if a hash table will fit in the CPU's cache or if a partitioned approach or bloom filter is more appropriate for performance.

Quick Start

Use the data-structures skill to determine the best data structure for a join operation on a table with 10 million integer keys.