Tree indexing

In the indexed files seen in previous posts, the table of indexes is accessed sequentially with the drawbacks that I already mentioned this type of access has. However, there is a much more efficient indexing technique than sequential indexing and that is tree indexing, which significantly reduces search time. In this post, I will explain the aforementioned technique.

Using sequential access, when looking for data, it has to go through the index file sequentially until we find the searched one, obtaining the memory address of the beginning of the record in the data file. As index tables are much less heavy than files with all the data, we have a considerable improvement using indexes, even if the search in the table for these is sequential.

By changing the index table of sequential access to an organization of the indexes in a data tree, it will be able to access the indexes much more quickly. These types of structures are specially indicated to speed up searches, but let’s see how it does.

Continue reading Tree indexing

Computer generations

A common way of showing the evolution of computers is to resort to the so-called generations, temporary periods of computer development. One generation begins with a disruptive technological advance and ends when another advance appears surpassing the first one and begging a new generation.

Traditionally there are 5 generations, although there are those who already speak of 6. I in principle continue speaking of 5 although I mention the technological advances that are already here and will surely end up closing the fifth generation and giving way to the sixth. These advances are Artificial Intelligence and parallel processing.

In my classes I use the slide below to introduce the generations of computers:

Computer generations
Continue reading Computer generations