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 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.