From 1e226fc415d7674de0ecde51199d89e9042c6a22 Mon Sep 17 00:00:00 2001 From: Douglas Rumbaugh Date: Wed, 31 Jan 2024 16:57:41 -0500 Subject: Updated insert query throughput to use IRS queries --- benchmarks/insert_query_tput.cpp | 14 ++++++++------ 1 file changed, 8 insertions(+), 6 deletions(-) (limited to 'benchmarks/insert_query_tput.cpp') diff --git a/benchmarks/insert_query_tput.cpp b/benchmarks/insert_query_tput.cpp index 8274d2a..05715b1 100644 --- a/benchmarks/insert_query_tput.cpp +++ b/benchmarks/insert_query_tput.cpp @@ -8,7 +8,7 @@ #include "framework/DynamicExtension.h" #include "shard/ISAMTree.h" -#include "query/rangecount.h" +#include "query/irs.h" #include "framework/interface/Record.h" #include @@ -18,7 +18,7 @@ typedef de::Record Rec; typedef de::ISAMTree ISAM; -typedef de::rc::Query Q; +typedef de::irs::Query Q; typedef de::DynamicExtension Ext; std::atomic inserts_done = false; @@ -27,17 +27,19 @@ void query_thread(Ext *extension, size_t n) { gsl_rng *rng = gsl_rng_alloc(gsl_rng_mt19937); size_t range = n*.0001; - size_t total = 0; + int64_t total = 0; - de::rc::Parms *q = new de::rc::Parms(); + de::irs::Parms *q = new de::irs::Parms(); while (!inserts_done.load()) { size_t start = gsl_rng_uniform_int(rng, n - range); q->lower_bound = start; q->upper_bound = start + range; + q->sample_size = 100; + q->rng = rng; auto res = extension->query(q); auto r = res.get(); - total += r[0].key; - usleep(1); + total += r.size(); + usleep(1); } fprintf(stderr, "%ld\n", total); -- cgit v1.2.3