-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathparallel_bskytree.h
52 lines (41 loc) · 1.12 KB
/
parallel_bskytree.h
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
/*
* parallel_bskytree.h
*
* Created on: Jul 6, 2014
* Author: dariuss
*
*
* Our parallel variant of BSkyTree-S algorithm.
*/
#ifndef PARALLEL_BSKYTREE_H_
#define PARALLEL_BSKYTREE_H_
#include <map>
#include <vector>
#include <common/skyline_i.h>
#include <bskytree/node.h>
using namespace std;
class ParallelBSkyTree: public SkylineI {
public:
ParallelBSkyTree( const uint32_t num_threads, const uint32_t n,
const uint32_t d, float** dataset );
virtual ~ParallelBSkyTree();
void Init( float** dataset );
vector<int> Execute( void );
private:
void BSkyTreeS_ALGO();
void DoPartioning();
// PivotSelection methods
void SelectBalanced();
vector<float> SetRangeList( const vector<float>& min_list,
const vector<float>& max_list );
float ComputeDistance( const float* value, const vector<float>& min_list,
const vector<float>& range_list );
bool EvaluatePoint( const uint32_t pos );
const uint32_t num_threads_;
const uint32_t n_;
const uint32_t d_;
vector<TUPLE_S> data_;
vector<int> skyline_;
vector<int> eqm_; // "equivalence matrix"
};
#endif /* PARALLEL_BSKYTREE_H_ */