Full-text PDF (789 kB) Citations (1)

DOI: https://doi.org/10.20537/vm190111

Abstract: Proximity full-text searches in large text arrays are considered. A search query consists of several words. The search result is a list of documents containing these words. In a modern search system, documents that contain search query words that are near each other are more relevant than other documents. To solve this task, for each word in each indexed document, we need to store a record in the index. In this case, the query search time is proportional to the number of occurrences of the queried words in the indexed documents. Consequently, it is common for search systems to evaluate queries that contain frequently occurring words much more slowly than queries that contain less frequently occurring, ordinary 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. This parameter can take a value of 5, 7, or even more. Three-component key indexes can be created for faster query execution. Previously, we presented the results of experiments showing that, when queries contain very frequently occurring words, the average time of the query execution with three-component key indexes is 94.7 times less than that required when using ordinary inverted indexes. In the current work, we describe a new three-component key index building algorithm. We prove the correctness of the algorithm. We present the results of experiments of the index creation depending on the value of $MaxDistance$.

Keywords: full-text search, search engines, inverted files, additional indexes, proximity search, three-component key indexes.

Funding agency	Grant number
Ministry of Education and Science of the Russian Federation	02.A03.21.0006
The work was supported by Act 211 Government of the Russian Federation, contract № 02.A03.21.0006

Received: 01.07.2018

Bibliographic databases:

Citation: A. B. Veretennikov, “An efficient algorithm for three-component key index construction”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:1 (2019), 117–132

Citation in format AMSBIB

Linking options:

https://www.mathnet.ru/eng/vuu671

https://www.mathnet.ru/eng/vuu/v29/i1/p117

This publication is cited in the following articles:

1. A. B. Veretennikov, “Ranzhirovanie dokumentov pri polnotekstovom poiske s uchetom rasstoyaniya s ispolzovaniem indeksov s mnogokomponentnymi klyuchami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 31:1 (2021), 132–148    

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles