대상은
[[트리,tree]]
[[그래프,graph]]
[[문자열,string]]
...추ㄱr

Cmp
[[traversal]] - 아마 [[순회,traversal]]로?

이하 모두 search_problem 의 해결책? 인 search_algorithm 얘기... 아닌게 있다면 분리? 대상은 search_space
 https://en.wikipedia.org/wiki/Search_algorithm


Sub:

[[선형탐색,linear_search]]
[[순차탐색,sequential_search]]
{
WpSimple:Linear_search
 = https://simple.wikipedia.org/wiki/Linear_search
}

[[이진탐색,binary_search]]
[[삼진탐색,ternary_search]]?

맹목적 탐색 blind_search
{
https://ko.wikipedia.org/wiki/맹목적_탐색
 "맹목적 탐색(blind search)이란, 이미 정해진 순서에 따라 상태 공간 그래프를 점차 형성해 가면서 해를 탐색하는 방법을 말한다." - ''정보/data에 따라 순서가 바뀌지 않는?''

WtEn:blind_search x [[Date(2023-08-30T14:20:10)]]
blind search
"blind search"
Ggl:"blind search"
Bing:"blind search"
}

DFS [[DFS]] =,DFS .
{
https://ko.wikipedia.org/wiki/깊이_우선_탐색
https://simple.wikipedia.org/wiki/Depth-first_search
https://en.wikipedia.org/wiki/Depth-first_search

맹목적탐색방법의 하나
}

BFS [[BFS]] =,BFS .
{
https://ko.wikipedia.org/wiki/너비_우선_탐색
https://simple.wikipedia.org/wiki/Breadth-first_search
https://en.wikipedia.org/wiki/Breadth-first_search
}

iterative deepening DFS
iterative-deepening
iterative_deepening
{
[[WpKo:반복적_깊이심화_탐색]]
 = https://ko.wikipedia.org/wiki/반복적_깊이심화_탐색
[[WpEn:Iterative_deepening_depth-first_search]]
 = https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search
 "iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS)"
}

트리탐색 tree_search
=,tree_search .
{
[[트리,tree]] [[탐색,search]]

game_tree_search =,game_tree_search .
{
game tree search
게임트리탐색

... Google:game.tree.search
[[게임트리,game_tree]] [[탐색,search]] [[트리탐색,tree_search]]
}// game tree search

Monte_Carlo_tree_search (MCTS)
{
Monte Carlo tree search
MCTS
[[Monte_Carlo]] [[탐색,search]] [[트리탐색,tree_search]]
... Google:Monte.Carlo.tree.search
}//Monte Carlo tree search

}

문자열탐색 string_search =,string_search . string_search
{
string search
문자열탐색
[[문자열,string]]
[[탐색,search]]

... Google:string.search
}

[[탐색트리,search_tree]] =탐색트리,search_tree =,search_tree .
{
search tree
탐색트리
서치트리

Srch:search_tree

WtEn:search_tree
https://ja.wikipedia.org/wiki/探索木
 '탐색목'
https://en.wikipedia.org/wiki/Search_tree

Sub:

[[이진탐색트리,binary_search_tree]] (BST)
=이진탐색트리,binary_search_tree =,binary_search_tree ==,BST .
Srch:binary_search_tree
{

MKL [[이진탐색,binary_search]]

균형을 유지하도록 한 [[AVL_tree]] { AVL트리    Srch:AVL_tree }

... Google:이진탐색트리 Naver:이진탐색트리 Google:binary.search.tree

Up: [[이진트리,binary_tree]] [[탐색트리,search_tree]]
}

[[ternary_search_tree]] =,ternary_search_tree . ternary_search_tree
{
ternary search tree

WpEn:Ternary_search_tree
 = https://en.wikipedia.org/wiki/Ternary_search_tree

Up: 삼진트리? ternary_tree 
... Google:ternary.search.tree
}

Ndict:"search tree"
Ggl:"search tree"
"search tree"
}

search_algorithm - [[알고리듬,algorithm]]

[[brute-force_search]] =,brute-force_search . brute-force_search
{
https://en.wikipedia.org/wiki/Brute-force_search
}

[[search_game]] - [[게임,game]]

'''탐색,search''' [[자료구조,data_structure]]:
[[search_data_structure]] =,search_data_structure . search_data_structure
{
'''search data structure'''
[[WpEn:Search_data_structure]] = https://en.wikipedia.org/wiki/Search_data_structure
Ggl:"search data structure"
Naver:"search data structure"
}

= 검색 =
Up: [[서치,search]]
같은영단어: [[검색,search]]
{
search의 pagename: 대상이 db/internet/...일때는 '''검색''', 대상이 ds/ast/.. e.g. tree/string...일 때는 '''탐색'''을 쓰면 어떨지.
둘 다 영어로 search이지만

전자는 key를 가지고 search_space?(ex. [[결정트리,decision_tree]])를 traverse. // traversal
후자는 submit을 해서 결과([[결과,result]] > 검색결과 search_result 를 retrieve // retrieval

전자는 크기가 비교적 작고, 명확한 구조를 가졌으며 명확한 접근이 가능하고, 
후자는 대상이 대체로: 크고, WpEn:Unstructured_data 인 경우가 많고, NLP를 동원해야 할 경우도 있고, .. (del ok)

Sub:
[[검색엔진,search_engine]]

단어
submit n. submission

Topics:
retrieval
 https://en.wikipedia.org/wiki/Image_retrieval

Tools/SWs:
Elasticsearch
{
'''Elasticsearch'''

Elasticsearch
엘라스틱서치 ? 일래스틱서치 ?

WpKo:일래스틱서치

} // Elasticsearch Ggl:Elasticsearch Ndict:Elasticsearch 

https://ko.wikipedia.org/wiki/데스크톱_검색
https://en.wikipedia.org/wiki/Desktop_search
}