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
C++ algoliadatastoreelasticsearchenterprise-searchfacetingfull-text-searchfuzzy-searchgeosearchin-memoryinstantsearchmerchandisingpineconesearchsearch-enginesemantic-searchsimilarity-searchsite-searchsynonymstypo-tolerancevector-search
Log multi-field aggregation time.
Kishore Nallan4cb6d7926a41
diff --git a/src/index.cpp b/src/index.cppindex 40580704..3fc4bc1e 100644--- a/src/index.cpp+++ b/src/index.cpp@@ -2175,6 +2175,8 @@ void Index::search(std::vector<query_tokens_t>& field_query_tokens,}}+ auto begin0 = std::chrono::high_resolution_clock::now();+for(auto& seq_id_kvs: topster_ids) {const uint64_t seq_id = seq_id_kvs.first;auto& kvs = seq_id_kvs.second; // each `kv` can be from a different field@@ -2358,6 +2360,11 @@ void Index::search(std::vector<query_tokens_t>& field_query_tokens,kvs[0]->scores[kvs[0]->match_score_index] = aggregated_score;topster->add(kvs[0]);}++ auto timeMillis0 = std::chrono::duration_cast<std::chrono::milliseconds>(+ std::chrono::high_resolution_clock::now() - begin0).count();++ LOG(INFO) << "Time taken for multi-field aggregation: " << timeMillis0 << "ms";}//LOG(INFO) << "topster size: " << topster->size;