/
main.c
executable file
·224 lines (220 loc) · 6.12 KB
/
main.c
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
218
219
220
221
222
223
224
/**
* --*-- (◐‿◐) o(︶︿︶)o (◑‿◑) --*--
*
* completed by dongchangzhang
* At Harbin Institute of Technology
*/
#include "extmem.h"
#include "operation.h"
#include "utils.h"
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define log
char *rrel = "R", *rcol1 = "A", *rcol2 = "B";
char *srel = "S", *scol1 = "C", *scol2 = "D";
void generate_data()
{
int r, s;
printf("Try to create data for R...\n");
r = create_data(rrel, rcol1, 1, 40, rcol2, 1, 1000, 2);
printf("Try to create data for S...\n");
s = create_data(srel, scol1, 20, 60, scol2, 1, 1000, 4);
printf("Done!\n");
}
void do_read()
{
int addr[2];
get_start_addr_from_file(rrel, rcol1, addr);
read_data(addr[0]);
get_start_addr_from_file(srel, scol1, addr);
read_data(addr[0]);
}
void do_merge()
{
int addr1, addr2, r1[2], r2[2];
get_start_addr_from_file(rrel, rcol1, r1);
get_start_addr_from_file(srel, scol1, r2);
addr1 = n_merge_sort(r1[0], 0);
addr2 = n_merge_sort(r2[0], 0);
read_data(addr1);
read_data(addr2);
}
void l_search()
{
int r, s, addr;
printf("Liner search for R.A = 40 or S.C = 60\n");
r = liner_search(rrel, rcol1, EQ, 40);
s = liner_search(srel, scol1, EQ, 60);
addr = link_addr(r, s);
printf("Result is :\n");
read_data(addr);
printf("Done!\n");
}
void b_search()
{
int b1, b2, addr;
printf("Binary search for R.A = 40 or S.C = 60\n");
b1 = binary_search(rrel, rcol1, EQ, 40);
b2 = binary_search(srel, scol1, EQ, 60);
addr = link_addr(b1, b2);
printf("Result is: \n");
read_data(addr);
printf("Done!\n");
}
void index_search()
{
int what, addr;
char buf[16];
printf("Input which Table You Want To Search(S/R)?\n");
scanf("%s", buf);
printf("What You Want To Search?\n");
scanf("%d", &what);
addr = search_hash_index(buf, what);
if (addr == -1) {
printf("Index FIle For This Key Not Exists\n");
return;
}
read_data(addr);
}
void p_action()
{
int addr;
printf("Project for R.A\n");
addr = project(rrel, rcol1);
printf("Result is: \n");
read_data(addr);
printf("Done!\n");
}
void join_action()
{
int addr, r1[2], r2[2];
get_start_addr_from_file(rrel, rcol1, r1);
get_start_addr_from_file(srel, scol1, r2);
addr = join(r1[0], r2[0]);
read_data(addr);
}
void intersect_action()
{
int addr, r1[2], r2[2];
get_start_addr_from_file(rrel, rcol1, r1);
get_start_addr_from_file(srel, scol1, r2);
addr = intersect(r1[0], r2[0]);
read_data(addr);
}
void except_action()
{
int addr, r1[2], r2[2];
get_start_addr_from_file(rrel, rcol1, r1);
get_start_addr_from_file(srel, scol1, r2);
addr = except(r1[0], r2[0]);
read_data(addr);
}
void nest_connection()
{
int addr, r1[2], r2[2];
get_start_addr_from_file(rrel, rcol1, r1);
get_start_addr_from_file(srel, scol1, r2);
addr = nested_loop_join(r1[0], r2[0], 0, 0);
read_data(addr);
}
void merge_connection()
{
int addr, r1[2], r2[2];
get_start_addr_from_file(rrel, rcol1, r1);
get_start_addr_from_file(srel, scol1, r2);
addr = sort_merge_join(r1[0], r2[0], 0, 0);
read_data(addr);
}
void hash_connection()
{
hash_join(rrel, srel);
}
void print_menu()
{
printf("|------------------------ Menu ------------------------|\n");
printf("| 1. Create Data |\n");
printf("| 2. Look Data |\n");
printf("| 3. Merge Sort |\n");
printf("| ---- Search Option ---- |\n");
printf("| 4. Liner Search |\n");
printf("| 5. Binary Search |\n");
printf("| 6. Index |\n");
printf("| ---- Project Option ---- |\n");
printf("| 7. Project |\n");
printf("| ---- Set Option ---- |\n");
printf("| 8. Union |\n");
printf("| 9. Intersect |\n");
printf("| 10. Except |\n");
printf("| ---- Connection ---- |\n");
printf("| 11. Nested Loop Join |\n");
printf("| 12. Sort Merge Join |\n");
printf("| 13. Hash Join |\n");
printf("| --------------- |\n");
printf("| 0. END |\n");
printf("|------------------------------------------------------|\n");
printf("Input Your Choice Now: ");
}
int main(int argc, char** argv)
{
init();
int option, addr;
int finished = 0;
while (!finished) {
print_menu();
if (scanf("%d", &option) != 1) {
while ((getchar()) != '\n') {
printf("Input Error Try Again!\n");
scanf("%d", &option);
}
}
switch (option) {
case 1:
generate_data();
break;
case 2:
do_read();
break;
case 3:
// n_merge_sort();
do_merge();
break;
case 4:
l_search();
break;
case 5:
b_search();
break;
case 6:
index_search();
break;
case 7:
p_action();
break;
case 8:
join_action();
break;
case 9:
intersect_action();
break;
case 10:
except_action();
break;
case 11:
nest_connection();
break;
case 12:
merge_connection();
break;
case 13:
hash_connection();
break;
case 0:
finished = 1;
break;
default:
printf("Bad Option!\n");
}
}
return 0;
}