Study of Algorithms and Techniques of Web Search Engines Indexing

Bharat Bhushan Kumar and A. R. Tripathy

International Journal of Scientific Research in Science and Technology, 2025, vol. 12, issue 5, 680-685

Abstract: In this paper, we compressing the huge index of a Web Search Engine (WSE) entails a better utilization of memory hierarchies and thus a lower query processing time. During the last years several works addressed the problem of index compression. The majority of them focused on devising effective and efficient methods to encode the document identifiers (DocIDs) contained in the posting lists of Inverted File (IF) indexes[1-5]. Since posting lists are ordered sequences of integer DocID values, and are usually accessed by scanning them from the beginning, these lists are stored as sequences of d-gaps, i.e. differences between successive DocID values.

Keywords: Web Search; Algorithms And Techniques; Techniques Of Web; Search Engines Indexing (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ijsrst.com/home/article/view/IJSRST25126323 Abstract page (text/html)
https://ijsrst.com/home/article/download/IJSRST25126323/IJSRST25126323 Full text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:etm:ijsrst:v12:y2025:i5:id:1280

DOI: 10.32628/IJSRST25126323

Access Statistics for this article

More articles in International Journal of Scientific Research in Science and Technology from Technoscience Academy
Bibliographic data for series maintained by Pankaj Sharma ().