메뉴 건너뛰기




Volumn , Issue , 2006, Pages 188-194

Improving index compression using cluster information

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; INFORMATION RETRIEVAL SYSTEMS;

EID: 42549139273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2006.96     Document Type: Conference Paper
Times cited : (2)

References (21)
  • 1
    • 8644260524 scopus 로고    scopus 로고
    • Index compression using fixed binary codewords
    • New Zealand
    • V. N. Anh, and A. Moffat, "Index compression using fixed binary codewords," In Proc. 15th Austr. DB Conf., New Zealand, 2004, pp. 61-67.
    • (2004) Proc. 15th Austr. DB Conf , pp. 61-67
    • Anh, V.N.1    Moffat, A.2
  • 2
    • 22044441103 scopus 로고    scopus 로고
    • Inverted Index Compression Using Word-Aligned Binary Codes
    • V. N. Anh, and A. Moffat, "Inverted Index Compression Using Word-Aligned Binary Codes," Info. Retrieval, vol. 8, No. 1, 2005, pp. 151-166.
    • (2005) Info. Retrieval , vol.8 , Issue.1 , pp. 151-166
    • Anh, V.N.1    Moffat, A.2
  • 3
  • 4
    • 0029227603 scopus 로고
    • Modeling word occurrences for the compression of concordances,
    • UT
    • A. Bookstein, S. Klein, and T. Raita, "Modeling word occurrences for the compression of concordances, " In Proc. IEEE Data Compr. Conf., UT, 1995, pp. 462-462.
    • (1995) Proc. IEEE Data Compr. Conf , pp. 462-462
    • Bookstein, A.1    Klein, S.2    Raita, T.3
  • 5
    • 0016486577 scopus 로고
    • Universal codeword sets and representation of the integers
    • P. Elias, "Universal codeword sets and representation of the integers," IEEE Trans. on Infor. Theory, vol. 21 No. 2, 1975, pp. 194-203.
    • (1975) IEEE Trans. on Infor. Theory , vol.21 , Issue.2 , pp. 194-203
    • Elias, P.1
  • 6
    • 84930881609 scopus 로고
    • Run-length encodings
    • S. Golomb, "Run-length encodings," IEEE Trans. on Info. Theory, vol. 12 No. 3, 1966, pp. 399-401.
    • (1966) IEEE Trans. on Info. Theory , vol.12 , Issue.3 , pp. 399-401
    • Golomb, S.1
  • 7
    • 42549086957 scopus 로고    scopus 로고
    • D. Hawking D, E. Voorhees, N. Craswell, and P. Bailey, Overview of the TREC-8 Web Track, In Proc. of the 8th TREC, NIST Special Pub. 500-246, 2000, pp. 131-150.
    • D. Hawking D, E. Voorhees, N. Craswell, and P. Bailey, "Overview of the TREC-8 Web Track," In Proc. of the 8th TREC, NIST Special Pub. 500-246, 2000, pp. 131-150.
  • 9
    • 0004990868 scopus 로고    scopus 로고
    • Binary interpolative coding for effective index compression
    • A. Moffat and L. Stuiver, "Binary interpolative coding for effective index compression," Information Retrieval, vol. 3 No. 1, 2000, pp. 25-47.
    • (2000) Information Retrieval , vol.3 , Issue.1 , pp. 25-47
    • Moffat, A.1    Stuiver, L.2
  • 10
    • 0000777673 scopus 로고    scopus 로고
    • Text database and information retrieval
    • E. Rillof and L. Hollaar, "Text database and information retrieval," ACM Comput. Surveys, vol. 28 No. 1, 1996, pp. 133-135.
    • (1996) ACM Comput. Surveys , vol.28 , Issue.1 , pp. 133-135
    • Rillof, E.1    Hollaar, L.2
  • 11
    • 0036989596 scopus 로고    scopus 로고
    • Compression of inverted index for fast query evaluation
    • Finland
    • F. Scholer, H. E. Williams, H. Yiannis, and J. Zobel, "Compression of inverted index for fast query evaluation," In ACM SIGIR02, Finland, 2002, pp. 222-229.
    • (2002) ACM SIGIR02 , pp. 222-229
    • Scholer, F.1    Williams, H.E.2    Yiannis, H.3    Zobel, J.4
  • 12
    • 0037213772 scopus 로고    scopus 로고
    • Inverted file compression through document identifier reassignment
    • W. Y. Shieh, T. F. Chen, J. J. Shann, and C. P. Chung, " Inverted file compression through document identifier reassignment," Info. Procs. and Management, vol. 39 No. 1, 2003, pp. 117-131.
    • (2003) Info. Procs. and Management , vol.39 , Issue.1 , pp. 117-131
    • Shieh, W.Y.1    Chen, T.F.2    Shann, J.J.3    Chung, C.P.4
  • 14
    • 3843079609 scopus 로고    scopus 로고
    • Compressing inverted files
    • A. Trotman, "Compressing inverted files," Information Retrieval, vol. 6, pp. 5-19, 2003.
    • (2003) Information Retrieval , vol.6 , pp. 5-19
    • Trotman, A.1
  • 15
    • 0032654288 scopus 로고    scopus 로고
    • Compressing integers for fast file access
    • H. E. Williams and J. Zobel, "Compressing integers for fast file access," The Computer Journal, vol. 42 No. 3, 1999, pp. 193-201.
    • (1999) The Computer Journal , vol.42 , Issue.3 , pp. 193-201
    • Williams, H.E.1    Zobel, J.2
  • 17
    • 0032268976 scopus 로고    scopus 로고
    • Inverted files versus signature files for text indexing
    • J. Zobel, A. Moffat, and K. Ramamohanarao, "Inverted files versus signature files for text indexing", ACM Trans. on DB Systems, vol 23 No. 4, 1998, pp. 453-490.
    • (1998) ACM Trans. on DB Systems , vol.23 , Issue.4 , pp. 453-490
    • Zobel, J.1    Moffat, A.2    Ramamohanarao, K.3
  • 18
    • 0024680467 scopus 로고
    • Algorithm 673: Dynamic Huffman coding
    • J. S. Vitter, "Algorithm 673: Dynamic Huffman coding," ACM Transactions on Mathematical Software, vol. 15 No. 2,1989, pp. 158-167.
    • (1989) ACM Transactions on Mathematical Software , vol.15 , Issue.2 , pp. 158-167
    • Vitter, J.S.1
  • 19
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes,
    • D. A. Huffman, "A method for the construction of minimum-redundancy codes, " in Proc. Int. Radio Engineers, vol. 40 No. 9, 1952, pp. 1098-1101.
    • (1952) Proc. Int. Radio Engineers , vol.40 , Issue.9 , pp. 1098-1101
    • Huffman, D.A.1
  • 21
    • 0031702904 scopus 로고    scopus 로고
    • A fast renormalization for arithmetic coding,
    • Los Alamitos, CA
    • M. Schindler, " A fast renormalization for arithmetic coding, " In Proc. 1998 IEE Data Compression Conf., Los Alamitos, CA, 1998, pp 572.
    • (1998) Proc. 1998 IEE Data Compression Conf , pp. 572
    • Schindler, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.