earticle

논문검색

Fast Arabic Query Matching for Compressed Arabic Inverted Indices

초록

영어

Information retrieval systems and Web search engines apply highly optimized techniques for compressing inverted indices. These techniques reduce index sizes and improve the performance of query processing that uses compressed indices to find relevant documents for the users' queries. In this paper, we proposed a novel technique for querying compressed Arabic inverted indices in search engines. The technique depends on encoding Arabic terms stored in the inverted indices of Web search engines and information retrieval systems. This minimizes the storage space required for those terms in the index and decrease the number of comparisons needed for query matching in the query processing stage. The number of comparisons is decreased by minimizing the number of bytes that represent the terms in the index and applying the same encoding technique to the keywords of the query. The results showed a 38% reduction in total size of the index. The average number of comparisons to find a word is also decreased in the new index. Both sequential and binary searches were decreased by: 13.58%, and 38.63% respectively relative to the total number of comparisons of each keyword in the query.

목차

Abstract
 1. Introduction
 2. Related Work
 2 Methodology and Approaches
 3. Experimental Results
 4. Conclusions and Future Work
 Acknowledgement
 References

저자정보

  • Ameen A. Al-Jedady Dept. of Computer Information Systems, IT & CS Faculty, Yarmouk University, Irbid, Jordan
  • Mohammed N. Al-Kabi Faculty of Sciences and IT, Zarqa University, Zarqa, Jordan
  • Izzat M. Alsmadi Dept. of Computer Information Systems, IT & CS Faculty, Yarmouk University, Irbid, Jordan

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.