B-Tree Tutorial - An Introduction to B-Trees

Поделиться
HTML-код
  • Опубликовано: 22 июл 2024
  • Learn more advanced front-end and full-stack development at: www.fullstackacademy.com
    In this tutorial, Joshua Maas-Howard introduces the topic of B-Trees. You'll learn how B-Trees are structured, what their benefits are, and when you should think about using them.
  • НаукаНаука

Комментарии • 164

  • @jsf17
    @jsf17 6 лет назад +215

    For god's sake how hard is it to just explain it as simple as that! Thanks a lot from Germany!

    • @ohdude6643
      @ohdude6643 4 года назад +10

      Because some professors need to justify a given number of hours.

    • @p3chv0gel22
      @p3chv0gel22 4 года назад +8

      Ich fühle deinen Schmerz, Bruder :D

    • @jhindeag
      @jhindeag 3 года назад +1

      ich hab bald auch eine Klausur haha

    • @PatxSun
      @PatxSun 3 месяца назад +1

      6 Jahre später, Danke wieder von Deutschland🥲😂

    • @jsf17
      @jsf17 3 месяца назад

      @@PatxSun viel Erfolg 😂💪🏼

  • @konamihatchibori
    @konamihatchibori 6 лет назад +35

    Excellent explanation, no complicated jargon, elegant presentation. Thank you so much.

  • @NikkieBiteMe
    @NikkieBiteMe 6 лет назад +27

    Everything about B-Trees is crystal clear now.
    Thank you for this amazing video!!!

  • @MrMonsterrally
    @MrMonsterrally 5 лет назад +484

    When you go to youtube to teach you what your college professor was supposed to

    • @mati1979b
      @mati1979b 5 лет назад +7

      there is simply too much material to cover....

    • @wahabfiles6260
      @wahabfiles6260 5 лет назад +6

      Stop bitching!

    • @natanielkauppi2566
      @natanielkauppi2566 4 года назад +8

      my professor doesn't give any visual examples. I crave for those.

    • @ybbetter9948
      @ybbetter9948 3 года назад +1

      yeah and your college professor only covers topics related to his work...

    • @philippebaillargeon5204
      @philippebaillargeon5204 3 года назад +1

      Everytime.

  • @teodorstoev2610
    @teodorstoev2610 7 лет назад +110

    Finally a really good explanation! Thank you! Your video needs more views!

  • @gobbledee55
    @gobbledee55 5 лет назад +1

    Excellent explanation! Not too simple, not too complicated. Best B-Tree explanation I've seen so far.

  • @ogropor
    @ogropor 6 лет назад +7

    i watched all other videos, i got nothing, i was hopeless.thanks to this man and this video FIINALLY I UNDERSTAND....the animation site is perfect to understand and demonstrate too

  • @hopefulhyena3400
    @hopefulhyena3400 Год назад +1

    This is genuinely one of the best and most helpful coding explanation videos I've ever seen.

  • @Fox66du76
    @Fox66du76 5 лет назад +1

    Very clear, appreciated the consistency of the presentation and the little animation to visualize how B-trees work !

  • @rachitahuja6084
    @rachitahuja6084 6 лет назад +2

    Thank you so much man , very simple , smooth , useful and helpful.
    Please keep uploading more presentations/videos !

  • @marvinkamande93
    @marvinkamande93 5 лет назад +1

    This video has saved a life today. Bless him.

  • @esmailiyou
    @esmailiyou 6 лет назад +3

    Yeah, searched a long time on RUclips to find this video. Thanks a lot! :)

  • @paulhendrix8599
    @paulhendrix8599 5 лет назад +1

    Great introduction with a great explanation of why they're useful!

  • @erickcedillo6470
    @erickcedillo6470 Год назад

    This is by far the best explanation for B-Trees out there, thank you

  • @chrispitterle8831
    @chrispitterle8831 3 года назад

    I keep coming back to this video to help me tutor my students. Thank you!

  • @laurenvelez9812
    @laurenvelez9812 4 года назад +2

    Thanks for this amazing video! Helped clear up what B-trees do!

  • @yevheniishudrenko3898
    @yevheniishudrenko3898 5 лет назад +1

    Beautifully structured explanation, my gratitude

  • @BatehamRadio
    @BatehamRadio 5 лет назад

    Wow great job with the presentation! You were able to explain this while my professor was not!

  • @williamwright2583
    @williamwright2583 6 лет назад +101

    This was a memorable presentation, simple and elegant.
    Can I have you as a professor?

    • @90sokrates
      @90sokrates 6 лет назад +3

      Yeah I bet you can for like 300k+ a year :D :D

  • @yifengchen9880
    @yifengchen9880 Год назад

    The animation of inserting value is fantastic.

  • @hao-tingliang7037
    @hao-tingliang7037 5 лет назад

    Pretty nice! This video helps me a lot. Thank you!

  • @GBGOLC
    @GBGOLC 6 лет назад +1

    Simple clear and concise.

  • @zoso25
    @zoso25 3 года назад

    This is very similar to Prof. Sedgwick's lectures but with an extra tidbit of their utility. Thank you!

  • @night4wl959
    @night4wl959 3 года назад +2

    Excellent teaching skills, thanks!

  • @vivekdalal8629
    @vivekdalal8629 4 года назад +1

    Really well explained! Thank you!

  • @mohammedghu.3792
    @mohammedghu.3792 5 лет назад

    gorgeous explanation , thank you .

  • @uzairiltifat9534
    @uzairiltifat9534 4 года назад +1

    It's a great demonstration thanks for sharing it.

  • @JP-td8gt
    @JP-td8gt 6 лет назад

    Bravo! 🙌 made perfect sense to me.

  • @vaishnaviganseh2884
    @vaishnaviganseh2884 5 лет назад

    this video was such a saviour

  • @heidisun7074
    @heidisun7074 4 года назад

    wow this demo is amazing! thank you!

  • @jonnysanty5028
    @jonnysanty5028 4 года назад

    I'm glad I stumbled across this video before I got sucked into other chaotic explanations.

  • @ishrak1684
    @ishrak1684 6 лет назад

    Thank you so much.you made my day!

  • @bokistotel
    @bokistotel 11 дней назад

    AMAZING explanation!!!!!

  • @benc7152
    @benc7152 5 лет назад

    this video is freaking excellent.

  • @danielk2122
    @danielk2122 6 лет назад

    Very good explanation!

  • @jianhuang0
    @jianhuang0 5 лет назад

    I am looking for the complicated part delete from b-tree

  • @fuahuahuatime5196
    @fuahuahuatime5196 6 лет назад

    Really great explanation.

  • @basheeral-momani2032
    @basheeral-momani2032 5 лет назад

    thanks a lot for this awesome tutorial

  • @TheMeMo1999
    @TheMeMo1999 4 года назад

    thank you this was very helpful

  • @pixelpaxal
    @pixelpaxal 5 лет назад

    Nice demo and clear explanation

  • @Kmac112
    @Kmac112 5 лет назад

    man, this guy is really good.

  • @mohammadreza.beygifard
    @mohammadreza.beygifard 2 года назад

    Thanks for the video!

  • @heavyraindrops4750
    @heavyraindrops4750 5 лет назад +1

    Do you have a video on deleting an item from a B-Tree?

  • @ky5069
    @ky5069 4 года назад

    Really terse and awesome explanation, thank you

  • @motorheadbanger90
    @motorheadbanger90 5 лет назад

    I love the demos but just two levels....i need to see it in more complex examples but since this was an intro i guess the trivial ones are necessary

  • @chris.w391
    @chris.w391 3 года назад

    Good explanation, thanks!

  • @juhairahamed5342
    @juhairahamed5342 5 месяцев назад

    Thanks for uploading

  • @joaquinibanez6537
    @joaquinibanez6537 4 года назад

    What are the awesome facts in this video? I understood every word he said about this topic and i don't undertand english completely yet hahaha. He is really incredible teaching about his field.

  • @diegocolli86
    @diegocolli86 3 года назад

    Where can I find the url for the site that shows the trees?

  • @LoboOutdoor
    @LoboOutdoor 3 года назад

    Thanks, clear explanation.

  • @JoffreyB
    @JoffreyB 6 лет назад +2

    9:30, shouldn’t be it no more m-2 items? Because if it’s m-1 and we are inserting value, our order will be changed to m+1. Because if we insert item in node with m-1 items, it will has m items, therefore it can has m+1 children, and therefore, order will be m+1. Or I misunderstood something? Is order changeable or not? If it is so, then sorry, my mistake

  • @j.frostybeats
    @j.frostybeats 2 года назад

    thank you sir, i loved your explenation

  • @kaos092
    @kaos092 7 месяцев назад

    I love how with m / 2 we're just expected to know they mean to round up

  • @ad_koishi3266
    @ad_koishi3266 2 года назад

    thanks so much professor!

  • @TH3Willster
    @TH3Willster 5 лет назад

    Awesome video man

  • @user-cq3hr5op5q
    @user-cq3hr5op5q 3 года назад

    Great explanation, all the best to your, Dudes )) !

  • @JamesOfKS
    @JamesOfKS 7 лет назад

    Nice job!

  • @tomtao5261
    @tomtao5261 4 года назад

    Thank you very much , i got it! ~

  • @pfiffi7509
    @pfiffi7509 2 года назад

    Thank You ! From Germany
    Danke!!

  • @user-jq4li8kj8o
    @user-jq4li8kj8o 2 года назад

    Thanks, good explanation

  • @primeoptumas8435
    @primeoptumas8435 3 года назад

    Great explanation sir👏👏👏

  • @inhanhhuy553
    @inhanhhuy553 5 лет назад

    Great, thank you.

  • @KaptainLuis
    @KaptainLuis 22 дня назад

    thank you so much!

  • @ezekielyovel9116
    @ezekielyovel9116 5 лет назад

    Thanks a lot, this was clear and simple to understand!

  • @Careyourbusiness
    @Careyourbusiness 5 лет назад +1

    thank u Sir
    i wanna know the name of the application that u use for the B-trees test

    • @fancy_pixel
      @fancy_pixel 5 лет назад +1

      if you wrote on google b tree visualization tool online or cs.usfca.edu b tree visualization tool

  • @tshaylatte9502
    @tshaylatte9502 3 года назад

    great content thank you

  • @DTV998
    @DTV998 5 лет назад +1

    Great:) 10h till the exam, 3 more trees to go:3

  • @williamwang2716
    @williamwang2716 5 лет назад

    No runtime analysis?

  • @ricardohincapie1537
    @ricardohincapie1537 2 года назад

    great! Thx!

  • @vladislavrepinsky6743
    @vladislavrepinsky6743 6 лет назад

    At 4:42 doesn't every node that is not a leaf have m+1 children instead of m?

  • @cruellnat
    @cruellnat 3 года назад

    Thank you!!!!!

  • @LLFRA
    @LLFRA 3 года назад

    somebody with a link to the animation site with the insert number example?

    • @LLFRA
      @LLFRA 3 года назад

      found it
      www.cs.usfca.edu/~galles/visualization/BTree.html

  • @LiChuy
    @LiChuy 2 года назад

    The value of the data, in what part of the tree do they find?

  • @unpluggedaman
    @unpluggedaman 7 лет назад

    Thanks a lot

  • @paulchicos2885
    @paulchicos2885 4 года назад

    Good explanation

  • @dryanwarrener
    @dryanwarrener 4 года назад

    Excellent :D

  • @harrisonn9792
    @harrisonn9792 2 года назад

    Thank You

  • @alipuccio3603
    @alipuccio3603 Год назад

    thank you.

  • @souv1k985
    @souv1k985 5 лет назад +1

    at 3:25 was it a 'b tree' or a 'm-way tree'. A b tree is supposed to have a 2 keys and 3 pointers right ? Please correct me if I am wrong.

    • @102RC
      @102RC 5 лет назад

      it was a B-tree order of 5 (which is really a special case of a m-way tree (but balanced), where m=5, every leaf node is at the same depth and every node, except root, is at least half full, from m/2 to m-1 keys). The # of keys/children nodes of a B-tree depends on its order. The relationship between # of keys and children of a m-way tree is k = m-1

  • @nikhilgoyal007
    @nikhilgoyal007 5 лет назад

    thanks boss!

  • @andrasszalai2514
    @andrasszalai2514 4 года назад

    What happens if there is an even (like 2,4,6) number of keys in a node. How does it split? Nice vid tho!:)

  • @bluewater6593
    @bluewater6593 2 года назад

    is an order 2 b-tree the same as a binary tree?

  • @ebicer
    @ebicer 6 лет назад

    Thanks

  • @marcuskim1989
    @marcuskim1989 6 лет назад +6

    I've always thought it helpful to think that tree data structures resemble family trees, not upside-down tree organisms lol

  • @duynhanvo7673
    @duynhanvo7673 3 года назад

    wow, i try to understand from web pages but still not working. With your explanation, it help me a lot, still not at the clearest level. Thanks a lot.

  • @jmadluck
    @jmadluck 6 лет назад +7

    good video, but i was looking for how to delete

  • @ascientist1238
    @ascientist1238 5 лет назад

    Great explanation, although viewers should be aware that the B+-tree that is more commonly tought in database systems courses is also often called B-tree.

    • @jspt256
      @jspt256 2 года назад

      which was this?

    • @ascientist1238
      @ascientist1238 2 года назад +1

      ​@@jspt256 Usually, a B+-tree is understood as a B-tree variant that does not contain real keys in the inner nodes. Instead, the inner "keys" just guides the navigation in the tree. This allows to shorten the inner keys (particularly relevant for data types like strings). However, this variation is nowadays usually also called B-tree.

  • @iam_topg
    @iam_topg 4 года назад

    YOU ARE LEGEND

  • @seankw2880
    @seankw2880 4 года назад

    It seems to be a rule that a non-root leaf can only have a maximum of M-1 keys. Why is that not explicitly stated in the rules or did I miss something?

    • @darrencowan4558
      @darrencowan4558 2 года назад

      All nodes can only have M-1 keys, regardless if it is root/node/leaf

  • @shaunsawyer8298
    @shaunsawyer8298 5 лет назад

    That image of a self balancing tree kind of seems more appropriate for what happens when a tree is unbalanced :P

  • @aloysiowinter3979
    @aloysiowinter3979 2 года назад

    muito bom!!!!

  • @ansonngai997
    @ansonngai997 5 лет назад

    thx man

  • @Heggour
    @Heggour 4 года назад +1

    here is the link if anyone was wondering : www.cs.usfca.edu/~galles/visualization/BTree.html

  • @akashskumar99
    @akashskumar99 2 года назад

    damn bro,soooooooo fkn smooth

  • @cutieboo233
    @cutieboo233 3 года назад

    perfect

  • @waliky2002
    @waliky2002 2 месяца назад

    Ok, I have to say this. Thank you and thank you with a maximum length of trillions…..

  • @rolandfabian6835
    @rolandfabian6835 2 года назад

    Godlike video

  • @christopherlovejoy93
    @christopherlovejoy93 6 лет назад

    That B-Tree visualization is at cs.usfca.edu/~galles/visualization/BTree.html

  • @donaastor
    @donaastor 2 года назад

    I was inplementing deletion ... LAST 2 DAYS. It is NOT _equally_ complicated. I had 38 cases to happily cover. I had to use bitmasks and bitwise operations to avoid crazy branching

  • @jcchurch
    @jcchurch 6 лет назад +6

    Jump to 2:41 to skip past all of the intro.

    • @easynow6599
      @easynow6599 6 лет назад +1

      actually, i really loved the intro...it is just 2 minutes that in every typical lecture they skip..so if you miss something, you're completely lost to the rest of the lecture..
      GREAT intro..