AgentStack
Browse Sign in
Browse Why AgentStack Sell Docs
Sign in
SKILL verified MIT Self-run

Ddia

skill-grndlvl-software-patterns-ddia · by grndlvl

A Claude skill from grndlvl/software-patterns.

No reviews yet
0 installs
29 views
0.0% view→install

Install

$ agentstack add skill-grndlvl-software-patterns-ddia

✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.

Security review

✓ Passed

No issues found. Passed automated security review. · v0.1.0 How review works →

  • Prompt-injection patterns
  • Secret / credential exfiltration
  • Dangerous shell & filesystem operations
  • Untrusted network calls
  • Known-malicious package signatures

What it can access

  • Network access No
  • Filesystem access No
  • Shell / process execution No
  • Environment & secrets No
  • Dynamic code execution No

From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.

View the full security report →

Verified badge

Passed review? Show it. Paste this badge into your README, it links to the public security report.

AgentStack Verified badge Links to your public security report.
[![AgentStack Verified](https://agentstack.voostack.com/badges/verified.svg)](https://agentstack.voostack.com/security/report/skill-grndlvl-software-patterns-ddia)

Reliability & compatibility

Security review passed
0 installs to date
no reviews yet
7mo ago

Declared compatibility

Claude CodeClaude Desktop

Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.

Preview Execution monitoring

We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.

How agent discovery & health will work →
Are you the author of Ddia? Claim this listing to set pricing, connect Stripe payouts, and keep 70% of every sale.
Sign up to claim

About

Designing Data-Intensive Applications Skill

Reference for distributed systems and data architecture concepts from Martin Kleppmann's "Designing Data-Intensive Applications."

Activation Triggers

Use this skill when discussing:

  • Database selection and data modeling
  • Replication and high availability
  • Partitioning/sharding strategies
  • Distributed transactions
  • Consistency models and guarantees
  • Stream vs batch processing
  • Event sourcing and CQRS

Quick Reference

Data Models

| Model | Best For | Trade-offs | |-------|----------|------------| | Relational | Complex queries, joins, ACID | Schema rigidity, scaling writes | | Document | Hierarchical data, flexibility | Poor joins, denormalization | | Graph | Highly connected data | Specialized queries, complexity | | Wide-Column | Time series, analytics | Limited query patterns |

Storage Engines

| Engine | Optimized For | Examples | |--------|---------------|----------| | B-Tree | Read-heavy, random access | PostgreSQL, MySQL | | LSM-Tree | Write-heavy, sequential | Cassandra, RocksDB, LevelDB | | Column Store | Analytics, aggregations | ClickHouse, Parquet |

Replication Strategies

| Strategy | Consistency | Availability | Use Case | |----------|-------------|--------------|----------| | Single Leader | Strong | Medium | Traditional RDBMS | | Multi-Leader | Eventual | High | Multi-datacenter | | Leaderless | Eventual | Highest | High availability |

Partitioning Strategies

| Strategy | Description | Pros | Cons | |----------|-------------|------|------| | Range | Partition by key ranges | Efficient range queries | Hot spots | | Hash | Partition by hash of key | Even distribution | No range queries | | Composite | Combine range + hash | Balanced | Complexity |

Consistency Models

| Model | Guarantee | Performance | |-------|-----------|-------------| | Linearizable | Strongest (appears sequential) | Slowest | | Sequential | Operations ordered per client | Medium | | Causal | Cause-effect preserved | Good | | Eventual | Will converge eventually | Fastest |

Transaction Isolation Levels

| Level | Dirty Read | Non-Repeatable | Phantom | |-------|------------|----------------|---------| | Read Uncommitted | ✗ | ✗ | ✗ | | Read Committed | ✓ | ✗ | ✗ | | Repeatable Read | ✓ | ✓ | ✗ | | Serializable | ✓ | ✓ | ✓ |

CAP Theorem

> "In the presence of a network partition, choose Consistency OR Availability."

| Choice | Behavior | Examples | |--------|----------|----------| | CP | Reject requests if can't guarantee consistency | ZooKeeper, HBase | | AP | Accept requests, allow inconsistency | Cassandra, DynamoDB |

Batch vs Stream Processing

| Aspect | Batch | Stream | |--------|-------|--------| | Latency | High (hours/days) | Low (seconds/minutes) | | Data | Bounded, complete | Unbounded, continuous | | Processing | MapReduce, Spark | Kafka, Flink, Storm | | Use Case | Analytics, ETL | Real-time alerts, dashboards |

Directory Structure

ddia/
├── SKILL.md
├── data-models/
│   ├── relational.md
│   ├── document.md
│   └── graph.md
├── storage/
│   ├── b-trees.md
│   ├── lsm-trees.md
│   └── column-storage.md
├── replication/
│   ├── leader-follower.md
│   ├── multi-leader.md
│   └── leaderless.md
├── partitioning/
│   ├── strategies.md
│   └── rebalancing.md
├── transactions/
│   ├── acid.md
│   ├── isolation-levels.md
│   └── distributed-transactions.md
├── consistency/
│   ├── models.md
│   └── linearizability.md
├── consensus/
│   └── algorithms.md
└── processing/
    ├── batch.md
    ├── stream.md
    └── event-sourcing.md

Usage Examples

Choosing a Database

Question: "Should I use PostgreSQL or MongoDB?"

Consider:
- Data relationships → See data-models/
- Query patterns → See storage/
- Scale requirements → See partitioning/
- Consistency needs → See consistency/

Designing for Scale

Question: "How do I handle millions of users?"

Consider:
- Read scaling → See replication/leader-follower.md
- Write scaling → See partitioning/strategies.md
- Geographic distribution → See replication/multi-leader.md

Handling Failures

Question: "What happens when a node fails?"

Consider:
- Data durability → See replication/
- Consistency trade-offs → See consistency/models.md
- Recovery → See consensus/algorithms.md

Based on concepts from "Designing Data-Intensive Applications" by Martin Kleppmann.

Source & license

This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.

Install and usage instructions live in the source repository linked above.

Reviews

No reviews yet, be the first.

Versions

  • v0.1.0 Imported from the upstream source.