ビデオ
The SparseGrams function
Mark Needham
Learn about ClickHouse's sparse grams function and how it improves upon traditional n-grams to build better search solutions. This tutorial walks through the concept step-by-step, explaining how sparse grams work by using weighted substrings to filter out common patterns that would otherwise return too many search results. We'll explore the algorithm with practical examples and show you how to use it in ClickHouse.
What You'll Learn:
- The limitations of traditional n-grams for search indexing at scale
- How GitHub's sparse grams algorithm solves the "too many results" problem
- Step-by-step walkthrough of the sparse grams weighting system
- How to use ClickHouse's sparseGrams() function with practical examples
- Understanding the crc32 hash function for weight calculations
- Comparing n-grams vs sparse grams output side-by-side

User stories, Meetups
ClickHouse at DoorDash
How DoorDash monitors TCP and DNS traffic helping their observability team take care of their kubernetes infrastructure.

Open House
Open House NYC: Keynote
Keynote from Open House Roadshow NYC 2025.

Open House
Open House NYC: ClickHouse for AI/ML
Zach Naimon, Principal Product Manager at ClickHouse
Stay informed on feature releases, product roadmap, support, and cloud offerings!
Loading form...
© 2025 ClickHouse, Inc. 本社はカリフォルニア州ベイエリアとオランダ領アムステルダムにあります。