{"component":{"type":17,"accent_color":7315445,"components":[{"type":10,"content":"-# WikiRNG · Roll of 11/18/2026 · by [Yep333](https://wikirng.com/u/Yep333)"},{"type":10,"content":"## [Sargable](https://wikirng.com/roll/R2MA2T)\n*Concept in databases*"},{"type":10,"content":">>> In relational databases, a condition (or predicate) in a query is said to be sargable if the DBMS engine can take advantage of an index to speed up the execution of the query. The term is derived from a contraction of Search ARGument ABLE."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟦 Obscure · 114,466 SP\n-# Top 17%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 ⌨️ **Source Code** · Obscure · +61,663 SP\n-# Has a code block.\n🟦 🔬 **Original Research** · Obscure · +41,943 SP\n-# Tagged as maybe containing original research.\n🟩 🗣️ **All Talk** · Notable · +5,381 SP\n-# Its talk page is bigger than the article.\n🟩 🔀 **Anagram** · Notable · +1,034 SP\n-# Another article's title uses the same letters in another order (4+ letters).\n⬜ 1️⃣ **One Word** · Basic · +813 SP\n-# Title is one word.\n⬜ 🎓 **.edu** · Basic · +631 SP\n-# Links to a university site (.edu).\n-# +10 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/R2MA2T"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Sargable"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}