Fast top-k preserving query processing using two-tier indexes

作者：

Highlights：

• We present a new query processing method for text search.

• We extend the BMW-CS algorithm to now preserve the top-k results, proposing BMW-CSP.

• We show through experiments that the method is competitive when compared to baselines.

摘要

•We present a new query processing method for text search.•We extend the BMW-CS algorithm to now preserve the top-k results, proposing BMW-CSP.•We show through experiments that the method is competitive when compared to baselines.

论文关键词：Information retrieval,Query processing,Inverted index,Search system,BMW

论文评审过程：Received 3 January 2015, Revised 24 March 2016, Accepted 27 March 2016, Available online 8 April 2016, Version of Record 22 July 2016.

论文官网地址：https://doi.org/10.1016/j.ipm.2016.03.005