2016 International Conference on Computer Communication and Informatics (ICCCI) 2016
DOI: 10.1109/iccci.2016.7479934
|View full text |Cite
|
Sign up to set email alerts
|

Query optimization using clustering and Genetic Algorithm for Distributed Databases

Abstract: Query Optimization is principally a multifaceted exploration job that searches for best plan amongst the semantically equal plans that are obtained from any given query. The execution of any processing datasets essentially depends on the capability of query optimization procedure to acquire competent query processing approaches. A Distributed Database System (DDS) is a group of autonomous cooperating integrated procedure. Query at a specified place may necessitate information from distant places in a Distribut… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…With the proliferation of WSNs and their uses, the number of malicious intrusions [33]and security risks that threaten their normal operations has also expanded considerably. Deep learning (DL) based methods for network intrusion detection (NID) have been the subject of substantial research and development.…”
Section: Literature Surveymentioning
confidence: 99%
“…With the proliferation of WSNs and their uses, the number of malicious intrusions [33]and security risks that threaten their normal operations has also expanded considerably. Deep learning (DL) based methods for network intrusion detection (NID) have been the subject of substantial research and development.…”
Section: Literature Surveymentioning
confidence: 99%
“…50 The genetic operator in the proposed method is presented in two phases, including employed bee and onlooker bee. The chromosome (individuals) and the mutation process require the selection method and the best fitness function to reduce the time and processor cost.…”
Section: Genetic Algorithm Operatorsmentioning
confidence: 99%
“…The sites of relations, the probability of crossover, the probability of mutation and the pre-specified number of generations are taken as input, and the top-K query plans are taken as the output. 50 The genetic operator in the proposed method is presented in two phases, including employed bee and onlooker bee. The genetic operators are selection, crossover, and mutation, which are described as the following.…”
Section: Genetic Algorithm Operatorsmentioning
confidence: 99%