Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/102925
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorVeretennikov, A. B.en
dc.date.accessioned2021-08-31T15:06:24Z-
dc.date.available2021-08-31T15:06:24Z-
dc.date.issued2021-
dc.identifier.citationVeretennikov A. B. Relevance ranking for proximity full-text search based on additional indexes with multi-component keys / A. B. Veretennikov. — DOI 10.35634/VM210110 // Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki. — 2021. — Vol. 31. — Iss. 1. — P. 132-148.en
dc.identifier.issn19949197-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Bronze3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85105461867&doi=10.35634%2fVM210110&partnerID=40&md5=87f4050f9c0aaf2e562514ed8e647546
dc.identifier.otherhttp://www.mathnet.ru/php/getFT.phtml?jrnid=vuu&paperid=760&what=fullt&option_lang=engm
dc.identifier.urihttp://elar.urfu.ru/handle/10995/102925-
dc.description.abstractThe 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. © 2021 Udmurt State University. All rights reserved.en
dc.format.mimetypeapplication/pdfen
dc.language.isoruen
dc.publisherUdmurt State Universityen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceVestn. Udmurt. Univ., Matematika, Mekhanika, Kompyuternye Nauki2
dc.sourceVestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Naukien
dc.subjectFULL-TEXT SEARCHen
dc.subjectINVERTED INDEXESen
dc.subjectPROXIMITY SEARCHen
dc.subjectRELEVANCE RANKINGen
dc.subjectSEARCH ENGINESen
dc.subjectTHREECOMPONENT KEY INDEXESen
dc.titleRelevance ranking for proximity full-text search based on additional indexes with multi-component keysen
dc.titleРанжирование документов при полнотекстовом поиске с учетом расстояния с использованием индексов с многокомпонентными ключамиru
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.rsi45439916-
dc.identifier.doi10.35634/VM210110-
dc.identifier.scopus85105461867-
local.contributor.employeeVeretennikov, A.B., Department of Calculation Mathematics and Computer Science, Ural Federal University, pr. Lenina, 51, Yekaterinburg, 620083, Russian Federation
local.description.firstpage132-
local.description.lastpage148-
local.issue1-
local.volume31-
dc.identifier.wos000640022000010-
local.contributor.departmentDepartment of Calculation Mathematics and Computer Science, Ural Federal University, pr. Lenina, 51, Yekaterinburg, 620083, Russian Federation
local.identifier.pure21198870-
local.identifier.eid2-s2.0-85105461867-
local.identifier.wosWOS:000640022000010-
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
2-s2.0-85105461867.pdf397,4 kBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.