Comparative study on data searching in linked list & B-tree and B+tree techniques

There are many methods of searching large amount of data to find one particular piece of information. Such as finding the name of a person in a mobile phone record. Certain methods of organizing data make the search process more efficient. The objective of these methods is to find the element with t...

Full description

Saved in:

Bibliographic Details
Main Author:	S Giuma, Ahmed Eshtewi
Format:	Thesis
Language:	English English English
Published:	2015
Subjects:	QA71-90 Instruments and machines
Online Access:	http://eprints.uthm.edu.my/1284/2/AHMED%20ESHTEWI%20S%20GIUMA%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/1284/1/24p%20AHMED%20ESHTEWI%20S%20GIUMA.pdf http://eprints.uthm.edu.my/1284/3/AHMED%20ESHTEWI%20S%20GIUMA%20WATERMARK.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uthm-ep.1284
record_format	uketd_dc
spelling	my-uthm-ep.12842021-09-30T07:08:05Z Comparative study on data searching in linked list & B-tree and B+tree techniques 2015-03 S Giuma, Ahmed Eshtewi QA71-90 Instruments and machines There are many methods of searching large amount of data to find one particular piece of information. Such as finding the name of a person in a mobile phone record. Certain methods of organizing data make the search process more efficient. The objective of these methods is to find the element with the least time. In this study, 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 and what is the ratio difference between them. Three search techniques are used in this work namely; linked list, B-tree, and B+ tree. A comparison analysis is conducted using five 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. Based on these results, it is clear that searching in B- tree is faster than linked list at a ratio of (1: 5). The searching time in a B+ tree is faster than B- tree at the ratio of (1: 2). The searching time in a B+ tree is faster than linked list at the ratio of (1: 8). With that, it can be concluded that B+ tree is the fastest technique for data access. 2015-03 Thesis http://eprints.uthm.edu.my/1284/ http://eprints.uthm.edu.my/1284/2/AHMED%20ESHTEWI%20S%20GIUMA%20COPYRIGHT%20DECLARATION.pdf text en staffonly http://eprints.uthm.edu.my/1284/1/24p%20AHMED%20ESHTEWI%20S%20GIUMA.pdf text en public http://eprints.uthm.edu.my/1284/3/AHMED%20ESHTEWI%20S%20GIUMA%20WATERMARK.pdf text en validuser mphil masters Universiti Tun Hussein Onn Malaysia Faculty of Computer Science and Information Technology
institution	Universiti Tun Hussein Onn Malaysia
collection	UTHM Institutional Repository
language	English English English
topic	QA71-90 Instruments and machines
spellingShingle	QA71-90 Instruments and machines S Giuma, Ahmed Eshtewi Comparative study on data searching in linked list & B-tree and B+tree techniques
description	There are many methods of searching large amount of data to find one particular piece of information. Such as finding the name of a person in a mobile phone record. Certain methods of organizing data make the search process more efficient. The objective of these methods is to find the element with the least time. In this study, 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 and what is the ratio difference between them. Three search techniques are used in this work namely; linked list, B-tree, and B+ tree. A comparison analysis is conducted using five 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. Based on these results, it is clear that searching in B- tree is faster than linked list at a ratio of (1: 5). The searching time in a B+ tree is faster than B- tree at the ratio of (1: 2). The searching time in a B+ tree is faster than linked list at the ratio of (1: 8). With that, it can be concluded that B+ tree is the fastest technique for data access.
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	S Giuma, Ahmed Eshtewi
author_facet	S Giuma, Ahmed Eshtewi
author_sort	S Giuma, Ahmed Eshtewi
title	Comparative study on data searching in linked list & B-tree and B+tree techniques
title_short	Comparative study on data searching in linked list & B-tree and B+tree techniques
title_full	Comparative study on data searching in linked list & B-tree and B+tree techniques
title_fullStr	Comparative study on data searching in linked list & B-tree and B+tree techniques
title_full_unstemmed	Comparative study on data searching in linked list & B-tree and B+tree techniques
title_sort	comparative study on data searching in linked list & b-tree and b+tree techniques
granting_institution	Universiti Tun Hussein Onn Malaysia
granting_department	Faculty of Computer Science and Information Technology
publishDate	2015
url	http://eprints.uthm.edu.my/1284/2/AHMED%20ESHTEWI%20S%20GIUMA%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/1284/1/24p%20AHMED%20ESHTEWI%20S%20GIUMA.pdf http://eprints.uthm.edu.my/1284/3/AHMED%20ESHTEWI%20S%20GIUMA%20WATERMARK.pdf
_version_	1747830763353538560

Comparative study on data searching in linked list & B-tree and B+tree techniques

Similar Items