1 citations · 1 across the 6 of their papers we have counts for
8 papers
Relevance ranking for proximity full-text search based on additional indexes with multi-component keys
Alexander B. Veretennikov
The problem of proximity full-text search is considered. If a search query contains high-frequently occurring words, then multi-component key indexes deliver an improvement in the…
Selection of Optimal Parameters in the Fast K-Word Proximity Search Based on Multi-component Key Indexes
Alexander B. Veretennikov
Proximity full-text search is commonly implemented in contemporary full-text search systems. Let us assume that the search query is a list of words. It is natural to consider a doc…
Proximity full-text searches of frequently occurring words with a response time guarantee
Alexander B. Veretennikov
Full-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, especial…
An Improved Algorithm for Fast K-Word Proximity Search Based on Multi-Component Key Indexes
Alexander B. Veretennikov
A search query consists of several words. In a proximity full-text search, we want to find documents that contain these words near each other. This task requires much time when the…
About a structure of easily updatable full-text indexes
Alexander B. Veretennikov
We consider strategies to organize easily updatable associative arrays in external memory. These arrays are used for full-text search. We study indexes with different keys: single…
An efficient algorithm for three-component key index construction
Alexander B. Veretennikov
In this paper, 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…