서브메뉴
검색
자가 조직 탐색 트리 조사 방법론 = A Survey on Self-Organizing Search Trees
- 자료유형
- 기사
- ISSN
- 12269387
- 서명/저자
- 자가 조직 탐색 트리 조사 방법론 = A Survey on Self-Organizing Search Trees / 이혜자
- 발행사항
- 서울 : 용인송담대학, 1998.
- 형태사항
- pp. 199-208
- 초록/해제
- 요약 :Static data structures are easy to analyze and simple to implement. However, we use dynamic data structures more because of our computing environment. In the case of search trees, we know that OBST(Optimal Binary Search Tree) is the theoretically perfect optimal static one. Thus, there have been quite a lot of researches to find and prove a certain dynamic search tree being the optimal. This paper summarizes the result of various studies focused on a class of dynamic search trees that we call self-organizing search tree. Then we analyze the methods that the class of data structure uses and the splay tree which we find the best existing structure. Finally, we report a number of unproven conjectures which must be done if the structure is the optimal.
- 기타저자
- 이혜자
- 기타저자
- 송두헌
- 기본자료저록
- 용인송담대학 論文集 : 第1集 1998, 03
- 전자적 위치 및 접속
- 원문정보보기
- 모체레코드
- 모체정보확인
- Control Number
- yscl:20563
로그인 후 이용 가능합니다.