Этот материал находится в платной подписке. Оформи премиум подписку и смотри Database Management Final Part (5): Indexing,B Trees,B+ Trees, а также все другие курсы, прямо сейчас!
Премиум
  • Урок 1. 00:11:05
    Introduction
  • Урок 2. 00:18:21
    Blocking Factor, Ordered File Organization vs Unordered File Organization
  • Урок 3. 00:13:57
    Example on Spanned vs Unspanned Strategy
  • Урок 4. 00:09:05
    Ordered File Organization vs Unordered File Organization
  • Урок 5. 00:18:38
    Advantage of Ordered File Organization : Binary Search
  • Урок 6. 00:11:32
    How Binary Search Works in an Ordered File
  • Урок 7. 00:18:42
    Time Complexity of Binary Search
  • Урок 8. 00:13:07
    Advantage of Unordered File Organization
  • Урок 9. 00:30:40
    What is Indexing in DBMS
  • Урок 10. 00:02:12
    Dense Index vs Sparse Index
  • Урок 11. 00:07:09
    Classification of Indexing Techniques
  • Урок 12. 00:26:20
    Primary Index Explained
  • Урок 13. 00:19:31
    Problem on Primary Index
  • Урок 14. 00:12:59
    Disadvantage of Primary Indexing / Ordered File Organization
  • Урок 15. 00:25:36
    Clustering Indexing Explained
  • Урок 16. 00:15:39
    How Clustering Indexes are implemented
  • Урок 17. 00:19:15
    Secondary Key index
  • Урок 18. 00:23:32
    Secondary Non Key Index
  • Урок 19. 00:11:17
    Problem on Secondary Index
  • Урок 20. 00:40:51
    Multilevel Indexing Explained
  • Урок 21. 00:18:14
    Time Complexity of Multilevel Indexing
  • Урок 22. 00:23:15
    Disadvantages of Static Multilevel Indexes
  • Урок 23. 00:12:51
    Problem on ISAM
  • Урок 24. 00:08:01
    Problem
  • Урок 25. 00:36:40
    Introduction to B Trees
  • Урок 26. 00:07:54
    Problem 1 on B Trees
  • Урок 27. 00:02:04
    Problem 2 on B Trees
  • Урок 28. 00:07:01
    Problem 3 on B Trees
  • Урок 29. 00:32:56
    How B Trees are constructed by Insertion of Index Entries
  • Урок 30. 00:31:26
    Insertion in B Trees with example
  • Урок 31. 00:11:28
    Insertion in B Trees example 2
  • Урок 32. 00:16:02
    Finding Minimum Height of B Trees
  • Урок 33. 00:13:01
    Finding Maximum Height of B Trees
  • Урок 34. 00:29:33
    Deletion in B Trees explained with example (leaf nodes)
  • Урок 35. 00:22:09
    Deletion in B Trees explained with example (leaf nodes) continued
  • Урок 36. 00:33:32
    Deletion in Non Leaf Nodes of B Trees
  • Урок 37. 00:11:49
    Why Overflow cannot happen during Deletion
  • Урок 38. 00:10:13
    Why Duplicate Index Entries cannot exist in B Trees
  • Урок 39. 00:06:23
    Time Taken for Deletion in B Trees
  • Урок 40. 00:16:48
    Introduction to B+ Trees
  • Урок 41. 00:03:45
    Order of Leaf Node vs Order of Non Leaf Node
  • Урок 42. 00:08:34
    Insertion in B+ Trees with Example
  • Урок 43. 00:09:52
    Insertion in B+ Trees with Example Continued
  • Урок 44. 00:03:30
    Important Point to note in B+ Tree
  • Урок 45. 00:09:44
    One Advantage of B+ Trees Over B Trees
  • Урок 46. 00:05:52
    Problem 1 in B+ Trees
  • Урок 47. 00:03:41
    Problem 2 in B+ Trees
  • Урок 48. 00:06:24
    Another Important Terminology followed everywhere
  • Урок 49. 00:12:15
    Insertion in B Trees example 3
  • Урок 50. 00:02:16
    Recollect this Important Point
  • Урок 51. 00:16:40
    Deletion in B+ Trees Explained with Example
  • Урок 52. 00:13:44
    Deletion in B+ Trees with Example Continued
  • Урок 53. 00:10:21
    Example 2 on Deletion in B+ Trees
  • Урок 54. 00:06:16
    Example 3 on Deletion in B+ Trees
  • Урок 55. 00:06:24
    Example 4 on Deletion in B+ Trees
  • Урок 56. 00:15:00
    Minimum Height of B+ Trees Possible
  • Урок 57. 00:10:57
    Maximum Height of B+ Trees
  • Урок 58. 00:05:15
    Time Taken for Insertion, Search and Deletion in B+ Trees
  • Урок 59. 00:17:24
    Advantages of B+ Tree over B Tree