Scribd Logo
Upload

Welcome to Scribd!

  • 11 B Trees Markup

    Uploaded by

    Yogita Ghumare
    3 views8 pages

    Original Title

    11 b Trees Markup

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    3 views8 pages

    11 B Trees Markup

    Uploaded by

    Yogita Ghumare

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 8
    CSE 326: Data Structures B-Trees and B+ Trees Brian Curless we Spring 2008 c- = & ss st Announcements (4/30/08) + Midterm on Friday + Special office hour: 4:30-5:30 Thursday in Jaech Gallery (6" floor of CSE building) ~ This is instead of my usual 1 1am office hour. + Reading for this lecture: Weiss Sec. 4.7 Traversing very large datasets Suppose we had very many pioces of data (as in a database), e.g., 0 = 290 = 10°, How many (worst case) hops through the tree to find a node? + BST lo" 1243 se o> SAVE logy! > PM esa! + Splay 0" Memory considerations Whatis ina tree node? In an object? Node Object obj Node lef Node right, Node parent; Object: Key Suppose the data is IKB. 1b “How much space does the tree take? How much of the data can live in 1GB of RAM? 0).("/ Cycles to access: | = | Realsters ‘ L1 Cache 2 L2 cache 30 Main memory 250 Minimizing random disk access In our example, almost all of our data structure is on disk. Thus, hopping through a tree amounts to random accesses to disk. Ouch! How can we address this problem? Vecrerye Bgptr wf bI7 Fant | OO ome hicny storage of children Sd ment ff er ayn M-ary Search Tree B-Trees Suppose, somehow, we devised a search tree with maximum branching factor M: ee Complete tree has height: OCI aq”) for ackitraily bee # hops for find” yyrest ~ OCW valarod ~ OC 1090) Runtime of find: (a) wie | owed ws) How do we make an M-ary search tree work? + Each node has (up to) M-1 keys. + Order property: Met ~ subtree between two keys x and y contain leaves with salues v such that x < y= y bad hood B-Tree Structure Properties Root (special case) ~ has between 2 and M children (or root could be a leaf) Internal nodes — store up to. M-1 keys ~ have between [4/2] and M children Leaf nodes — store between (M-1)/2 | and M-1 sorted keys ~ all at the same depth B-Tree: Example B-Tree with = 4 if2[) [sl fi2[is]i6) 222)24] 882] B5138]39] [asla7]_] S260] B+ Trees Ina B+ tree, the internal nodes have no data — only the leaves do! + Each internal node still has (up to) M-1 keys: + Order property: — subtree between two keys x and y such thatx

    You might also like