• Like
Algorithm Introduction #18 B-Tree
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

Algorithm Introduction #18 B-Tree

  • 2,449 views
Published

はてなで行われたアルゴリズム・イントロダクション勉強会第18章B-Treeの資料です.

はてなで行われたアルゴリズム・イントロダクション勉強会第18章B-Treeの資料です.

Published in Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
No Downloads

Views

Total Views
2,449
On SlideShare
0
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
29
Comments
0
Likes
4

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide




































































Transcript

  • 1. B-Tree id:ninjinkun
  • 2. B- • Multiway Balanced Tree ( ) Key Feature • • Application • DB 2
  • 3. B- 3
  • 4. • HDD 5,400-15,000[RPM] • 7300RPM 1 8.33[ms] • RAM 0.00001 [ms] HDD 3~9 [ms] SSD 0.1 [ms] 4
  • 5. • • (211~214 ) • • • CPU • 5
  • 6. B- • • • 6
  • 7. B- 7
  • 8. B- 1. x n[x] a. x n[x] b. c. x TRUE FALSE leaf[x] 8
  • 9. B- 2. x n[x] + 1 ci 9
  • 10. B- 3. N[x] key[x] c[x] k 10
  • 11. B- 4. h 11
  • 12. B- 5. 1 B- t >2 a. t-1 t b. 2t - 1 1 2t 12
  • 13. • • n >1 t >2 B- h T 13
  • 14. • 1 t-1 2th-1 logt 14
  • 15. B- • 2 • O(lg n) • 2 lg t 15
  • 16. B- • B-TREE-SEARCH, B-TREE-CREATE, B-TREE- INSERT • • DISK-READ DISK-WRITE • DISK- READ 16
  • 17. B- 3 5 9 12 17
  • 18. B- 3 5 9 12 17
  • 19. B- 3 5 9 12 17
  • 20. B- 3 5 9 12 10 11 17
  • 21. B- 3 5 9 12 10 11 17
  • 22. B- • B- h, n O(h) = O(logtn) • n[x] < 2t O(t) • CPU O(th) = O(tlogtn) 18
  • 23. B- 19
  • 24. B- • • • • y • http://slady.net/java/bt/view.php?w=800&h=600 20
  • 25. B- …NW… …NW… …NW… 21
  • 26. B- …NW… 22
  • 27. B- 23
  • 28. B- x X 24
  • 29. B- 25
  • 30. B- 1. x 2. x a. yt 26
  • 31. B- a. y k a. b. k z t b. z k 27
  • 32. B- b. c. 3. a. b. 28
  • 33. B+-Tree • • • 29
  • 34. B-Tree • B#-Tree • Search • Insert • B*-Tree • , 3 30