Это пробный урок. Оформите подписку, чтобы получить доступ ко всем материалам курса. Премиум

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