Paper Title :Optimizing Information Retrieval (IR) Time With Doubly Linked List And Binary Search Tree (BST)

Author :Isara Nakavisute, Kanyarat Sriwisathiyakun

Article Citation :Isara Nakavisute ,Kanyarat Sriwisathiyakun , (2015 ) " Optimizing Information Retrieval (IR) Time With Doubly Linked List And Binary Search Tree (BST) " , International Journal of Advance Computational Engineering and Networking (IJACEN) , pp. 128-133, Volume-3,Issue-12

Abstract : in indexing multiple unstructured documents for the purpose of searching a particular keyword or sentence (i.e. Text searching in multiple documents such as internet search engine) , a computer's memory and processor are demanded. These resources are limited in most machines and must be used optimally and efficiently. This paper will optimize the memory usage by evaluating the proper choice of data structure to be used in the vector-space model(vsm) and will review the required stages involved in generating an index, for weighting the index terms, and for representing documents. It will also look at the parsing of the document collection through the generation of index terms, to generation of document representations. Index Terms- document searching, data structure, index, data dictionary, linked list, binary search tree, vector-space model.

Type : Research paper

Published : Volume-3,Issue-12

	|		PDF	|	Viewed - 90	|	Published on 2015-12-23