반응형
Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 |
Tags
- getopts
- 약어
- Programming
- 구조와 원리
- bash
- 전처리기
- 한빛미디어
- Symbol
- Pointer
- Golang
- newSQL
- UNIX Internals
- OS 커널
- Windows via c/c++
- SQLite
- 커널
- DBMS 개발
- kernel
- 포인터
- go
- DBMS
- 함수포인터
- UNIX
- TiKV
- 포인터변수
- 긴옵션
- FreeBSD
- Preprocessor
- TiDB
- 컴퓨터 강좌
Archives
- Today
- Total
목록2018/02 (1)
sonumb
Bottom-up B+ Tree Construction Algorithm
1. The records in the sorted input file are arranged into buckets (leaf nodes) which are 70% full. 2. Create the first node of the parent-of-leaf level in memory. Read in the first sorted leaf. Put the address of this leaf in the parent in memory. 3. Read in another sorted leaf. Put its lowest key value in the node at the lowest level which is not yet 70% full. If all nodes in the index are 70% ..
개발자 이야기/Algorithms
2018. 2. 12. 11:31