――I want to verify how much the presence or absence of an index makes a difference in processing speed. ――In the process, I want to understand a little about B-trees.
--Those who are learning about databases --Students who have begun to learn about CS
--The environment used this time is [Colaboratory] provided by Google (https://colab.research.google.com/notebooks/welcome.ipynb?hl=ja) --The language used is python --The data to be used is summarized in csv etc. in advance. --The data used is 1147620 rows of data.
-My github ――The code content is adapted to the data I used, so rewrite it each time ...
--No index: 0.290917145000094 --Indexed: 4.710936333000063
--No index: 10.85402692900015 --Indexed: 0.285733380000237
--No index: 68.63662464900017 --Indexed: 0.263980986000206
It was proved that the presence or absence of the index makes such a difference in the search processing time.
It seems that B-tree algorithms and bitmaps are used, For details
Understanding the "index" that improves database performance
Is written very carefully, so I recommend it.
that's all. .. .. .. .. .. ..
Recommended Posts