论文信息 - Faster BlockMax WAND with Longer Skipping

Faster BlockMax WAND with Longer Skipping

One of the major problems for modern search engines is to keep up with the tremendous growth in the size of the web and the number of queries submitted by users. The amount of data being generated today can only be processed and managed with specialized technologies.

Antonio Mallia | Elia Porciani | Antonio Mallia | Elia Porciani

[1] Cristian Rossi,et al. Fast top-k preserving query processing using two-tier indexes , 2016, Inf. Process. Manag..

[2] Andrei Z. Broder,et al. Efficient query evaluation using a two-level retrieval process , 2003, CIKM '03.

[3] Fabrizio Silvestri,et al. Sorting Out the Document Identifier Assignment Problem , 2007, ECIR.

[4] Frank Wm. Tompa,et al. Split-Lists and Initial Thresholds for WAND-based Search , 2018, SIGIR.

[5] Sebastiano Vigna,et al. Quasi-succinct indices , 2012, WSDM.

[6] Torsten Suel,et al. Inverted index compression and query processing with optimized document ordering , 2009, WWW '09.

[7] Mauricio Marín,et al. Efficient Parallel Block-Max WAND Algorithm , 2013, Euro-Par.

[8] JUSTIN ZOBEL,et al. Inverted files for text search engines , 2006, CSUR.

[9] Giuseppe Ottaviano,et al. Faster BlockMax WAND with Variable-sized Blocks , 2017, SIGIR.

[10] Torsten Suel,et al. Faster top-k document retrieval using block-max indexes , 2011, SIGIR.

[11] Cristian Rossi,et al. Waves: a fast multi-tier top-k query processing algorithm , 2017, Information Retrieval Journal.

[12] Torsten Suel,et al. Optimizing top-k document retrieval strategies for block-max indexes , 2013, WSDM.

[13] Giuseppe Ottaviano,et al. Partitioned Elias-Fano indexes , 2014, SIGIR.