SearchTrees/ThesisDataSizeTests.cpp at master · josiahw/SearchTrees · GitHub

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
#define ARMA_64BIT_WORD
#include <armadillo>

#include <cstdint>
#include <sys/types.h>

#include <random>
#include <algorithm>
#include <unordered_map>
#include <set>
#include <list>

#include <fcntl.h>
#include <sys/mman.h>

#include <sys/time.h>
#include <iostream>
#include <sstream>

#include "BruteForce.h"
#include "KDTree.h"
#include "CoverTree.h"
#include "BallTree.h"
#include "DataReferenceEuclideanNode.h"
#include "ThesisTest.h"

int main (void) {

    std::cout << "DATASET SIZE, TREE TYPE, SIFT TIME, GIST TIME" << std::endl;
    std::pair<double, double> times;
    for (size_t i = 100000; i <= 1000000; i += 100000) {
        std::cout << i << ", Brute Force, ";
        times = ThesisTest<
                        BruteForce<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNSIFT(100, i, 1000);
        std::cout << std::get<1>(times) << ", ";
        times = ThesisTest<
                        BruteForce<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNGIST(100, i, 1000);
        std::cout << std::get<1>(times) << std::endl;

        std::cout << i << ", KD tree, ";
        times = ThesisTest<
                        KDTree<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNSIFT(100, i, 1000);
        std::cout << std::get<1>(times) << ", ";
        times = ThesisTest<
                        KDTree<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNGIST(100, i, 1000);
        std::cout << std::get<1>(times) << std::endl;


        std::cout << i << ", VP tree, ";
        times = ThesisTest<
                        BallTree<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNSIFT(100, i, 1000);
        std::cout << std::get<1>(times) << ", ";
        times = ThesisTest<
                        BallTree<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNGIST(100, i, 1000);
        std::cout << std::get<1>(times) << std::endl;


        std::cout << i << ", Cover tree, ";
        times = ThesisTest<
                        CoverTree<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNInsertSIFT(100, i, 1000);
        std::cout << std::get<1>(times) << ", ";
        times = ThesisTest<
                        CoverTree<DataReferenceEuclideanNode, DataReferenceEuclideanNode>
                        >::timeKNNInsertGIST(100, i, 1000);
        std::cout << std::get<1>(times) << std::endl;
    }

    return 0;
};