|
This article is cited in 1 scientific paper (total in 1 paper)
COMPUTER SCIENCE
Relevance ranking for proximity full-text search based on additional indexes with multi-component keys
A. B. Veretennikov Ural Federal University, pr. Lenina, 51,
Yekaterinburg, 620083, Russia
Abstract:
The problem of proximity full-text search is considered. If a search query contains high-frequently occurring words, then multi-component key indexes deliver improvement of the search speed in comparison with ordinary inverted indexes. It was shown that we can increase the search speed up to 130 times in cases when queries consist of high-frequently occurring words. In this paper, we are investigating how the multi-component key indexes architecture affects the quality of the search. We consider several well-known methods of relevance ranking; these methods are of different authors. Using these methods we perform the search in the ordinary inverted index and then in the index that is enhanced with multi-component key indexes. The results show that with multi-component key indexes we obtain search results that are very near in terms of relevance ranking to the search results that are obtained by means of ordinary inverted indexes.
Keywords:
full-text search, search engines, relevance ranking, inverted indexes, proximity search, three-component key indexes.
Received: 11.10.2020
Citation:
A. B. Veretennikov, “Relevance ranking for proximity full-text search based on additional indexes with multi-component keys”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 31:1 (2021), 132–148
Linking options:
https://www.mathnet.ru/eng/vuu760 https://www.mathnet.ru/eng/vuu/v31/i1/p132
|
Statistics & downloads: |
Abstract page: | 249 | Full-text PDF : | 150 | References: | 27 |
|