[vc_empty_space][vc_empty_space]
Parallel execution of relational algebra operator under distributed database systems
a Dept. Informatics Engineering, Institute of Technology Bandung, Bandung, West-Java, 40132, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2002 IEEE.Parallel execution of relational algebra operators can be performed on single computer, multiprogramming or multitasking operating systems. In doing so, time response can be improved, compared to sequential execution, using concepts of: free operators, set of free operators, and degree of freedom of operators. Parallel execution of relational algebra operators introduced, using the concepts above, can be adapted to the distributed database system environment, where each free operator executed in one specific location/computer (relatively to the other free operator of the transaction). Consequently, improvement of performance depends on: the number of free operators of the transaction; the number of sets of free operators; degree of freedom of operators; and data location relatively to the location where the operator executed.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Concurrent computing,Parallel processing,Relational Database,Time factors,Tree data structures[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Algebra,Concurrent computing,Database systems,Distributed computing,Operating systems,Parallel processing,Relational databases,Terminology,Time factors,Tree data structures[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ITCC.2002.1000388[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]