‫Might be trees, so be trees.
‫It's a balanced data structure for fast reversal, so the goal is to minimize the search space.
‫I don't want to do all these Io's to find my rose.
‫Right.
‫Did that rhyme?
‫I think it did.
‫So would be tree has a bee.
‫Tree has a set of nodes.
‫I don't want you to focus on those ward nodes.
‫I'm going to reference the paper or the tree paper written by Steve Fox in nineteen seventy three consist
‫of nodes OK.
‫And a B three have a degree.
‫We call this degree M by default and you can choose what degree your tree is right.
‫And the choice of how, how big or small really changes the whole equation.
‫And Daviess pick that automatically by the way, for you, you don't have to do and you can't configure
‫this to be honest.
‫So this degree is basically correspond to the number of child nodes each node can have.
‫I said some in this case because not all nodes can have children.
‫And I don't really care about these details.
‫These are all theoretical stuff.
‫We don't really care about it, to be honest.
‫We really care about the essence of the tree.
‫To me, the traversal aspect of this node and an A. has up to M minus one element.
‫So if if you node has M children, then the it has what we call M minus one elements.
‫So I it have five children, it must have four if it have three children must have two elements.
‫So you might say what is an element.
‫This is a good question.
‫So each element has a key and the value very critical thing.
‫So we have nodes, nodes have nodes and each node in, in it inside it has elements and these elements
‫of keys and a value, a key value.
‫The value here is usually the pointer to the rule.
‫It's called a data pointer.
‫They call it the value sometimes in the in the paper it's referred to as Alpha I.
‫Right.
‫So if you read the Bible, reference the paper in the show notes here for you to check it out and the
‫slides will be in the show and also as well.
‫So you can take a look at that and the description the value has the data pointed to the role.
‫And the key itself is what you're searching for.
‫And we're going to show an example to clarify all that stuff.
‫So the data point to this is this is where databases can shine.
‫Each database system does this differently as a data point, which is a value here can either point
‫to the primary key if you have a secondary index or a component directly to the tuple second indexes.
‫And A.B. in Mystikal and Oracle, I believe, point to the primary key.
‫Well, while in Postgres, all secondary indexes point to the tuple directly.
‫And just that I talked about the this in my YouTube channel discussing how Obama proposed goes to my
‫school.
‫And that is one of the reasons, one tiny reasons.
‫Check out that video if you're interested.
‫Just say just start from YouTube over Obama Esequiel.
‫I was saying you're going to find out.
‫The video is very, very interesting.
‫Read.
‫So there's also this Calzado fruit node and internal node and a leaf and a leaf known as well.
‫And that we're going to describe what all this means.
‫And like the root node is is very self descriptive, right?
‫It's the first node at the top.
‫Internal nodes are below it and the lymph nodes that are out of it at the end.
‫There is no child.
‫They don't have children.
‫A very important concept here and node is equal.
‫iDesk Beijng here in database's most databases.
‫I know in computer science they give you this, this, this contrives example where a degree of three
‫or degree or five and they have some put some values here that doesn't really correspond to anything
‫practical.
‫But practically and no it is a complete page.
‫So if a page is eight K, you better find a way to fit eight K worth of elements in it.
‫So that's what we try to think here.