Skip to content

Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences

Always use hash based faceting for small result sets.

Kishore Nallane9d46ccf90ef
diff --git a/src/index.cpp b/src/index.cpp
index 50f7a19b..76fd43eb 100644
--- a/src/index.cpp
+++ b/src/index.cpp
@@ -1281,8 +1281,9 @@ void Index::do_facets(std::vector<facet> & facets, facet_query_t & facet_query,
// 2. Wildcard + no filters -> use value index
// 3. Very few unique facet values (< 250) -> use value index
// 4. Result match > 50%
- bool use_value_index = (group_limit == 0) && ( is_wildcard_no_filter_query || num_facet_values < 250 ||
- (results_size * 2 > total_docs));
+ bool use_value_index = (group_limit == 0) && ( is_wildcard_no_filter_query ||
+ (results_size > 1000 && num_facet_values < 250) ||
+ (results_size > 1000 && results_size * 2 > total_docs));
#ifdef TEST_BUILD
if(facet_index_type == VALUE) {