1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/*
*
*/
#define ENABLE_TIMER
#include <fstream>
#include <sstream>
#include "framework/DynamicExtension.h"
#include "shard/FSTrie.h"
#include "query/pointlookup.h"
#include "framework/interface/Record.h"
#include "psu-util/timer.h"
#include "psu-util/progress.h"
typedef de::Record<const char *, uint64_t> Rec;
typedef de::FSTrie<Rec> Trie;
typedef de::pl::Query<Rec, Trie> Q;
typedef de::DynamicExtension<Rec, Trie, Q, de::LayoutPolicy::TEIRING, de::DeletePolicy::TAGGING, de::SerialScheduler> Ext;
std::vector<std::unique_ptr<char[]>> strings;
void insert_thread(int64_t start, int64_t end, Ext *extension) {
for (uint64_t i=start; i<end; i++) {
Rec r = {strings[i].get(), i, strlen(strings[i].get())};
while (!extension->insert(r)) {
_mm_pause();
}
}
}
void read_data(std::string fname, size_t n=10000000) {
strings.reserve(n);
std::fstream file;
file.open(fname, std::ios::in);
size_t i=0;
std::string line;
while (i < n && std::getline(file, line, '\n')) {
strings.emplace_back(std::unique_ptr<char[]>(strdup(line.c_str())));
i++;
psudb::progress_update((double) i / (double) n, "Reading file:");
}
}
void usage(char *name) {
fprintf(stderr, "Usage:\n%s datafile record_count\n", name);
}
int main(int argc, char **argv) {
if (argc < 3) {
usage(argv[0]);
exit(EXIT_FAILURE);
}
std::string fname = std::string(argv[1]);
size_t n = atol(argv[2]);
read_data(fname, n);
if (strings.size() == 0) {
fprintf(stderr, "[E]: No string data read from file. Aborting execution.\n");
} else {
fprintf(stderr, "Finished reading from file.\n");
}
auto extension = new Ext(1000, 12000, 8);
TIMER_INIT();
TIMER_START();
insert_thread(0, strings.size(), extension);
TIMER_STOP();
auto total_time = TIMER_RESULT();
size_t m = 100;
TIMER_START();
for (size_t i=0; i<m; i++) {
size_t j = rand() % strings.size();
de::pl::Parms<Rec> parms = {strings[j].get()};
auto res = extension->query(&parms);
auto ans = res.get();
if (ans[0].value != j) {
fprintf(stderr, "ext:\t%ld %ld %s\n", ans[0].value, j, strings[j].get());
}
assert(ans[0].value == j);
}
TIMER_STOP();
auto query_time = TIMER_RESULT();
auto shard = extension->create_static_structure();
TIMER_START();
for (size_t i=0; i<m; i++) {
size_t j = rand() % strings.size();
de::pl::Parms<Rec> parms = {strings[j].get()};
auto res = Q::query(shard, nullptr, &parms);
if (res[0].rec.value != j) {
fprintf(stderr, "static:\t%ld %ld %s\n", res[0].rec.value, j, strings[j].get());
}
}
TIMER_STOP();
auto shard_query_time = TIMER_RESULT();
double i_tput = (double) n / (double) total_time * 1e9;
size_t q_lat = query_time / m;
size_t s_q_lat = shard_query_time / m;
fprintf(stdout, "%ld\t\t%lf\t%ld\t%ld\t%ld\t%ld\n", extension->get_record_count(),
i_tput, q_lat, s_q_lat, extension->get_memory_usage(), shard->get_memory_usage());
delete extension;
delete shard;
fflush(stderr);
}
|