Documentos de Académico
Documentos de Profesional
Documentos de Cultura
OPERACIONES BSICAS
Los rboles B+ se han convertido en la tcnica ms utilizada para la
organizacin de archivos indizados.
Buscando 65:
1. Busca el nodo interno que apunta a la hoja con 65.
2. Encuentra la rama que va desde 50 a 75.
3. Apunta a la tercera hoja.
4. Buscar de forma secuencial hasta encontrar 65.
3. E
n
Eliminacin
Las claves a eliminar siempre se encuentran en las hojas. En general deben
distinguirse los siguientes casos:
Eliminar 60:
Eliminar 15:
EJEMPLO:
http://www.aprenderaprogramar.com/foros/index.php?topic=1436.0
http://decsai.ugr.es/~jfv/ed1/tedi/cdrom/docs/arb_B3.htm
https://www.quora.com/What-is-a-B+-Tree
http://www.virtual.unal.edu.co/cursos/ingenieria/2001412/capitulos/ca
p8/85.html
https://mx.answers.yahoo.com/question/index?qid=20111129190121AAp8yZn
http://decsai.ugr.es/~jfv/ed1/tedi/cdrom/docs/arb_B3.htm
https://www.tutorialcup.com/dbms/b-tree.htm<
Suppose a B+ tree has an order of n (it is the number of branches above tree
structure has 5 branches altogether, hence order is 5), and then it can have n/2
to n intermediary nodes and n/2 to n-1 leaf nodes. In our example above, n= 5
i.e.; it has 5 branches from root. Then it can have intermediary nodes ranging
from 3 to 5. And it can have leaf nodes from 3 to 4.
Suppose we have a new student Bryan. Where will he fit in the file? He will fit in the 1 st leaf
node. Since this leaf node is not full, we can easily add him in the node.
But what happens if we want to insert another student Ben to this file? Some re-
arrangement to the nodes is needed to maintain the balance of the file.