/**
* @author Dino Laktašić
* @brief Function to make union of the two tables. Union is implemented for working with multiple sets of data, i.e. duplicate
* tuples can be written in same table (union)
* @param srcTable1 name of the first table
* @param srcTable2 name of the second table
* @param dstTable name of the new table
* @return if success returns EXIT_SUCCESS, else returns EXIT_ERROR
*/
int AK_union(char *srcTable1, char *srcTable2, char *dstTable) {
AK_PRO;
table_addresses *src_addr1 = (table_addresses*) AK_get_table_addresses(srcTable1);
table_addresses *src_addr2 = (table_addresses*) AK_get_table_addresses(srcTable2);
int startAddress1 = src_addr1->address_from[0];
int startAddress2 = src_addr2->address_from[0];
if ((startAddress1 != 0) && (startAddress2 != 0)) {
register int i, j, k;
i = j = k = 0;
AK_mem_block *tbl1_temp_block = (AK_mem_block *) AK_get_block(startAddress1);
AK_mem_block *tbl2_temp_block = (AK_mem_block *) AK_get_block(startAddress2);
int num_att = AK_check_tables_scheme(tbl1_temp_block, tbl2_temp_block, "Union");
int address, type, size;
char data[MAX_VARCHAR_LENGTH];
//initialize new segment
AK_header *header = (AK_header *) AK_malloc(num_att * sizeof (AK_header));
memcpy(header, tbl1_temp_block->block->header, num_att * sizeof (AK_header));
AK_initialize_new_segment(dstTable, SEGMENT_TYPE_TABLE, header);
AK_free(header);
//AK_list *row_root = (AK_list *) AK_malloc(sizeof (AK_list));
struct list_node *row_root = (struct list_node *) AK_malloc(sizeof (struct list_node));
//writing first block or table to new segment
for (i = 0; src_addr1->address_from[i] != 0; i++) {
startAddress1 = src_addr1->address_from[i];
//BLOCK: for each block in table1 extent
for (j = startAddress1; j < src_addr1->address_to[i]; j++) {
tbl1_temp_block = (AK_mem_block *) AK_get_block(j); //read block from first table
//if there is data in the block
if (tbl1_temp_block->block->AK_free_space != 0) {
for (k = 0; k < DATA_BLOCK_SIZE; k++) {
if (tbl1_temp_block->block->tuple_dict[k].type == FREE_INT)
break;
address = tbl1_temp_block->block->tuple_dict[k].address;
size = tbl1_temp_block->block->tuple_dict[k].size;
type = tbl1_temp_block->block->tuple_dict[k].type;
memset(data, '\0', MAX_VARCHAR_LENGTH);
memcpy(data, tbl1_temp_block->block->data + address, size);
Ak_Insert_New_Element_For_Update(type, data, dstTable, tbl1_temp_block->block->header[k % num_att].att_name, row_root, 0);
if ((k + 1) % num_att == 0 && k != 0) {
Ak_insert_row(row_root);
Ak_DeleteAll_L3(&row_root);
}
}
}
}
}
//writing first block or table to new segment
for (i = 0; src_addr2->address_from[i] != 0; i++) {
startAddress2 = src_addr2->address_from[i];
//BLOCK: for each block in table2 extent
for (j = startAddress2; j < src_addr2->address_to[i]; j++) {
tbl2_temp_block = (AK_mem_block *) AK_get_block(j); //read block from second table
//if there is data in the block
if (tbl2_temp_block->block->AK_free_space != 0) {
for (k = 0; k < DATA_BLOCK_SIZE; k++) {
if (tbl2_temp_block->block->tuple_dict[k].type == FREE_INT)
break;
address = tbl2_temp_block->block->tuple_dict[k].address;
size = tbl2_temp_block->block->tuple_dict[k].size;
type = tbl2_temp_block->block->tuple_dict[k].type;
memset(data, '\0', MAX_VARCHAR_LENGTH);
memcpy(data, tbl2_temp_block->block->data + address, size);
Ak_Insert_New_Element_For_Update(type, data, dstTable, tbl2_temp_block->block->header[k % num_att].att_name, row_root, 0);
if ((k + 1) % num_att == 0) {
Ak_insert_row(row_root);
Ak_DeleteAll_L3(&row_root);
}
}
}
}
}
AK_free(src_addr1);
AK_free(src_addr2);
Ak_dbg_messg(LOW, REL_OP, "UNION_TEST_SUCCESS\n\n");
AK_EPI;
return EXIT_SUCCESS;
} else {
Ak_dbg_messg(LOW, REL_OP, "\nAK_union: Table/s doesn't exist!");
AK_free(src_addr1);
AK_free(src_addr2);
AK_EPI;
return EXIT_ERROR;
}
AK_EPI;
}
/**
* @author Dino Laktašić
* @brief Function that produces a difference of the two tables. Table addresses are get through names of tables.
* Specially start addresses are taken from them. They are used to allocate blocks for them. It is checked whether
the tables have same table schemas. If not, it returns EXIT_ERROR. New segment for result of difference operation is
initialized. Function compares every block in extent of the first table with every block in extent of second table. If there
is a difference between their rows, they are put in dstTable.
* @param srcTable1 name of the first table
* @param srcTable2 name of the second table
* @param dstTable name of the new table
* @return if success returns EXIT_SUCCESS, else returns EXIT_ERROR
*/
int AK_difference(char *srcTable1, char *srcTable2, char *dstTable) {
AK_PRO;
table_addresses *src_addr1 = (table_addresses*) AK_get_table_addresses(srcTable1);
table_addresses *src_addr2 = (table_addresses*) AK_get_table_addresses(srcTable2);
int startAddress1 = src_addr1->address_from[0];
int startAddress2 = src_addr2->address_from[0];
if ((startAddress1 != 0) && (startAddress2 != 0)) {
register int i, j, k, l, m, n, o;
i = j = k = l = 0;
AK_mem_block *tbl1_temp_block = (AK_mem_block *) AK_get_block(startAddress1);
AK_mem_block *tbl2_temp_block = (AK_mem_block *) AK_get_block(startAddress2);
int num_att = AK_check_tables_scheme(tbl1_temp_block, tbl2_temp_block, "Difference");
if (num_att == EXIT_ERROR) {
AK_EPI;
return EXIT_ERROR;
}
int address, type, size;
int different, num_rows, temp_int,summ;
different = num_rows = temp_int = summ = 0;
float temp_float = 0;
char data1[MAX_VARCHAR_LENGTH];
char data2[MAX_VARCHAR_LENGTH];
//initialize new segment
AK_header *header = (AK_header *) AK_malloc(num_att * sizeof (AK_header));
memcpy(header, tbl1_temp_block->block->header, num_att * sizeof (AK_header));
AK_initialize_new_segment(dstTable, SEGMENT_TYPE_TABLE, header);
AK_free(header);
struct list_node * row_root = (struct list_node *) AK_malloc(sizeof(struct list_node));
for (i = 0; src_addr1->address_from[i] != 0; i++) {
startAddress1 = src_addr1->address_from[i];
//BLOCK: for each block in table1 extent
for (j = startAddress1; j < src_addr1->address_to[i]; j++) {
tbl1_temp_block = (AK_mem_block *) AK_get_block(j); //read block from first table
//if there is data in the block
if (tbl1_temp_block->block->AK_free_space != 0) {
//TABLE2: for each extent in table2
for (k = 0; k < (src_addr2->address_from[k] != 0); k++) {
startAddress2 = src_addr2->address_from[k];
if (startAddress2 != 0) {
//BLOCK: for each block in table2 extent
for (l = startAddress2; l < src_addr2->address_to[k]; l++) {
tbl2_temp_block = (AK_mem_block *) AK_get_block(l);
//if there is data in the block
if (tbl2_temp_block->block->AK_free_space != 0) {
//TUPLE_DICTS: for each tuple_dict in the block
for (m = 0; m < DATA_BLOCK_SIZE; m += num_att) {
if (tbl1_temp_block->block->tuple_dict[m + 1].type == FREE_INT)
break;
//TUPLE_DICTS: for each tuple_dict in the block
for (n = 0; n < DATA_BLOCK_SIZE; n += num_att) {
if (tbl2_temp_block->block->tuple_dict[n + 1].type == FREE_INT)
break;
//for each element in row
for (o = 0; o < num_att; o++) {
address = tbl1_temp_block->block->tuple_dict[m + o].address;
size = tbl1_temp_block->block->tuple_dict[m + o].size;
type = tbl1_temp_block->block->tuple_dict[m + o].type;
switch (type) {
case TYPE_INT:
memcpy(&temp_int, &(tbl1_temp_block->block->data[address]), size);
sprintf(data1, "%d", temp_int);
break;
case TYPE_FLOAT:
memcpy(&temp_float, &(tbl1_temp_block->block->data[address]), size);
sprintf(data1, "%f", temp_float);
break;
case TYPE_VARCHAR:
default:
memset(data1, '\0', MAX_VARCHAR_LENGTH);
memcpy(data1, &(tbl1_temp_block->block->data[address]), size);
}
address = tbl2_temp_block->block->tuple_dict[n + o].address;
size = tbl2_temp_block->block->tuple_dict[n + o].size;
type = tbl2_temp_block->block->tuple_dict[n + o].type;
switch (type) {
case TYPE_INT:
memcpy(&temp_int, &(tbl2_temp_block->block->data[address]), size);
sprintf(data2, "%d", temp_int);
break;
case TYPE_FLOAT:
memcpy(&temp_float, &(tbl2_temp_block->block->data[address]), size);
sprintf(data2, "%f", temp_float);
break;
case TYPE_VARCHAR:
default:
memset(data2, '\0', MAX_VARCHAR_LENGTH);
memcpy(data2, &(tbl2_temp_block->block->data[address]), size);
}
//if they are the same
if(strcmp(data1,data2)==0){
different++;
}
if(different==(num_att-1)) summ=1;
}
//if same rows are found don't keep searching
if(summ==1)break;
}
//if there is a difference between tuple_dicts
if (summ == 0) {
Ak_DeleteAll_L3(&row_root);
for (o = 0; o < num_att; o++) {
address = tbl1_temp_block->block->tuple_dict[m + o].address;
size = tbl1_temp_block->block->tuple_dict[m + o].size;
type = tbl1_temp_block->block->tuple_dict[m + o].type;
memset(data1, '\0', MAX_VARCHAR_LENGTH);
memcpy(data1, tbl1_temp_block->block->data + address, size);
Ak_Insert_New_Element(type, data1, dstTable, tbl1_temp_block->block->header[o].att_name, row_root);
}
Ak_insert_row(row_root);
}
num_rows = different = summ = 0;
}
}
}
} else break;
}
}
}
}
AK_free(src_addr1);
AK_free(src_addr2);
Ak_DeleteAll_L3(&row_root);
AK_free(row_root);
Ak_dbg_messg(LOW, REL_OP, "DIFFERENCE_TEST_SUCCESS\n\n");
AK_EPI;
return EXIT_SUCCESS;
} else {
Ak_dbg_messg(LOW, REL_OP, "\nAK_difference: Table/s doesn't exist!");
AK_free(src_addr1);
AK_free(src_addr2);
AK_EPI;
return EXIT_ERROR;
}
AK_EPI;
}