Comparison on data searching in database using different techniques

Abstract EN

The voluminous amount of data requires a hectic task when searching through the data for targeted locations.

In an effort to reduce the search process, an effective and fast method for searching through and hitting specific targets in the data is paramount.

In this study, for search purposes, the focus is on time of search in large databases, which is considered an important factor in the success of the search.

The goal is choosing the appropriate search techniques to test the time of access to data in the database.

Two search techniques are used in this work namely; linked list and B- tree, and a comparison analysis is conducted using two case databases studies.

Experimental results reveal that after the average times for each search algorithms on the databases have been recorded, the linked list requires lots of time during search process, with B- tree producing significantly low times.

Thus, the B- tree show its superiority than the linked list