Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/101908
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVeretennikov, A. B.en
dc.date.accessioned2021-08-31T15:00:31Z-
dc.date.available2021-08-31T15:00:31Z-
dc.date.issued2018-
dc.identifier.citationVeretennikov A. B. Proximity full-text search with a response time guarantee by means of additional indexes / A. B. Veretennikov. — DOI 10.1007/978-3-030-01054-6_66 // Advances in Intelligent Systems and Computing. — 2018. — Vol. 868. — P. 936-954.en
dc.identifier.isbn9783030010539-
dc.identifier.issn21945357-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Green3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85057104058&doi=10.1007%2f978-3-030-01054-6_66&partnerID=40&md5=61faddefc9462640113a4683fb119466
dc.identifier.otherhttp://arxiv.org/pdf/1811.07361m
dc.identifier.urihttp://hdl.handle.net/10995/101908-
dc.description.abstractFull-text search engines are important tools for information retrieval. Term proximity is an important factor in relevance score measurement. In a proximity full-text search, we assume that a relevant document contains query terms near each other, especially if the query terms are frequently occurring words. A methodology for high-performance full-text query execution is discussed. We build additional indexes to achieve better efficiency. For a word that occurs in the text, we include in the indexes some information about nearby words. What types of additional indexes do we use? How do we use them? These questions are discussed in this work. We present the results of experiments showing that the average time of search query execution is 44–45 times less than that required when using ordinary inverted indexes. © Springer Nature Switzerland AG 2019.en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceAdvances in Intelligent Systems and Computingen
dc.subjectADDITIONAL INDEXESen
dc.subjectFULL-TEXT SEARCHen
dc.subjectINVERTED INDEXESen
dc.subjectPROXIMITY SEARCHen
dc.subjectSEARCH ENGINESen
dc.subjectTERM PROXIMITYen
dc.subjectINTELLIGENT SYSTEMSen
dc.subjectADDITIONAL INDEXESen
dc.subjectFULL-TEXT SEARCHen
dc.subjectINVERTED INDICESen
dc.subjectPROXIMITY SEARCHen
dc.subjectTERM PROXIMITYen
dc.subjectSEARCH ENGINESen
dc.titleProximity full-text search with a response time guarantee by means of additional indexesen
dc.typeConference Paperen
dc.typeinfo:eu-repo/semantics/conferenceObjecten
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.1007/978-3-030-01054-6_66-
dc.identifier.scopus85057104058-
local.contributor.employeeVeretennikov, A.B., INSM, Ural Federal University, Yekaterinburg, Russian Federation
local.description.firstpage936-
local.description.lastpage954-
local.volume868-
local.contributor.departmentINSM, Ural Federal University, Yekaterinburg, Russian Federation
local.identifier.pure8317321-
local.identifier.pure472c345b-81a9-4ed5-a215-d6287744bc54uuid
local.identifier.eid2-s2.0-85057104058-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85057104058.pdf328,4 kBAdobe PDFView/Open


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