Subversion Repositories HelenOS-doc

Rev

Rev 59 | Rev 61 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 59 Rev 60
Line 80... Line 80...
80 
    these nodes are linked together in a list. This data structure has
 80 
    these nodes are linked together in a list. This data structure has
81 
    logaritmic search, insertion and deletion times and, thanks to the
 81 
    logaritmic search, insertion and deletion times and, thanks to the
82 
    leaf-level list, provides fantastic means of walking the nodes containing
 82 
    leaf-level list, provides fantastic means of walking the nodes containing
83 
    data. Moreover, B+trees can be used for easy storing, resizing and merging
 83 
    data. Moreover, B+trees can be used for easy storing, resizing and merging
84 
    of disjunctive intervals.</para>
 84 
    of disjunctive intervals.</para>
- 
 
 85 
 
- 
 
 86 
    <para>
- 
 
 87 
    <mediaobject id="btree" xreflabel="">
- 
 
 88 
    <imageobject role="html">
- 
 
 89 
        <imagedata fileref="images/btree.png" format="PNG" />
- 
 
 90 
    </imageobject>
- 
 
 91 
           
- 
 
 92 
    <imageobject role="fop">
- 
 
 93 
        <imagedata fileref="images.vector/btree.svg" format="SVG" />
- 
 
 94 
    </imageobject>
- 
 
 95 
                   
- 
 
 96 
    <caption>B+tree</caption>
- 
 
 97 
    </mediaobject>
- 
 
 98 
    </para>
- 
 
 99 
 
85 
  </section>
 100 
  </section>
86 
</chapter>
 101 
</chapter>
87 

            102