AN EFFICIENT ALGORITHM FOR RETRIEVING EXAMPLE SENTENCES

Storing and retrieving an useful example sentence efficiently is an im portant task in document management systems because text retrieval is the most time-consuming part of them. Inverted filing is a well-known approach, but there are some problems when storing a huge number of se ntences. They arise when the intersection is computed for large postin gs indexed by terms, or keywords. Moreover, disk access for postings a lso lakes a lot of time in this situation. This paper presents a techn ique for the storing of multi-stages of postings and retrieving them p artly in order to compute efficiently the intersection between posting s for the requested terms. From the simulation results, it is shown th at the presented algorithm is 3 to 88 times faster than the traditiona l approach.