2021
DOI: 10.1007/s10586-021-03451-9
|View full text |Cite
|
Sign up to set email alerts
|

Join queries optimization in the distributed databases using a hybrid multi-objective algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 47 publications
0
1
0
Order By: Relevance
“…The proposed mechanism has a group of d databases interrelated with a fast network in the CS-GA. We should consider the communication duration between two dependent queries when allocated to diverse databases. 37 We have discussed the cloud database route 38,39 scheduling problem using a linked graph to network G = (D, E), where D represents databases, and E represents dependencies among the databases, as shown in Figure 1. We have labeled the graph's edges with the amount of average communication time.…”
Section: Problem Statementmentioning
confidence: 99%
“…The proposed mechanism has a group of d databases interrelated with a fast network in the CS-GA. We should consider the communication duration between two dependent queries when allocated to diverse databases. 37 We have discussed the cloud database route 38,39 scheduling problem using a linked graph to network G = (D, E), where D represents databases, and E represents dependencies among the databases, as shown in Figure 1. We have labeled the graph's edges with the amount of average communication time.…”
Section: Problem Statementmentioning
confidence: 99%