Rank Search Results, Do Not Scan Text
Hard About 35 min Katabench Pro
Use a weighted stored tsvector, web-search syntax, coverage ranking, and a GIN index.
The full brief is part of Katabench Pro
Pro opens this kata's brief, its starter code and its grader. To see how the track works first, try Customer Order Totals, which is free.
How it is graded
Your LINQ or SQL runs against real PostgreSQL. You see the SQL your code generates on the sample tests and can inspect its execution plan, so you learn when the database did the wrong work.
What it practices
- Full-text search
- Search and rank text with tsvector and tsquery instead of scanning with LIKE.
- GIN and GiST indexes
- Index containment, overlap, nearest-neighbor and text search operators.
Related katas
- The Most Specific Firewall Rule Wins Hard Pro Match IPv4 and IPv6 addresses with native network containment, then choose the longest enabled prefix.
- One Entitlement Must Satisfy Every Rule Hard Pro Use a GIN prefilter and parameterized JSONPath so product, scope, and enabled state match one object.
- Nearest Depots Without Sorting the World Hard Pro Use PostgreSQL point distance ordering and a GiST KNN scan to find the nearest active depots.
- Every Required Certification Medium Pro Match all required certifications with PostgreSQL array containment and a selective GIN index.