Search and Sort Algorithms for Big Data Structures
Arslan, Bülent (2022)
2022
All rights reserved. This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:amk-2022112925016
https://urn.fi/URN:NBN:fi:amk-2022112925016
Tiivistelmä
This work gives an insight into data collections, how they are managed and why it is important to adapt the handling and processing regarding the growth of the information which is saved and needed.
Starting with data collection in general, to give a feeling of the amount of processed information. The target is to show and give a feeling of the continuous rise of data and what problems it entails. It elaborates on the existing methods to search, sort, and analyze the information, what advantages it gives and what might be reached by optimizing and adapting the speed to the rising amount of collected data.
A qualitative practical approach is used which utilizes different resources and tools to collect, compare and refine the needed information. With few questions asked, the focus was kept on those, to not get lost in the wide quantity of information. The empirical part further demonstrates the differences in speed and performance between the chosen algorithms. It is described how the comparisons were approached and how the difficulties were solved.
Starting with data collection in general, to give a feeling of the amount of processed information. The target is to show and give a feeling of the continuous rise of data and what problems it entails. It elaborates on the existing methods to search, sort, and analyze the information, what advantages it gives and what might be reached by optimizing and adapting the speed to the rising amount of collected data.
A qualitative practical approach is used which utilizes different resources and tools to collect, compare and refine the needed information. With few questions asked, the focus was kept on those, to not get lost in the wide quantity of information. The empirical part further demonstrates the differences in speed and performance between the chosen algorithms. It is described how the comparisons were approached and how the difficulties were solved.