외부메모리 자료구조

한국과학기술원
Tao, Yufei

페이스북 트위터 카카오톡 네이버밴드 링크복사

주제분류

공학 >컴퓨터ㆍ통신 >컴퓨터과학
강의학기

2011년 2학기

조회수

6,268

본 과정에서는, 공간할당 및 질의시간이 적절한 외부메모리(EM) 구조에 관해 논한다. B-tree 인덱스 구조 외, stabbing query (1-d intervals, 2-d orthogonal range reporting, 2-d orthogonal range count/max)를 기본적으로 다루며, 이 외 persistency, boot-strapping, fractional cascading, compression, weight-balancing, logarithmic method 등 I/O면에서 효율적인 구조 개발을 위한 기본적 테크닉을 다룬다

수강안내 및 수강신청
※ 수강확인증 발급을 위해서는 수강신청이 필요합니다

Distribution Sort

차시별 강의

1.	Distribution Sort	This lecture discusses an algorithm called distribution sort for performing sorting in external memory.
2.	Introduction to Computation in External Memory	This is a talk in the CS-WebST colloquium, and discusses fundamental results in the external memory computation model.
3.	Plane Sweep	This lecture discusses an internal memory algorithm for solving the orthogonal intersection problem. This algorithm exemplifies the plane sweep technique.
4.	Divide and Conquer	The lecture discusses another internal memory algorithm for solving the orthogonal intersection problem using the divide-and-conquer technique.
5.	Distribution Sweep I	The lecture discusses an external memory algorithm for solving the orthogonal intersection problem. This algorithm exemplifies the distribution sweep technique.
6.	Distribution Sweep II	This lecture discusses algorithms for solving the skyline problem (a.k.a. the maxima problem). This algorithm also illustrates the use of distribution sweep, as well as another technique called order alternation. At the end, the lecture also starts the discussion on B-trees.
7.	B-tree	This lecture discusses the query and algorithms of the B-tree.
8.	Weight-balanced B-tree I	This lecture discusses the weight-balanced B-tree in detail.
9.	Weight-balanced B-tree II	The first part of the lecture finishes the introduction to the weight-balanced B-tree. The second part starts the discussion on another structure called the persistent B-tree.
10.	Persistent B-tree	This lecture finishes the discussion on the persistent B-tree.
11.	External Interval Tree I	The lecture discusses the external interval tree, designed to answer stabbing queries efficiently.
12.	External Interval Tree II	This lecture continues the discussion of the external interval tree.
13.	External interval tree III	This lecture covers the algorithms of the external interval tree.
14.	External Interval Tree IV	This lecture continues the discussion on updating external interval trees.
15.	External Interval Tree V	This lecture finishes the discussion on external interval trees.
16.	Filtering Search	This lecture discusses an internal memory structure for answering 3-sided range queries. This structure exemplifies the technique of filtering search.
17.	External Priority Search Tree I	This lecture discusses how to make the structure of the previous lecture efficient in external memory.
18.	External Priority Search Tree II	The first part of the lecture finishes the discussion on the algorithms of the external priority search tree. The second part starts the introduction to structures for answering (4-sided) range queries.
19.	External range search tree	This lecture discusses the external range search tree in detail, which answers a query in logarithmic time by using the minimum space.
20.	Kd-tree	This lecture discusses the kd-tree, which is an optimal non-replicating structure for answering range queries.
21.	O-tree I	This lecture starts the discussion on another non-replicating structure, called O-tree, for answering range queries.
22.	O-tree II	This lecture continues on the O-tree, focusing on its algorithms.
23.	Problem Solving I	This lecture discusses the problems in exercise lists 1-3.
24.	Problem Solving II	This lecture discusses the problems in exercise lists 4-5.