Please find attached the paper on "Efficient Query Evaluation using a
Two-Level Retrieval Process". I believe that such approach may improve the
way Lucene/Solr evaluates queries today.
[Solr-dev] Efficient Query Evaluation using a Two-Level Retrieval Process
- Shalin Shekhar Mangar: Hey Joaquin, The mailing list strips off attachments. Can you please upload it somewhere and give us the link? -- Regards, Shalin Shekhar Mangar.
- J. Delgado: Here is the link to the paper. http://cis.poly.edu/westlab/papers/cntdstrb/p426-broder.pdf A more recent application of the use and extension of the WAND operator for indexing of Boolean expressions: http://ilpubs.stanford.edu:8090/927/2/wand_vldb.pdf -- Joaquin
- Andrzej Bialecki: The functionality of WAND (weak AND) is already implemented in Lucene, if I understand it correctly - this is the BooleanQuery.setMinShouldMatch(int). Lucene implements this probably differently from the algorithm described in the paper, so there may be still some benefits from comparing the algorithms in Lucene's BooleanScorer with this one ... -- Best regards, Andrzej Bialecki <>< ___. ___ ___ ___ _ _ __________________________________ [__ || __|__/|__||\/| Information Retrieval, Semantic