All authors
Claude Skills by Intense-Visions
github.com/Intense-Visions800 skills40 installs2,105 views
- Css Performance Patterns> Optimize CSS performance with content-visibility, containment, efficient selectors, and Core Web Vitals-friendly patternsVotes: 0GitHub stars: 20
- Css Responsive Design> Build responsive layouts with Tailwind's mobile-first breakpoints, container queries, and fluid typographyVotes: 0GitHub stars: 20
- Css Tailwind Merge> Resolve Tailwind class conflicts intelligently with tailwind-merge for safe className composition and overridesVotes: 0GitHub stars: 20
- Css Tailwind Pattern> Apply Tailwind CSS utility-first patterns for consistent, maintainable component stylingVotes: 0GitHub stars: 20
- Db Acid In Practice> The mechanisms that make ACID guarantees real: Write-Ahead Logging ensures atomicity and durability, fsync ensures persistence to physical media, and crash recovery replays the WAL to restore a consistent state.Votes: 0GitHub stars: 20
- Db Acid Properties> ACID guarantees that database transactions are processed reliably: each transaction is all-or-nothing (Atomic), leaves the database in a valid state (Consistent), operates as if no other transactions are running (Isolated), and once committed, persists even through crashes (Durable).Votes: 0GitHub stars: 20
- Db Adjacency List> The simplest hierarchical model where each row stores a reference to its parent, traversed with recursive CTEs for subtree and ancestor queries.Votes: 0GitHub stars: 20
- Db Audit Trail> Recording who changed what, when, and why, using trigger-based or application-level change tracking with immutable append-only logs.Votes: 0GitHub stars: 20
- Db Btree Index> The default index type in PostgreSQL and MySQL, B-tree indexes support equality and range queries on ordered data with O(log n) lookup performance.Votes: 0GitHub stars: 20
- Db Cap Theorem> In a distributed system, when a network partition occurs, you must choose between consistency (every read returns the most recent write) and availability (every non-failing node returns a response) -- you cannot have both simultaneously.Votes: 0GitHub stars: 20
- Db Closure Table> Storing all ancestor-descendant pairs in a separate table for O(1) subtree and ancestor lookups with manageable write costs.Votes: 0GitHub stars: 20
- Db Composite Index> Multi-column indexes that accelerate queries filtering on column combinations, governed by the leftmost prefix rule and the ESR (Equality, Sort, Range) column ordering strategy.Votes: 0GitHub stars: 20
- Db Connection Pooling> External connection poolers like PgBouncer sit between the application and database, multiplexing many application connections onto fewer database connections to prevent connection exhaustion.Votes: 0GitHub stars: 20
- Db Connection Sizing> Tuning max_connections, understanding per-connection memory overhead, and right-sizing database connections for on-premise and serverless environments.Votes: 0GitHub stars: 20
- Db Covering Index> Indexes that contain all columns needed by a query, enabling index-only scans that skip heap table access entirely.Votes: 0GitHub stars: 20
- Db Deadlock Prevention> Deadlocks occur when two or more transactions hold locks and each waits for a lock the other holds; prevention through consistent lock ordering and detection through timeout-based abort resolves them.Votes: 0GitHub stars: 20
- Db Denormalization> Intentionally introducing controlled redundancy into a normalized schema to eliminate expensive joins or aggregations, applied only after measured proof of a performance problem.Votes: 0GitHub stars: 20
- Db Document In Relational> Using JSONB columns to store semi-structured data alongside relational tables, with indexing strategies and guidelines for when to embed vs normalize.Votes: 0GitHub stars: 20
- Db Entity Attribute Value> A schema pattern for storing dynamic, user-defined attributes as rows instead of columns -- usually avoided in favor of JSONB or polymorphic alternatives, but occasionally justified for genuinely unbounded attribute sets.Votes: 0GitHub stars: 20
- Db Eventual Consistency> If no new updates are made, all replicas will eventually converge to the same value -- a consistency model that trades immediate agreement for higher availability and lower latency.Votes: 0GitHub stars: 20
- Db Expand Contract> Add new structure, migrate data, remove old structure -- the three-phase pattern for safe column renames, type changes, and table restructuring.Votes: 0GitHub stars: 20
- Db Explain Reading> How to read query execution plans to identify performance bottlenecks, row count misestimations, and missing indexes.Votes: 0GitHub stars: 20
- Db Expression Index> Indexes on computed expressions and specialized index types (GIN, GiST) for non-scalar data like JSONB, arrays, and full-text search.Votes: 0GitHub stars: 20
- Db First Normal Form> Every column holds a single atomic value, no repeating groups exist, and every row is uniquely identifiable by a primary key.Votes: 0GitHub stars: 20
- Db Graph In Relational> Modeling vertices and edges in SQL tables for social graphs, dependency networks, and recommendation systems with recursive queries -- and knowing when SQL stops being practical.Votes: 0GitHub stars: 20
- Db Hash Index> Optimized for equality-only lookups with O(1) average access time, hash indexes are smaller than B-tree when range queries and ordering are never needed.Votes: 0GitHub stars: 20
- Db Hierarchical Data> Choosing between adjacency list, nested sets, closure table, and materialized path based on read/write ratio, query patterns, and tree depth.Votes: 0GitHub stars: 20
- Db Horizontal Sharding> Distributing rows of a table across multiple database instances (shards) to scale beyond the capacity of a single server, with careful attention to shard key selection and cross-shard query complexity.Votes: 0GitHub stars: 20
- Db Isolation Levels> The four SQL standard isolation levels control which concurrent transaction side-effects are visible, with PostgreSQL implementing them via MVCC snapshots rather than traditional locking.Votes: 0GitHub stars: 20
- Db Isolation Selection> Selecting the right isolation level requires matching the workload's correctness requirements against the performance cost and retry complexity of stricter levels.Votes: 0GitHub stars: 20
- Db Migration Rollback> Forward-only vs reversible migrations, data backfill safety, and blue-green schema patterns for confident schema evolution.Votes: 0GitHub stars: 20
- Db Mvcc> MVCC allows readers and writers to operate concurrently without blocking each other by maintaining multiple versions of each row, with visibility determined by transaction snapshots.Votes: 0GitHub stars: 20
- Db Nested Sets> Encoding hierarchy position with left/right boundary numbers for O(1) subtree and ancestor queries at the cost of expensive writes.Votes: 0GitHub stars: 20
- Db Optimistic Locking> Optimistic locking assumes conflicts are rare, allows concurrent reads without locks, and detects conflicts at write time using version columns or conditional updates.Votes: 0GitHub stars: 20
- Db Partial Index> Indexes with a WHERE clause that index only a subset of rows, reducing size and improving performance for targeted query patterns.Votes: 0GitHub stars: 20
- Db Pessimistic Locking> Pessimistic locking acquires locks before modifying data, guaranteeing exclusive access and preventing conflicts at the cost of reduced concurrency.Votes: 0GitHub stars: 20
- Db Polymorphic Associations> Modeling inheritance hierarchies and type-varying relationships in relational databases using single-table inheritance (STI), class-table inheritance (CTI), or shared foreign key patterns.Votes: 0GitHub stars: 20
- Db Query Rewriting> Structural query transformations that help the planner choose better execution plans without changing results.Votes: 0GitHub stars: 20
- Db Query Statistics> How the planner uses table statistics (pg_stats, histograms, most-common-values) to estimate row counts and choose execution plans.Votes: 0GitHub stars: 20
- Db Read Phenomena> The SQL standard defines three read anomalies (dirty, non-repeatable, phantom) that isolation levels progressively prevent, plus PostgreSQL adds write skew as a fourth anomaly relevant to Serializable.Votes: 0GitHub stars: 20
- Db Scan Types> Understanding when the planner chooses sequential scan, index scan, bitmap scan, or index-only scan and why each is optimal for different selectivity ranges.Votes: 0GitHub stars: 20
- Db Second Normal Form> Every non-key column must depend on the entire composite primary key, not just part of it -- eliminating partial dependencies.Votes: 0GitHub stars: 20
- Db Table Partitioning> Splitting a large table into smaller physical partitions by range, list, or hash to improve query performance, simplify maintenance, and enable efficient data lifecycle management.Votes: 0GitHub stars: 20
- Db Temporal Data> Modeling when facts are true (valid-time), when they were recorded (transaction-time), or both (bitemporal), enabling time-travel queries and regulatory audit.Votes: 0GitHub stars: 20
- Db Third Normal Form> "Every non-key attribute must provide a fact about the key, the whole key, and nothing but the key." -- Codd's memorable definition of full normalization through 3NF.Votes: 0GitHub stars: 20
- Db Time Series> Designing append-heavy tables for metrics, events, and logs with time-based partitioning, retention policies, and efficient aggregation.Votes: 0GitHub stars: 20
- Db Vertical Partitioning> Splitting a wide table into multiple narrower tables, separating hot columns from cold columns, and managing large objects with TOAST to reduce I/O and improve cache efficiency.Votes: 0GitHub stars: 20
- Db Zero Downtime Migration> Online schema changes that avoid table locks and keep the application serving traffic throughout the migration.Votes: 0GitHub stars: 20
- Design Affordances> Perceived actionability — signifiers, constraints, mappings (Don Norman), flat design's affordance problem, touch targets, hover states as affordanceVotes: 0GitHub stars: 20
- Design Alignment> Visual order through edge alignment, center alignment, optical alignment, and the invisible structure that consistent alignment creates across a pageVotes: 0GitHub stars: 20