2011 Annual IEEE India Conference 2011
DOI: 10.1109/indcon.2011.6139336
|View full text |Cite
|
Sign up to set email alerts
|

Genetic optimization for the join ordering problem of database queries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 8 publications
0
1
0
1
Order By: Relevance
“…为了降低时间复杂度, 研究人员进一步提出了贪心算法、随机算法等. 贪心算法的中心思想是在 树的每一级保持元组数目尽可能少的中间关系, 而随机算法包括遗传算法 [10] 、QuickPick [5] 等. 它们 随机地产生连接决策, 并依据代价进行更新.…”
Section: 启发式方法unclassified
“…为了降低时间复杂度, 研究人员进一步提出了贪心算法、随机算法等. 贪心算法的中心思想是在 树的每一级保持元组数目尽可能少的中间关系, 而随机算法包括遗传算法 [10] 、QuickPick [5] 等. 它们 随机地产生连接决策, 并依据代价进行更新.…”
Section: 启发式方法unclassified
“…Chande et al, [10] concentrated on join ordering issues in relational database and employed Genetic Algorithm to minimize the difficulty of competent choosing of join ordering for creating an optimum strategy by an optimizer. The queries employed for genetic query optimizer (GQO) are implemented in diverse atmosphere as to match their accuracy.…”
Section: Literature Surveymentioning
confidence: 99%