[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill-redis-compare-approaches":3,"mdc-il441b-key":37,"related-repo-redis-compare-approaches":666,"related-org-redis-compare-approaches":761},{"slug":4,"name":4,"fn":5,"description":6,"org":7,"tags":11,"stars":23,"repoUrl":24,"updatedAt":25,"license":26,"forks":27,"topics":28,"repo":32,"sourceUrl":35,"mdContent":36},"compare-approaches","prototype Redis data model alternatives","Prototype and compare 2-3 Redis data model alternatives for the same workload",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},"redis","Redis","https:\u002F\u002Fpexgzepcugksgbtrxkhf.supabase.co\u002Fstorage\u002Fv1\u002Fobject\u002Fpublic\u002Forg-logos\u002Fredis.png",[12,16,19,22],{"name":13,"slug":14,"type":15},"Prototyping","prototyping","tag",{"name":17,"slug":18,"type":15},"Database","database",{"name":20,"slug":21,"type":15},"Data Modeling","data-modeling",{"name":9,"slug":8,"type":15},15,"https:\u002F\u002Fgithub.com\u002Fredis\u002Fredisctl","2026-05-27T07:19:55.591944",null,0,[29,8,30,31],"cli","redis-cloud","redis-enterprise",{"repoUrl":24,"stars":23,"forks":27,"topics":33,"description":34},[29,8,30,31],"Unified CLI for Redis Cloud and Enterprise management","https:\u002F\u002Fgithub.com\u002Fredis\u002Fredisctl\u002Ftree\u002FHEAD\u002Fcrates\u002Fredisctl-mcp\u002Fskills\u002Fcompare-approaches","---\nname: compare-approaches\ndescription: Prototype and compare 2-3 Redis data model alternatives for the same workload\n---\n\nYou are a Redis data model comparison specialist. Given a workload and 2-3 candidate approaches, prototype each one using the MCP tools and produce a structured comparison with a recommendation.\n\nThis skill is broader than index-ab-test (which compares index configurations). Here you compare fundamentally different data model choices -- e.g. sorted sets vs hashes vs JSON+search for the same problem.\n\n## Workflow\n\n### Step 1: Define the approaches\n\nFor each approach, establish:\n- **Key naming scheme** (e.g. `presence:{channel}` as sorted set vs hash)\n- **Write operation** (the command sequence for a single write)\n- **Read operation** (the command sequence for the primary query)\n- **Cleanup** (if applicable -- scanner, TTL, or none)\n\nIf coming from the data-modeling-advisor skill, the approaches are already defined. Otherwise, ask the user or infer from context.\n\n### Step 2: Seed representative data\n\nFor each approach, seed the same logical dataset:\n- Use `redis_seed` for uniform\u002Fgenerated data\n- Use `redis_bulk_load` for heterogeneous data or JSON documents\n- Aim for a meaningful dataset size (100-1000 entities minimum)\n- Use distinct key prefixes per approach to avoid collisions\n\nExample:\n```\nApproach A: redis_seed with data_type=\"sorted_set\", key_pattern=\"ss:presence:lobby\", count=500\nApproach B: redis_seed with data_type=\"hash\", key_pattern=\"h:presence:lobby\", count=500\nApproach C: redis_bulk_load with JSON.SET commands for json:user:* keys + redis_ft_create\n```\n\n### Step 3: Measure memory\n\nAfter seeding, for each approach:\n1. Use `redis_key_summary` to get key count and type distribution per prefix\n2. Use `redis_memory_usage` on a sample key from each approach\n3. Use `redis_info` with section=\"memory\" to get total memory (note: measure delta if other data exists)\n\nRecord memory per entity (total memory \u002F entity count).\n\n### Step 4: Test operations\n\nFor each approach, execute the primary operations:\n\n**Write test:**\n- Run the write operation for a single entity\n- Time it (the tool response includes timing)\n- Note the command count per logical write (e.g. HSET+HEXPIRE = 2 commands vs ZADD = 1)\n\n**Read test:**\n- Run the primary read\u002Fquery operation\n- Verify it returns the expected results\n- Note the result format and usability\n\n**Cleanup test (if applicable):**\n- Trigger the cleanup operation\n- Verify it correctly removes expired\u002Fstale data\n\n### Step 5: Compare\n\nBuild a comparison matrix:\n\n| Metric | Approach A | Approach B | Approach C |\n|--------|-----------|-----------|-----------|\n| Data structure | | | |\n| Memory per entity | | | |\n| Commands per write | | | |\n| Commands per read | | | |\n| Cleanup strategy | | | |\n| CRDT cost (if A-A) | | | |\n| Query flexibility | | | |\n| Operational complexity | | | |\n\n### Step 6: Recommend\n\nBased on the comparison:\n1. Identify the winning approach and explain why\n2. Note any trade-offs the user should be aware of\n3. If the difference is marginal, recommend the simpler approach\n4. Suggest next steps (e.g. \"run index-ab-test to optimize the search index\" or \"load-test at scale\")\n\n### Step 7: Clean up\n\nRemove test data from non-selected approaches:\n- Use `redis_scan` + `redis_del` for key-based cleanup\n- Use `redis_ft_dropindex` for any test indexes (without `delete_docs` if shared data)\n- Confirm with the user before deleting\n\n## Tips\n\n- For small datasets, memory differences may be negligible -- focus on operational complexity and query flexibility\n- Command count per operation matters at scale: 1 command vs 3 commands per write is 3x the network round-trips\n- If the user hasn't mentioned Active-Active, don't overweight CRDT cost -- but mention it for awareness\n- The \"right\" answer often becomes obvious only after seeing the data; don't over-analyze before prototyping\n- Use `redis_bulk_load` with `collect_results: true` for small batches where you need to verify NX\u002FXX outcomes\n",{"data":38,"body":39},{"name":4,"description":6},{"type":40,"children":41},"root",[42,50,55,62,69,74,129,134,140,145,183,188,200,206,211,251,256,262,267,275,293,301,319,327,340,346,351,525,531,536,559,565,570,618,624],{"type":43,"tag":44,"props":45,"children":46},"element","p",{},[47],{"type":48,"value":49},"text","You are a Redis data model comparison specialist. Given a workload and 2-3 candidate approaches, prototype each one using the MCP tools and produce a structured comparison with a recommendation.",{"type":43,"tag":44,"props":51,"children":52},{},[53],{"type":48,"value":54},"This skill is broader than index-ab-test (which compares index configurations). Here you compare fundamentally different data model choices -- e.g. sorted sets vs hashes vs JSON+search for the same problem.",{"type":43,"tag":56,"props":57,"children":59},"h2",{"id":58},"workflow",[60],{"type":48,"value":61},"Workflow",{"type":43,"tag":63,"props":64,"children":66},"h3",{"id":65},"step-1-define-the-approaches",[67],{"type":48,"value":68},"Step 1: Define the approaches",{"type":43,"tag":44,"props":70,"children":71},{},[72],{"type":48,"value":73},"For each approach, establish:",{"type":43,"tag":75,"props":76,"children":77},"ul",{},[78,99,109,119],{"type":43,"tag":79,"props":80,"children":81},"li",{},[82,88,90,97],{"type":43,"tag":83,"props":84,"children":85},"strong",{},[86],{"type":48,"value":87},"Key naming scheme",{"type":48,"value":89}," (e.g. ",{"type":43,"tag":91,"props":92,"children":94},"code",{"className":93},[],[95],{"type":48,"value":96},"presence:{channel}",{"type":48,"value":98}," as sorted set vs hash)",{"type":43,"tag":79,"props":100,"children":101},{},[102,107],{"type":43,"tag":83,"props":103,"children":104},{},[105],{"type":48,"value":106},"Write operation",{"type":48,"value":108}," (the command sequence for a single write)",{"type":43,"tag":79,"props":110,"children":111},{},[112,117],{"type":43,"tag":83,"props":113,"children":114},{},[115],{"type":48,"value":116},"Read operation",{"type":48,"value":118}," (the command sequence for the primary query)",{"type":43,"tag":79,"props":120,"children":121},{},[122,127],{"type":43,"tag":83,"props":123,"children":124},{},[125],{"type":48,"value":126},"Cleanup",{"type":48,"value":128}," (if applicable -- scanner, TTL, or none)",{"type":43,"tag":44,"props":130,"children":131},{},[132],{"type":48,"value":133},"If coming from the data-modeling-advisor skill, the approaches are already defined. Otherwise, ask the user or infer from context.",{"type":43,"tag":63,"props":135,"children":137},{"id":136},"step-2-seed-representative-data",[138],{"type":48,"value":139},"Step 2: Seed representative data",{"type":43,"tag":44,"props":141,"children":142},{},[143],{"type":48,"value":144},"For each approach, seed the same logical dataset:",{"type":43,"tag":75,"props":146,"children":147},{},[148,161,173,178],{"type":43,"tag":79,"props":149,"children":150},{},[151,153,159],{"type":48,"value":152},"Use ",{"type":43,"tag":91,"props":154,"children":156},{"className":155},[],[157],{"type":48,"value":158},"redis_seed",{"type":48,"value":160}," for uniform\u002Fgenerated data",{"type":43,"tag":79,"props":162,"children":163},{},[164,165,171],{"type":48,"value":152},{"type":43,"tag":91,"props":166,"children":168},{"className":167},[],[169],{"type":48,"value":170},"redis_bulk_load",{"type":48,"value":172}," for heterogeneous data or JSON documents",{"type":43,"tag":79,"props":174,"children":175},{},[176],{"type":48,"value":177},"Aim for a meaningful dataset size (100-1000 entities minimum)",{"type":43,"tag":79,"props":179,"children":180},{},[181],{"type":48,"value":182},"Use distinct key prefixes per approach to avoid collisions",{"type":43,"tag":44,"props":184,"children":185},{},[186],{"type":48,"value":187},"Example:",{"type":43,"tag":189,"props":190,"children":194},"pre",{"className":191,"code":193,"language":48},[192],"language-text","Approach A: redis_seed with data_type=\"sorted_set\", key_pattern=\"ss:presence:lobby\", count=500\nApproach B: redis_seed with data_type=\"hash\", key_pattern=\"h:presence:lobby\", count=500\nApproach C: redis_bulk_load with JSON.SET commands for json:user:* keys + redis_ft_create\n",[195],{"type":43,"tag":91,"props":196,"children":198},{"__ignoreMap":197},"",[199],{"type":48,"value":193},{"type":43,"tag":63,"props":201,"children":203},{"id":202},"step-3-measure-memory",[204],{"type":48,"value":205},"Step 3: Measure memory",{"type":43,"tag":44,"props":207,"children":208},{},[209],{"type":48,"value":210},"After seeding, for each approach:",{"type":43,"tag":212,"props":213,"children":214},"ol",{},[215,227,239],{"type":43,"tag":79,"props":216,"children":217},{},[218,219,225],{"type":48,"value":152},{"type":43,"tag":91,"props":220,"children":222},{"className":221},[],[223],{"type":48,"value":224},"redis_key_summary",{"type":48,"value":226}," to get key count and type distribution per prefix",{"type":43,"tag":79,"props":228,"children":229},{},[230,231,237],{"type":48,"value":152},{"type":43,"tag":91,"props":232,"children":234},{"className":233},[],[235],{"type":48,"value":236},"redis_memory_usage",{"type":48,"value":238}," on a sample key from each approach",{"type":43,"tag":79,"props":240,"children":241},{},[242,243,249],{"type":48,"value":152},{"type":43,"tag":91,"props":244,"children":246},{"className":245},[],[247],{"type":48,"value":248},"redis_info",{"type":48,"value":250}," with section=\"memory\" to get total memory (note: measure delta if other data exists)",{"type":43,"tag":44,"props":252,"children":253},{},[254],{"type":48,"value":255},"Record memory per entity (total memory \u002F entity count).",{"type":43,"tag":63,"props":257,"children":259},{"id":258},"step-4-test-operations",[260],{"type":48,"value":261},"Step 4: Test operations",{"type":43,"tag":44,"props":263,"children":264},{},[265],{"type":48,"value":266},"For each approach, execute the primary operations:",{"type":43,"tag":44,"props":268,"children":269},{},[270],{"type":43,"tag":83,"props":271,"children":272},{},[273],{"type":48,"value":274},"Write test:",{"type":43,"tag":75,"props":276,"children":277},{},[278,283,288],{"type":43,"tag":79,"props":279,"children":280},{},[281],{"type":48,"value":282},"Run the write operation for a single entity",{"type":43,"tag":79,"props":284,"children":285},{},[286],{"type":48,"value":287},"Time it (the tool response includes timing)",{"type":43,"tag":79,"props":289,"children":290},{},[291],{"type":48,"value":292},"Note the command count per logical write (e.g. HSET+HEXPIRE = 2 commands vs ZADD = 1)",{"type":43,"tag":44,"props":294,"children":295},{},[296],{"type":43,"tag":83,"props":297,"children":298},{},[299],{"type":48,"value":300},"Read test:",{"type":43,"tag":75,"props":302,"children":303},{},[304,309,314],{"type":43,"tag":79,"props":305,"children":306},{},[307],{"type":48,"value":308},"Run the primary read\u002Fquery operation",{"type":43,"tag":79,"props":310,"children":311},{},[312],{"type":48,"value":313},"Verify it returns the expected results",{"type":43,"tag":79,"props":315,"children":316},{},[317],{"type":48,"value":318},"Note the result format and usability",{"type":43,"tag":44,"props":320,"children":321},{},[322],{"type":43,"tag":83,"props":323,"children":324},{},[325],{"type":48,"value":326},"Cleanup test (if applicable):",{"type":43,"tag":75,"props":328,"children":329},{},[330,335],{"type":43,"tag":79,"props":331,"children":332},{},[333],{"type":48,"value":334},"Trigger the cleanup operation",{"type":43,"tag":79,"props":336,"children":337},{},[338],{"type":48,"value":339},"Verify it correctly removes expired\u002Fstale data",{"type":43,"tag":63,"props":341,"children":343},{"id":342},"step-5-compare",[344],{"type":48,"value":345},"Step 5: Compare",{"type":43,"tag":44,"props":347,"children":348},{},[349],{"type":48,"value":350},"Build a comparison matrix:",{"type":43,"tag":352,"props":353,"children":354},"table",{},[355,384],{"type":43,"tag":356,"props":357,"children":358},"thead",{},[359],{"type":43,"tag":360,"props":361,"children":362},"tr",{},[363,369,374,379],{"type":43,"tag":364,"props":365,"children":366},"th",{},[367],{"type":48,"value":368},"Metric",{"type":43,"tag":364,"props":370,"children":371},{},[372],{"type":48,"value":373},"Approach A",{"type":43,"tag":364,"props":375,"children":376},{},[377],{"type":48,"value":378},"Approach B",{"type":43,"tag":364,"props":380,"children":381},{},[382],{"type":48,"value":383},"Approach C",{"type":43,"tag":385,"props":386,"children":387},"tbody",{},[388,406,423,440,457,474,491,508],{"type":43,"tag":360,"props":389,"children":390},{},[391,397,400,403],{"type":43,"tag":392,"props":393,"children":394},"td",{},[395],{"type":48,"value":396},"Data structure",{"type":43,"tag":392,"props":398,"children":399},{},[],{"type":43,"tag":392,"props":401,"children":402},{},[],{"type":43,"tag":392,"props":404,"children":405},{},[],{"type":43,"tag":360,"props":407,"children":408},{},[409,414,417,420],{"type":43,"tag":392,"props":410,"children":411},{},[412],{"type":48,"value":413},"Memory per entity",{"type":43,"tag":392,"props":415,"children":416},{},[],{"type":43,"tag":392,"props":418,"children":419},{},[],{"type":43,"tag":392,"props":421,"children":422},{},[],{"type":43,"tag":360,"props":424,"children":425},{},[426,431,434,437],{"type":43,"tag":392,"props":427,"children":428},{},[429],{"type":48,"value":430},"Commands per write",{"type":43,"tag":392,"props":432,"children":433},{},[],{"type":43,"tag":392,"props":435,"children":436},{},[],{"type":43,"tag":392,"props":438,"children":439},{},[],{"type":43,"tag":360,"props":441,"children":442},{},[443,448,451,454],{"type":43,"tag":392,"props":444,"children":445},{},[446],{"type":48,"value":447},"Commands per read",{"type":43,"tag":392,"props":449,"children":450},{},[],{"type":43,"tag":392,"props":452,"children":453},{},[],{"type":43,"tag":392,"props":455,"children":456},{},[],{"type":43,"tag":360,"props":458,"children":459},{},[460,465,468,471],{"type":43,"tag":392,"props":461,"children":462},{},[463],{"type":48,"value":464},"Cleanup strategy",{"type":43,"tag":392,"props":466,"children":467},{},[],{"type":43,"tag":392,"props":469,"children":470},{},[],{"type":43,"tag":392,"props":472,"children":473},{},[],{"type":43,"tag":360,"props":475,"children":476},{},[477,482,485,488],{"type":43,"tag":392,"props":478,"children":479},{},[480],{"type":48,"value":481},"CRDT cost (if A-A)",{"type":43,"tag":392,"props":483,"children":484},{},[],{"type":43,"tag":392,"props":486,"children":487},{},[],{"type":43,"tag":392,"props":489,"children":490},{},[],{"type":43,"tag":360,"props":492,"children":493},{},[494,499,502,505],{"type":43,"tag":392,"props":495,"children":496},{},[497],{"type":48,"value":498},"Query flexibility",{"type":43,"tag":392,"props":500,"children":501},{},[],{"type":43,"tag":392,"props":503,"children":504},{},[],{"type":43,"tag":392,"props":506,"children":507},{},[],{"type":43,"tag":360,"props":509,"children":510},{},[511,516,519,522],{"type":43,"tag":392,"props":512,"children":513},{},[514],{"type":48,"value":515},"Operational complexity",{"type":43,"tag":392,"props":517,"children":518},{},[],{"type":43,"tag":392,"props":520,"children":521},{},[],{"type":43,"tag":392,"props":523,"children":524},{},[],{"type":43,"tag":63,"props":526,"children":528},{"id":527},"step-6-recommend",[529],{"type":48,"value":530},"Step 6: Recommend",{"type":43,"tag":44,"props":532,"children":533},{},[534],{"type":48,"value":535},"Based on the comparison:",{"type":43,"tag":212,"props":537,"children":538},{},[539,544,549,554],{"type":43,"tag":79,"props":540,"children":541},{},[542],{"type":48,"value":543},"Identify the winning approach and explain why",{"type":43,"tag":79,"props":545,"children":546},{},[547],{"type":48,"value":548},"Note any trade-offs the user should be aware of",{"type":43,"tag":79,"props":550,"children":551},{},[552],{"type":48,"value":553},"If the difference is marginal, recommend the simpler approach",{"type":43,"tag":79,"props":555,"children":556},{},[557],{"type":48,"value":558},"Suggest next steps (e.g. \"run index-ab-test to optimize the search index\" or \"load-test at scale\")",{"type":43,"tag":63,"props":560,"children":562},{"id":561},"step-7-clean-up",[563],{"type":48,"value":564},"Step 7: Clean up",{"type":43,"tag":44,"props":566,"children":567},{},[568],{"type":48,"value":569},"Remove test data from non-selected approaches:",{"type":43,"tag":75,"props":571,"children":572},{},[573,593,613],{"type":43,"tag":79,"props":574,"children":575},{},[576,577,583,585,591],{"type":48,"value":152},{"type":43,"tag":91,"props":578,"children":580},{"className":579},[],[581],{"type":48,"value":582},"redis_scan",{"type":48,"value":584}," + ",{"type":43,"tag":91,"props":586,"children":588},{"className":587},[],[589],{"type":48,"value":590},"redis_del",{"type":48,"value":592}," for key-based cleanup",{"type":43,"tag":79,"props":594,"children":595},{},[596,597,603,605,611],{"type":48,"value":152},{"type":43,"tag":91,"props":598,"children":600},{"className":599},[],[601],{"type":48,"value":602},"redis_ft_dropindex",{"type":48,"value":604}," for any test indexes (without ",{"type":43,"tag":91,"props":606,"children":608},{"className":607},[],[609],{"type":48,"value":610},"delete_docs",{"type":48,"value":612}," if shared data)",{"type":43,"tag":79,"props":614,"children":615},{},[616],{"type":48,"value":617},"Confirm with the user before deleting",{"type":43,"tag":56,"props":619,"children":621},{"id":620},"tips",[622],{"type":48,"value":623},"Tips",{"type":43,"tag":75,"props":625,"children":626},{},[627,632,637,642,647],{"type":43,"tag":79,"props":628,"children":629},{},[630],{"type":48,"value":631},"For small datasets, memory differences may be negligible -- focus on operational complexity and query flexibility",{"type":43,"tag":79,"props":633,"children":634},{},[635],{"type":48,"value":636},"Command count per operation matters at scale: 1 command vs 3 commands per write is 3x the network round-trips",{"type":43,"tag":79,"props":638,"children":639},{},[640],{"type":48,"value":641},"If the user hasn't mentioned Active-Active, don't overweight CRDT cost -- but mention it for awareness",{"type":43,"tag":79,"props":643,"children":644},{},[645],{"type":48,"value":646},"The \"right\" answer often becomes obvious only after seeing the data; don't over-analyze before prototyping",{"type":43,"tag":79,"props":648,"children":649},{},[650,651,656,658,664],{"type":48,"value":152},{"type":43,"tag":91,"props":652,"children":654},{"className":653},[],[655],{"type":48,"value":170},{"type":48,"value":657}," with ",{"type":43,"tag":91,"props":659,"children":661},{"className":660},[],[662],{"type":48,"value":663},"collect_results: true",{"type":48,"value":665}," for small batches where you need to verify NX\u002FXX outcomes",{"items":667,"total":760},[668,683,690,705,718,731,749],{"slug":669,"name":669,"fn":670,"description":671,"org":672,"tags":673,"stars":23,"repoUrl":24,"updatedAt":682},"cloud-database-provisioning","provision Redis Cloud databases","Provision a Redis Cloud database end-to-end — Essentials (fixed plan) or Pro (custom) — using Redis Cloud MCP tools",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[674,677,678,681],{"name":675,"slug":676,"type":15},"Cloud","cloud",{"name":17,"slug":18,"type":15},{"name":679,"slug":680,"type":15},"MCP","mcp",{"name":9,"slug":8,"type":15},"2026-06-03T07:53:00.906753",{"slug":4,"name":4,"fn":5,"description":6,"org":684,"tags":685,"stars":23,"repoUrl":24,"updatedAt":25},{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[686,687,688,689],{"name":20,"slug":21,"type":15},{"name":17,"slug":18,"type":15},{"name":13,"slug":14,"type":15},{"name":9,"slug":8,"type":15},{"slug":691,"name":691,"fn":692,"description":693,"org":694,"tags":695,"stars":23,"repoUrl":24,"updatedAt":704},"data-explorer","explore and profile Redis datasets","Profile and explore a Redis dataset - key types, sizes, TTLs, encodings, and sample values",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[696,699,700,703],{"name":697,"slug":698,"type":15},"Data Analysis","data-analysis",{"name":17,"slug":18,"type":15},{"name":701,"slug":702,"type":15},"Observability","observability",{"name":9,"slug":8,"type":15},"2026-05-28T07:09:52.268662",{"slug":706,"name":706,"fn":707,"description":708,"org":709,"tags":710,"stars":23,"repoUrl":24,"updatedAt":717},"data-modeling-advisor","design Redis data models","Recommend Redis data structures and patterns for a given workload before committing to an approach",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[711,714,715,716],{"name":712,"slug":713,"type":15},"Architecture","architecture",{"name":20,"slug":21,"type":15},{"name":17,"slug":18,"type":15},{"name":9,"slug":8,"type":15},"2026-05-28T07:09:51.028825",{"slug":719,"name":719,"fn":720,"description":721,"org":722,"tags":723,"stars":23,"repoUrl":24,"updatedAt":730},"enterprise-health-check","perform Redis Enterprise cluster health checks","Comprehensive pre-operation health check for a Redis Enterprise cluster — verify cluster state, node health, license status, and active alerts before making changes",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[724,725,726,729],{"name":17,"slug":18,"type":15},{"name":701,"slug":702,"type":15},{"name":727,"slug":728,"type":15},"Operations","operations",{"name":9,"slug":8,"type":15},"2026-06-03T07:52:59.693017",{"slug":732,"name":732,"fn":733,"description":734,"org":735,"tags":736,"stars":23,"repoUrl":24,"updatedAt":748},"index-ab-test","compare RediSearch index configurations","Create and compare multiple RediSearch index configurations to find the best one",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[737,740,741,744,745],{"name":738,"slug":739,"type":15},"A\u002FB Testing","a-b-testing",{"name":17,"slug":18,"type":15},{"name":742,"slug":743,"type":15},"Performance","performance",{"name":9,"slug":8,"type":15},{"name":746,"slug":747,"type":15},"Search","search","2026-05-28T07:09:53.54884",{"slug":750,"name":750,"fn":751,"description":752,"org":753,"tags":754,"stars":23,"repoUrl":24,"updatedAt":759},"index-advisor","recommend RediSearch index schemas","Analyze a Redis dataset and recommend an optimal RediSearch index schema",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[755,756,757,758],{"name":20,"slug":21,"type":15},{"name":17,"slug":18,"type":15},{"name":9,"slug":8,"type":15},{"name":746,"slug":747,"type":15},"2026-05-28T07:09:48.520606",17,{"items":762,"total":931},[763,785,799,812,823,839,853,873,887,902,917,924],{"slug":764,"name":764,"fn":765,"description":766,"org":767,"tags":768,"stars":782,"repoUrl":783,"updatedAt":784},"iris-development","integrate with Redis Iris AI products","Iris is Redis's umbrella for AI-focused products. Use this skill when integrating with the Iris Redis Agent Memory (RAM) data plane on Redis Cloud — recording session events for an AI agent, creating or searching long-term memories, configuring a memory store, or tuning background memory promotion. Code examples use the official `redis-agent-memory` (Python) and `@redis-iris\u002Fagent-memory` (TypeScript) SDKs.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[769,772,775,778,781],{"name":770,"slug":771,"type":15},"Agents","agents",{"name":773,"slug":774,"type":15},"AI Infrastructure","ai-infrastructure",{"name":776,"slug":777,"type":15},"Backend","backend",{"name":779,"slug":780,"type":15},"Memory","memory",{"name":9,"slug":8,"type":15},92,"https:\u002F\u002Fgithub.com\u002Fredis\u002Fagent-skills","2026-05-27T07:19:45.213725",{"slug":786,"name":786,"fn":787,"description":788,"org":789,"tags":790,"stars":782,"repoUrl":783,"updatedAt":798},"redis-clustering","configure Redis clustering and replication","Redis Cluster and replication guidance covering hash tags for multi-key operations, avoiding CROSSSLOT errors, and reading from replicas to scale read-heavy workloads. Use when designing keys for a sharded Redis Cluster, debugging CROSSSLOT errors on MGET \u002F SDIFF \u002F pipelines, configuring a multi-key transaction in a cluster, or routing reads to replicas for caches, analytics, or dashboards.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[791,792,793,796,797],{"name":712,"slug":713,"type":15},{"name":17,"slug":18,"type":15},{"name":794,"slug":795,"type":15},"Infrastructure","infrastructure",{"name":742,"slug":743,"type":15},{"name":9,"slug":8,"type":15},"2026-05-27T07:19:38.757599",{"slug":800,"name":800,"fn":801,"description":802,"org":803,"tags":804,"stars":782,"repoUrl":783,"updatedAt":811},"redis-connections","optimize Redis client connections","Redis client and connection guidance covering connection pooling, multiplexing, pipelining, client-side caching with RESP3, avoiding slow commands (KEYS, SMEMBERS, HGETALL), and tuning socket timeouts. Use when configuring a Redis client (redis-py, Jedis, Lettuce, NRedisStack), batching commands for throughput, eliminating per-request connection creation, iterating large keyspaces with SCAN, enabling client-side caching for read-heavy workloads, or setting connect and read timeouts.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[805,806,809,810],{"name":776,"slug":777,"type":15},{"name":807,"slug":808,"type":15},"Caching","caching",{"name":742,"slug":743,"type":15},{"name":9,"slug":8,"type":15},"2026-05-27T07:19:42.616757",{"slug":813,"name":813,"fn":814,"description":815,"org":816,"tags":817,"stars":782,"repoUrl":783,"updatedAt":822},"redis-core","model data with Redis structures","Core Redis modeling guidance — choose the right data structure (String, Hash, List, Set, Sorted Set, JSON, Stream, Vector Set) and use consistent colon-separated key names. Use when designing a Redis data model, caching objects, deciding between Hash and JSON, building counters, leaderboards, membership sets, or session stores, or when reviewing\u002Fcleaning up Redis key naming.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[818,819,820,821],{"name":712,"slug":713,"type":15},{"name":20,"slug":21,"type":15},{"name":17,"slug":18,"type":15},{"name":9,"slug":8,"type":15},"2026-05-27T07:19:41.317954",{"slug":824,"name":824,"fn":825,"description":826,"org":827,"tags":828,"stars":782,"repoUrl":783,"updatedAt":838},"redis-observability","monitor and triage Redis performance","Redis observability guidance — which metrics to monitor (memory, connections, hit ratio, ops\u002Fsec, rejected connections), which built-in commands to reach for during incident triage (SLOWLOG, INFO, MEMORY DOCTOR, CLIENT LIST, FT.PROFILE), and when to use the Redis Insight GUI. Use when setting up monitoring or alerts for a Redis instance, diagnosing a performance regression, profiling a slow FT.SEARCH query, or wiring Redis metrics into Prometheus, Datadog, or similar.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[829,832,835,836,837],{"name":830,"slug":831,"type":15},"Debugging","debugging",{"name":833,"slug":834,"type":15},"Monitoring","monitoring",{"name":701,"slug":702,"type":15},{"name":742,"slug":743,"type":15},{"name":9,"slug":8,"type":15},"2026-05-27T07:19:47.780873",{"slug":840,"name":840,"fn":841,"description":842,"org":843,"tags":844,"stars":782,"repoUrl":783,"updatedAt":852},"redis-search","implement Redis Search indexing and queries","Redis Search guidance covering FT.CREATE schema design, field type selection (TEXT, TAG, NUMERIC, GEO, GEOSHAPE, VECTOR, JSON path), DIALECT 2 query syntax, FT.SEARCH \u002F FT.AGGREGATE \u002F FT.HYBRID command selection, vector similarity with HNSW or FLAT, hybrid retrieval combining lexical and vector ranking, RAG pipelines, zero-downtime index updates via aliases, and debugging with FT.PROFILE and FT.EXPLAIN. Use when defining a search index on Hash or JSON documents, writing FT.SEARCH queries with filters, sorting, aggregation, or vector KNN, tuning HNSW parameters, building a RAG retrieval pipeline, or troubleshooting slow or empty search results.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[845,846,847,850,851],{"name":712,"slug":713,"type":15},{"name":17,"slug":18,"type":15},{"name":848,"slug":849,"type":15},"Engineering","engineering",{"name":9,"slug":8,"type":15},{"name":746,"slug":747,"type":15},"2026-06-24T07:39:43.089819",{"slug":854,"name":854,"fn":855,"description":856,"org":857,"tags":858,"stars":782,"repoUrl":783,"updatedAt":872},"redis-security","secure Redis instances and clusters","Redis security guidance covering authentication (requirepass and ACL users), TLS, ACL-based least-privilege access control, restricting network exposure via bind and protected-mode, firewall rules, and disabling dangerous commands. Use when deploying Redis to production, defining ACL users for an application, configuring TLS connections, locking down a Redis instance behind a firewall, or auditing a Redis deployment for security hardening.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[859,862,865,868,869],{"name":860,"slug":861,"type":15},"Access Control","access-control",{"name":863,"slug":864,"type":15},"Authentication","authentication",{"name":866,"slug":867,"type":15},"Compliance","compliance",{"name":9,"slug":8,"type":15},{"name":870,"slug":871,"type":15},"Security","security","2026-05-27T07:19:40.030241",{"slug":874,"name":874,"fn":875,"description":876,"org":877,"tags":878,"stars":782,"repoUrl":783,"updatedAt":886},"redis-semantic-cache","implement semantic caching with Redis","Redis LangCache guidance for semantic caching of LLM responses on Redis Cloud — calling search\u002Fset via the SDK or REST API, tuning the similarity threshold, separating caches per task type, and filtering with custom attributes. Use when caching LLM completions or RAG answers to cut API cost and latency, building a cache-aside layer in front of OpenAI \u002F Anthropic \u002F etc., tuning hit rate vs precision, or splitting one app's LLM workloads into multiple LangCache caches.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[879,880,881,884,885],{"name":773,"slug":774,"type":15},{"name":807,"slug":808,"type":15},{"name":882,"slug":883,"type":15},"LLM","llm",{"name":9,"slug":8,"type":15},{"name":746,"slug":747,"type":15},"2026-05-27T07:19:43.897283",{"slug":888,"name":888,"fn":889,"description":890,"org":891,"tags":892,"stars":899,"repoUrl":900,"updatedAt":901},"agent-filesystem","manage persistent storage in Redis","Use when agents need persistent shared storage, when saving or restoring workspace state, or when coordinating file access across multiple agents and machines. Creates Redis-backed workspaces, checkpoints and restores agent state, mounts shared filesystems locally, searches workspace contents, and forks workspaces for parallel work.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[893,894,897,898],{"name":770,"slug":771,"type":15},{"name":895,"slug":896,"type":15},"File Storage","file-storage",{"name":779,"slug":780,"type":15},{"name":9,"slug":8,"type":15},22,"https:\u002F\u002Fgithub.com\u002Fredis\u002Fagent-filesystem","2026-04-10T04:51:05.904489",{"slug":903,"name":903,"fn":904,"description":905,"org":906,"tags":907,"stars":899,"repoUrl":900,"updatedAt":916},"codex-settings-sync","sync Codex settings across computers","Use when the user wants to migrate Codex state in ~\u002F.codex into Agent Filesystem and mount the same shared Codex memory\u002Fsettings across multiple computers. Recommends a .afsignore before migration and defaults to excluding worktrees, caches, logs, and temporary files.",{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[908,911,912,915],{"name":909,"slug":910,"type":15},"Codex","codex",{"name":779,"slug":780,"type":15},{"name":913,"slug":914,"type":15},"Migration","migration",{"name":9,"slug":8,"type":15},"2026-04-10T04:51:07.268248",{"slug":669,"name":669,"fn":670,"description":671,"org":918,"tags":919,"stars":23,"repoUrl":24,"updatedAt":682},{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[920,921,922,923],{"name":675,"slug":676,"type":15},{"name":17,"slug":18,"type":15},{"name":679,"slug":680,"type":15},{"name":9,"slug":8,"type":15},{"slug":4,"name":4,"fn":5,"description":6,"org":925,"tags":926,"stars":23,"repoUrl":24,"updatedAt":25},{"slug":8,"name":9,"logoUrl":10,"githubOrg":8},[927,928,929,930],{"name":20,"slug":21,"type":15},{"name":17,"slug":18,"type":15},{"name":13,"slug":14,"type":15},{"name":9,"slug":8,"type":15},27]