Mendeley
TY  _  JOUR
ID  -  139606172256297965
TI  -  Speed up the Search for Proximity-Based Models
JO  -  Nashriyyah -i Muhandisi -i Barq va Muhandisi -i Kampyutar -i Iran
JA  -  ES
LA  -  fa
SN  -  16823745
AU  -  Paksima J.
AU  -  Zare-Bidoki Ali-Mohammad
AU  -  Derhami Vali
AD  -  دانشگاه يزد
AD  -  دانشگاه یزد
AD  -  Yazd University
Y1  -  2017
PY  -  2017
VL  -  2
IS  -  
SP  -  153
EP  -  158
KW  -  Ranking
KW  -   pruning
proximity
the search engine
DO  -  
N2  -  One of the main challenges in the proximity models is the speed of data retrieval. These models define a distance concept which is calculated based on the positions of query terms in the documents. This means that finding the positions and calculating the distance is a time consuming process and because it usually executed during the search time it has a special importance to users. If we can reduce the number of documents, retrieval process becomes faster. In this paper, the SNTK3 algorithm is proposed to prune documents dynamically. To avoid allocating too much memory and reducing the risk of errors during the retrieval, some documents' scores are calculated without any pruning (Skip-N). The SNTK3 algorithm uses three pyramids to extract documents with the highest scores. Experiments show that the proposed algorithm can improve the speed of retrieval.
UR  - rimag.ir/en/Article/28257
L1  - rimag.ir/en/Article/Download/28257
ER  -  
