An 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 occurring words. If we cannot avoid this task by excluding high-frequently occurring...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Author:	Veretennikov, Alexander B
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 06.09.2020
Subjects:	Algorithms Intelligent systems Performance indices Queries Search algorithms
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!