년 - 년
4,200원
Fast Arabic Query Matching for Compressed Arabic Inverted Indices
보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.5 No.4 2012.12 pp.81-94
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
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.
Lossless Audio Coding using Integer DCT
[Kisti 연계] 대한전자공학회 대한전자공학회 학술대회논문집 2004 pp.114-117
※ 협약을 통해 무료로 제공되는 자료로, 원문이용 방식은 연계기관의 정책을 따르고 있습니다.
This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.