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

Caio Moura Daoud, Edleno Silva de Moura, André Luiz da Costa Carvalho, Altigran Soares da Silva, David Fernandes de Oliveira, Cristian Rossi

Abstract: 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.