1. Электронный научный архив УрФУ
  2. 00. Общеуниверситетские коллекции
  3. Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC
Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/101513
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVeretennikov, A. B.en
dc.date.accessioned2021-08-31T14:57:50Z-
dc.date.available2021-08-31T14:57:50Z-
dc.date.issued2020-
dc.identifier.citationVeretennikov A. B. Proximity Full-Text Searches of Frequently Occurring Words with a Response Time Guarantee / A. B. Veretennikov. — DOI 10.1007/978-3-030-42176-2_37 // Springer Proceedings in Mathematics and Statistics. — 2020. — Vol. 318. — P. 377-391.en
dc.identifier.isbn9783030421755-
dc.identifier.issn21941009-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Green3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85086137925&doi=10.1007%2f978-3-030-42176-2_37&partnerID=40&md5=bf2dc9a174502a483df6b2372a818cfb
dc.identifier.otherhttp://arxiv.org/pdf/2009.03679m
dc.identifier.urihttp://elar.urfu.ru/handle/10995/101513-
dc.description.abstractFull-text search engines are important tools for information retrieval. In a proximity full-text search, a document is relevant if it contains query terms near each other, especially if the query terms are frequently occurring words. For each word in the text, we use additional indexes to store information about nearby words at distances from the given word of less than or equal to MaxDistance, which is a parameter. A search algorithm for the case when the query consists of high-frequently occurring words is discussed. In addition, we present results of experiments with different values of MaxDistance to evaluate the search speed dependence on the value of MaxDistance. These results show that the average time of the query execution with our indexes is 94.7–45.9 times (depending on the value of MaxDistance) less than that with standard inverted files when queries that contain high-frequently occurring words are evaluated. © Springer Nature Switzerland AG 2020.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherSpringeren
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceSpringer Proc. Math. Stat.2
dc.sourceSpringer Proceedings in Mathematics and Statisticsen
dc.subjectADDITIONAL INDEXESen
dc.subjectFULL-TEXT SEARCHen
dc.subjectINFORMATION RETRIEVALen
dc.subjectINVERTED INDEXESen
dc.subjectPROXIMITY SEARCHen
dc.subjectSEARCH ENGINESen
dc.subjectTERM PROXIMITYen
dc.subjectFULL-TEXT SEARCHen
dc.subjectFULL-TEXT SEARCH ENGINESen
dc.subjectINVERTED FILESen
dc.subjectQUERY EXECUTIONen
dc.subjectQUERY TERMSen
dc.subjectRESPONSE-TIME GUARANTEESen
dc.subjectSEARCH ALGORITHMSen
dc.subjectSEARCH SPEEDen
dc.subjectSEARCH ENGINESen
dc.titleProximity Full-Text Searches of Frequently Occurring Words with a Response Time Guaranteeen
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1007/978-3-030-42176-2_37-
dc.identifier.scopus85086137925-
local.contributor.employeeVeretennikov, A.B., Ural Federal University, Lenina 51, Yekaterinburg, 620083, Russian Federation, INSM, Yekaterinburg, Russian Federation
local.description.firstpage377-
local.description.lastpage391-
local.volume318-
local.contributor.departmentUral Federal University, Lenina 51, Yekaterinburg, 620083, Russian Federation
local.contributor.departmentINSM, Yekaterinburg, Russian Federation
local.identifier.pure13163973-
local.identifier.puree2683f1e-ed0d-4a88-bcea-4ede0cdeed96uuid
local.identifier.eid2-s2.0-85086137925-
Appears in Collections:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85086137925.pdf254,53 kBAdobe PDFView/Open
Show simple item record   Google Scholar





Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.