78 lines
1.9 KiB
C++
78 lines
1.9 KiB
C++
#include "profile.hpp"
|
|
|
|
#include "barrier/barrier.cpp"
|
|
|
|
#include "database/db.hpp"
|
|
#include "database/db_accessor.hpp"
|
|
|
|
#include <chrono>
|
|
#include <ctime>
|
|
#include <strings.h>
|
|
#include <unistd.h>
|
|
#include <unordered_map>
|
|
#include "communication/bolt/v1/serialization/bolt_serializer.hpp"
|
|
#include "import/csv_import.hpp"
|
|
#include "utils/command_line/arguments.hpp"
|
|
|
|
using namespace std;
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
auto para = all_arguments(argc, argv);
|
|
Db db;
|
|
|
|
import_csv_from_arguments(db, para);
|
|
|
|
usleep(1000 * 1000 * 10);
|
|
|
|
{
|
|
DbAccessor t(db);
|
|
|
|
vector<pair<barrier::VertexAccessor, unordered_map<string, double>>>
|
|
coll;
|
|
|
|
// QUERY BENCHMARK
|
|
auto begin = clock();
|
|
int n = for_all_companys(barrier::trans(t), coll);
|
|
clock_t end = clock();
|
|
double elapsed_s = (double(end - begin) / CLOCKS_PER_SEC);
|
|
|
|
if (n == 0) {
|
|
cout << "No companys" << endl;
|
|
return 0;
|
|
}
|
|
|
|
cout << endl
|
|
<< "Query duration: " << (elapsed_s / n) * 1000 * 1000 << " [us]"
|
|
<< endl;
|
|
cout << "Throughput: " << 1 / (elapsed_s / n) << " [query/sec]" << endl;
|
|
|
|
auto res = coll.back();
|
|
while (res.second.empty()) {
|
|
coll.pop_back();
|
|
res = coll.back();
|
|
}
|
|
|
|
auto prop_vertex_id = t.vertex_property_key<Int64>("company_id");
|
|
cout << endl
|
|
<< "Example: "
|
|
<< *barrier::trans(res.first).at(prop_vertex_id).get() << endl;
|
|
for (auto e : res.second) {
|
|
cout << e.first << " = " << e.second << endl;
|
|
}
|
|
|
|
double sum = 0;
|
|
for (auto r : coll) {
|
|
for (auto e : r.second) {
|
|
sum += e.second;
|
|
}
|
|
}
|
|
|
|
cout << endl << endl << "Compiler sum " << sum << endl;
|
|
t.commit();
|
|
}
|
|
// usleep(1000 * 1000 * 60);
|
|
|
|
return 0;
|
|
}
|