Using Additional Indexes for Fast Full-Text Search of Phrases That Contain Frequently Used Words
Searches for phrases and word sets in large text arrays by means of additional indexes are considered. Their use may reduce the query-processing time by an order of magnitude in comparison with standard inverted files.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Proximity Full-Text Search by Means of Additional Indexes with Multi-component Keys: In Pursuit of Optimal Performance
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, especially if the query terms are frequently occ…
Information RetrievalManagementRetrievalProximity Full-Text Search with a Response Time Guarantee by Means of Additional Indexes
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 q…
Information RetrievalRetrievalAn Improved Algorithm for Fast K-Word Proximity Search Based on Multi-Component Key Indexes
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 query consists of high-frequently occur…
About a structure of easily updatable full-text indexes
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 word form, two word forms, and sequences…
Relevance ranking for proximity full-text search based on additional indexes with multi-component keys
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 search speed compared with ordinary inve…