Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2021, Volume 31, Issue 1, Pages 132–148
DOI: https://doi.org/10.35634/vm210110
(Mi vuu760)
 

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
Full-text PDF (370 kB) Citations (1)
References:
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
Bibliographic databases:
Document Type: Article
UDC: 519.683.5
MSC: 68P20, 68P10
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Ver21}
\by A.~B.~Veretennikov
\paper Relevance ranking for proximity full-text search based on additional indexes with multi-component keys
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
\yr 2021
\vol 31
\issue 1
\pages 132--148
\mathnet{http://mi.mathnet.ru/vuu760}
\crossref{https://doi.org/10.35634/vm210110}
Linking options:
  • https://www.mathnet.ru/eng/vuu760
  • https://www.mathnet.ru/eng/vuu/v31/i1/p132
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Вестник Удмуртского университета. Математика. Механика. Компьютерные науки
    Statistics & downloads:
    Abstract page:250
    Full-text PDF :152
    References:27
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024