01961nas a2200253   4500000000100000000000100001008004100002260001200043653001500055653002600070653001800096653000900114653002100123653001000144100002700154700001900181700002000200245008500220856009900305300001000404490000600414520127300420022001401693       2019                            d  c12/201910aEvaluation10aInformation Retrieval10aInverted List10aWAND10aQuery Processing10aTop-k1 aZemani Imene Mansouria1 aZekri Lougmiri1 aSenouci Mohamed00aMWAND: A New Early Termination Algorithm for Fast and Efficient Query Evaluation  uhttps://www.ijimai.org/journal/sites/default/files/files/2019/04/ijimai20195_7_6_pdf_83440.pdf  a57-690 v53 aNowadays, current information systems are so large and maintain huge amount of data. At every time, they process millions of documents and millions of queries. In order to choose the most important responses from this amount of data, it is well to apply what is so called early termination algorithms. These ones attempt to extract the Top-K documents according to a specified increasing monotone function. The principal idea behind is to reach and score the most significant less number of documents. So, they avoid fully processing the whole documents. WAND algorithm is at the state of the art in this area. Despite it is efficient, it is missing effectiveness and precision. In this paper, we propose two contributions, the principal proposal is a new early termination algorithm based on WAND approach, we call it MWAND (Modified WAND). This one is faster and more precise than the first. It has the ability to avoid unnecessary WAND steps. In this work, we integrate a tree structure as an index into WAND and we add new levels in query processing. In the second contribution, we define new fine metrics to ameliorate the evaluation of the retrieved information. The experimental results on real datasets show that MWAND is more efficient than the WAND approach.  a1989-1660