-
Notifications
You must be signed in to change notification settings - Fork 1
/
Actions.h
217 lines (177 loc) · 8.69 KB
/
Actions.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
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
#ifndef _ACTIONS_H_
#define _ACTIONS_H_
#include "Results.h"
#include "Tables.h"
#include "Query.h"
#include "DataParse.h"
static int intermediateResultsAmount = 0;
typedef struct IntermediateResults
{//struct for saving results between joins or comparisons
uint64_t *tupleIDs;
int *relationIDs;
int32_t **keys;
uint64_t tupleAmount;
int relAmount;
} IntermediateResults;
typedef struct IntermediateResultsList{
IntermediateResults* table;
struct IntermediateResultsList* next;
} IntermediateResultsList ;
/**
* Initializes an intermediate results struct.
*/
void IntermediateResultsInit(IntermediateResults **inRes);
/**
* Given an intermediate results table, creates a relation struct to insert into the Radix algorithm, so it can
* perform the join operation between two relations.
*/
relation *createRelationFromIntermediateResults(IntermediateResults* inRes, table *t, int relationID, int columnID);
/**
* Given a column of the table, creates a relation based on its rowIDs.
*/
relation* createRelationFromTable(table *t, int columnID);
/**
* Given a payload and the value to be compared to, returns 1 for true or 0 for false, depending on the action
* being performed on that payload.
*/
int comparePayloadToValue(int32_t payload, int value, int action);
/**
* Given a relation, a value and an action (comparison) to be performed on that relation, calculates the results
* returned from that action.
*/
int calculateActionResultAmount(relation *rel, int value, int action);
/**
* Given all relation tables and queries in batch, the function below calculates the priority
* for each action to be executed.
*/
void calculateActionPriorities(table **t, Query *q);
/**
* Allocates the necessary space for an intermediate results structure.
*/
void IntermediateResultsAlloc(IntermediateResults** inRes, uint64_t tupleAmount, int relAmount);
/**
* Deletes a given intermediate results struct.
*/
void IntermediateResultsDel(IntermediateResults *inRes);
/**
* Given a query q and a table array containing all the relations given as input, executes the query.
*/
void executeQuery(table **t, Query *q);
/**
* In case the action required by the query is a comparison (>, <, =) then this functions is called, which
* compares each line of the relation to find all the rows that satisfy comparison.
*/
IntermediateResultsList* compareColumn(IntermediateResultsList *list , table *t, int relationID, int columnID , int value , int action);
/**
* Two columns of the same relation are joined and therefore there is no need to call the Radix algorithm. We must
* simply compare the values of the two columns of the relation to find those that are equal.
*/
IntermediateResultsList* joinSameRelation(IntermediateResultsList* head, table **t, int* rels, int relationA, int columnA, int columnB);
/**
* Two different relations are joined and therefore the Radix algorithm must me called. If there are already
* any intermediate results, they are taken into consideration. Otherwise, the initial relations' values are
* inserted into the algorithm.
*/
IntermediateResultsList* joinRelationsRadix(IntermediateResultsList* inRes, table **t, int* rels, int relationA, int relationB, int columnA, int columnB);
/**
* There may be more than one different intermediate results tables, so this functions returns the index of the
* table containing either of the 2 relations. If none are contained, the index -1 is returned. If the number
* of intermediate results tables is 0, then a new table is created and the index 0 is returned. If two relations
* are found on different intermediate results tables, then -2 is returned, meaning that two tables will need to
* be merged.
*/
int getIntermediateResultsIndex(IntermediateResultsList* inRes, int relationA, int relationB);
/**
* Returns 1 if the given relationID exists in the given IntermediateResults table. Returns 0 otherwise.
*/
int existsInIntermediateResults(IntermediateResults *inRes, int rel);
/**
* If the relations being joined have already been joined on another column, then there is no need to run the Radix
* algorithm. We simply need to traverse the intermediate results one by one and keep only those whose value in both
* joined columns is the same.
*/
IntermediateResults* addResultsSameIntermediateResultsSize(table** t, IntermediateResults* inRes, int* rels, int relationA, int columnA, int relationB, int columnB);
/**
* If only one of the two relations being joined exists in one intermediate results table, then a new table must be
* constructed, contaning one more column, the one for the new relation. Then each result from the radix algorithm is
* placed accordingly into the new IntermediateResults table.
*/
IntermediateResults* addResultsWithNewColumn(resultsWithNum* results, IntermediateResults* inRes, int relationA, int relationB);
/**
* If none of the two relations exists in any of the intermediate results tables, then a new must be created, that
* contains nothing but the two relations currently being joined.
*/
IntermediateResults* addResultToNewIntermediateResult(resultsWithNum *results, IntermediateResults *inRes, int relationA, int relationB);
/**
* If the 2 relations currently being joined are in different intermediate results tables, then those two tables need
* to merge into one, so all the relations are connected to each other.
*/
IntermediateResults* mergeIntermediateResults(IntermediateResultsList* inRes, table** t, int* rels, int relationA, int relationB, int columnA, int columnB);
/**
* Given a join query and the current list of intermediate results, returns:
* Category 0: No relation exists in any intermediate table
* Category 1: One relation exists in one intermediate table and the other exists in none
* Category 2: Both relations exist in the same intermediate table
* Category 3: Both relations exist in different intermediate tables
*/
int getQueryCategory(IntermediateResultsList* inRes, int relationA, int relationB);
/**
* Simple list creation - creates the intermediate results list.
*/
IntermediateResultsList* createList();
/**
* Given a specific index, returns the node of the list, corresponding to that index.
*/
IntermediateResults* getNodeFromList(IntermediateResultsList* list, int index);
/**
* Simple list insertion. Inserts a new node at the end of the list.
*/
IntermediateResultsList* addNodeToList(IntermediateResultsList* list, IntermediateResults* table);
/**
* Simple list node deletion. Deletes the node at position index.
*/
void deleteNodeFromList(IntermediateResultsList* list, int index);
/**
* Simple list deletion. Deletes the Intermediate results list.
*/
void deleteList(IntermediateResultsList** headaddr);
/**
* Creates and returns a simple intermediate results structure.
*/
IntermediateResults* createIntermediateResult();
/**
* Given an intermediate results lists, searches for the node that contains the relationA relation. If that node
* is found then its index is returned. Otherwise, returns -1.
*/
int getIntermediateResultsSingleIndex(IntermediateResultsList* inRes, int relationA);
/**
* Given the 2 relations of a join between relations of the same intermediate results table, returns the amount
* of rows that are the same, therefore the result of the join.
*/
int calculateSameJoinResultsAmount(relation* relA, relation* relB);
/**
* Prints all the contents of an intermediate results list after the actions have finished. Runs once per query.
*/
void printActionResults(table** t, IntermediateResultsList *inRes, Column_t *columns, int* rels);
/**
* Given the columns need to be printed for a query, creates and returns an intermediate results table, containing
* all the values of the intermediate results list and the table t. Decides whether to take the values from the
* list of the table, on whether the relation exists in the list.
*/
IntermediateResults *getIntermediateResultFromColumns(table** t, IntermediateResultsList *inRes, Column_t *columns, int* rels);
/**
* In case two not connected intermediate results tables need to be joined in order to print values from relations
* from both of them, then a cross product of the two is created.
*/
IntermediateResults *crossProductIntermediateResults(IntermediateResults *inResA, IntermediateResults *inResB);
/**
* If one relations does not exist in an intermediate results table, but need to be printed, then an intermediate
* results table needs to be created, containing simply the column of the table with the rowIDs as keys.
*/
IntermediateResults* createIntermediateResultFromTable(table* t, int relation);
/**
* Given an intermediate results table, returns the index of the relation 'relation' in the relationsID array and the
* keys one.
*/
int getColumnIntermediateResultsIndex(IntermediateResults* inRes, int relation);
#endif