Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan

These worlds face a challenge of big data. Indexing is a part of Information Retrieval that helps to overcome the results yield on certain information. Like nowadays, people tend to have everything is seconds and faster. Thus, a study on indexing techniques that tend to have a better performance in...

Full description

Saved in:

Bibliographic Details
Main Author:	Rosnan, Suhanah
Format:	Thesis
Language:	English
Published:	2016
Subjects:	Electronic digital computers Algorithms
Online Access:	https://ir.uitm.edu.my/id/eprint/16796/1/16796.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uitm-ir.16796
record_format	uketd_dc
spelling	my-uitm-ir.167962022-03-08T06:42:09Z Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan 2016 Rosnan, Suhanah Electronic digital computers Programming. Rule-based programming. Backtrack programming Algorithms These worlds face a challenge of big data. Indexing is a part of Information Retrieval that helps to overcome the results yield on certain information. Like nowadays, people tend to have everything is seconds and faster. Thus, a study on indexing techniques that tend to have a better performance in retrieving documents in terms of time had been done. The indexing techniques used in this project by comparing their performance are Inverted Files Indexing, B-Tree Indexing and B+ Tree Indexing. This research uses 500 Malay text documents as the test collection. The indexing technique chosen has a slight difference in its data structure. Thus the ranking process uses the same method. The performance of the indexing technique was measured and compared in its retrieval time taken. The behaviors of each indexing technique are different and the searching methods are different too. There are five experiments done in this paper that helps to determine which of the techniques are said have a good performance. The experiments done are on the time taken to index the terms or keywords to its data structure which are either linked list as in Inverted Files or B-Tree as implemented in B-Tree and B+ Tree indexing technique. In addition, experiments on the time taken to retrieve the documents were done by having a variable as the condition. All the results and discussion are explained and discuss deeper in this paper. 2016 Thesis https://ir.uitm.edu.my/id/eprint/16796/ https://ir.uitm.edu.my/id/eprint/16796/1/16796.pdf text en public mphil masters Universiti Teknologi MARA Faculty of Computer and Mathematical Sciences
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
topic	Electronic digital computers Electronic digital computers Algorithms
spellingShingle	Electronic digital computers Electronic digital computers Algorithms Rosnan, Suhanah Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan
description	These worlds face a challenge of big data. Indexing is a part of Information Retrieval that helps to overcome the results yield on certain information. Like nowadays, people tend to have everything is seconds and faster. Thus, a study on indexing techniques that tend to have a better performance in retrieving documents in terms of time had been done. The indexing techniques used in this project by comparing their performance are Inverted Files Indexing, B-Tree Indexing and B+ Tree Indexing. This research uses 500 Malay text documents as the test collection. The indexing technique chosen has a slight difference in its data structure. Thus the ranking process uses the same method. The performance of the indexing technique was measured and compared in its retrieval time taken. The behaviors of each indexing technique are different and the searching methods are different too. There are five experiments done in this paper that helps to determine which of the techniques are said have a good performance. The experiments done are on the time taken to index the terms or keywords to its data structure which are either linked list as in Inverted Files or B-Tree as implemented in B-Tree and B+ Tree indexing technique. In addition, experiments on the time taken to retrieve the documents were done by having a variable as the condition. All the results and discussion are explained and discuss deeper in this paper.
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	Rosnan, Suhanah
author_facet	Rosnan, Suhanah
author_sort	Rosnan, Suhanah
title	Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan
title_short	Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan
title_full	Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan
title_fullStr	Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan
title_full_unstemmed	Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan
title_sort	performance evaluation of inverted files, b-tree and b+ tree indexing algorithm on malay text / suhanah rosnan
granting_institution	Universiti Teknologi MARA
granting_department	Faculty of Computer and Mathematical Sciences
publishDate	2016
url	https://ir.uitm.edu.my/id/eprint/16796/1/16796.pdf
_version_	1783733546533257216

Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan

Similar Items