Performance Evaluation of Inverted Files, B-Tree and B+ Tree Indexing Algorithm on Malay Text

• Published in: ICRAIE 2019 - 4th International Conference and Workshops on Recent Advances and Innovations in Engineering: Thriving Technologies
• Main Author: Rosnan S.; Rahman N.A.; Mohamed Hatim S.; Ghul Z.H.
• Format: Conference paper
• Language: English
• Published: Institute of Electrical and Electronics Engineers Inc. 2019
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083275427&doi=10.1109%2fICRAIE47735.2019.9037757&partnerID=40&md5=f831e1efcf49c42948b1a15d42427dc9

Indexing is a part of Information Retrieval that helps to overcome the results yield on certain information. This paper show the result of a study on indexing techniques that implementing three types of indexing technique. The indexing techniques applied are Inverted Files Indexing, B-Tree Indexing and B+ Tree Indexing. This research uses 500 Malay text documents as the test collection. The performance of the indexing technique was measured and compared in its retrieval time taken. 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. © 2019 IEEE.