An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
| Hi-index | 0.07 |
Storing and retrieving a useful example sentence efficiently is an important 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 sentences. They arise when the intersection is computed for large postings indexed by terms, or keywords. Moreover, disk access for postings also takes a lot of time in this situation. This paper presents a technique for the storing of multi-stages of postings and retrieving them partly in order to compute efficiently the intersection between postings for the requested terms. From the simulation results, it is shown that the presented algorithm is 6 to 88 times faster than the traditional approach.