Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/101908
Title: Proximity full-text search with a response time guarantee by means of additional indexes
Authors: Veretennikov, A. B.
Issue Date: 2018
Publisher: Springer Verlag
Citation: Veretennikov 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.
Abstract: Full-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.
Keywords: ADDITIONAL INDEXES
FULL-TEXT SEARCH
INVERTED INDEXES
PROXIMITY SEARCH
SEARCH ENGINES
TERM PROXIMITY
INTELLIGENT SYSTEMS
ADDITIONAL INDEXES
FULL-TEXT SEARCH
INVERTED INDICES
PROXIMITY SEARCH
TERM PROXIMITY
SEARCH ENGINES
URI: http://hdl.handle.net/10995/101908
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85057104058
PURE ID: 8317321
472c345b-81a9-4ed5-a215-d6287744bc54
ISSN: 21945357
ISBN: 9783030010539
DOI: 10.1007/978-3-030-01054-6_66
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.