메뉴 건너뛰기




Volumn 9, Issue 2, 1997, Pages 302-313

Text compression for dynamic document databases

Author keywords

Document databases; Dynamic databases; Huffman coding; Text compression; Word based compression

Indexed keywords

TEXT COMPRESSION;

EID: 0031102365     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.591454     Document Type: Article
Times cited : (35)

References (24)
  • 1
    • 0022036177 scopus 로고
    • Access Methods for Text
    • C. Faloutsos, "Access Methods for Text," Computing Surveys, vol. 17, no. 1, pp. 49-74, 1985.
    • (1985) Computing Surveys , vol.17 , Issue.1 , pp. 49-74
    • Faloutsos, C.1
  • 3
    • 0022698885 scopus 로고
    • A Locally Adaptive Data Compression Scheme
    • Apr.
    • J. Bentley, D. Sleator, R. Tarjan, and V. Wei, "A Locally Adaptive Data Compression Scheme," Comm. ACM, vol. 29, no. 4, pp. 320-330, Apr. 1986.
    • (1986) Comm. ACM , vol.29 , Issue.4 , pp. 320-330
    • Bentley, J.1    Sleator, D.2    Tarjan, R.3    Wei, V.4
  • 4
    • 0024606846 scopus 로고
    • Word Based Text Compression
    • Feb.
    • A. Moffat, "Word Based Text Compression," Software - Practice and Experience, vol. 19, no. 2, pp. 185-198, Feb. 1989.
    • (1989) Software - Practice and Experience , vol.19 , Issue.2 , pp. 185-198
    • Moffat, A.1
  • 5
    • 0026393802 scopus 로고
    • Indexing and Compressing Full-Text Databases for CD-ROM
    • I.H. Witten, T.C. Bell, and C.G. Nevill, "Indexing and Compressing Full-Text Databases for CD-ROM," J. Information Science, vol. 17, pp. 265-271, 1992.
    • (1992) J. Information Science , vol.17 , pp. 265-271
    • Witten, I.H.1    Bell, T.C.2    Nevill, C.G.3
  • 6
    • 84959015234 scopus 로고
    • Constructing Word-Based Text Compression Algorithms
    • J.A. Storer and M. Cohn, eds., Snowbird, Utah, IEEE CS Press, Los Alamitos, Calif., Mar.
    • R.N. Horspool and G.V. Cormack, "Constructing Word-Based Text Compression Algorithms," J.A. Storer and M. Cohn, eds., pp. 62-81, Proc. IEEE Data Compression Conf., Snowbird, Utah, IEEE CS Press, Los Alamitos, Calif., Mar. 1992
    • (1992) Proc. IEEE Data Compression Conf. , pp. 62-81
    • Horspool, R.N.1    Cormack, G.V.2
  • 7
    • 84938015047 scopus 로고
    • ;A Method for the Construction of Minimum-Redundancy Codes
    • Sept.
    • D.A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes," Proc. Inst. Radio Engineers, vol. 40, no. 9, pp. 1,098-1,101, Sept. 1952.
    • (1952) Proc. Inst. Radio Engineers , vol.40 , Issue.9
    • Huffman, D.A.1
  • 8
    • 0025419122 scopus 로고
    • Efficient Decoding of Prefix Codes
    • Apr.
    • D. Hirschberg and D. Lelewer, "Efficient Decoding of Prefix Codes," Comm. ACM, vol. 33, no. 4, pp. 449-459, Apr. 1990.
    • (1990) Comm. ACM , vol.33 , Issue.4 , pp. 449-459
    • Hirschberg, D.1    Lelewer, D.2
  • 9
    • 0029359786 scopus 로고
    • Adding Compression to a Full-Text Retrieval System
    • Aug.
    • J. Zobel and A. Moffat, "Adding Compression to a Full-Text Retrieval System," Software - Practice and Experience, vol. 25, no. 8, pp. 891-903, Aug. 1995.
    • (1995) Software - Practice and Experience , vol.25 , Issue.8 , pp. 891-903
    • Zobel, J.1    Moffat, A.2
  • 11
    • 0041619493 scopus 로고
    • A Systematic Approach to Compressing a Full-Text Retrieval System
    • A. Bookstein, S.T. Klein, and D.A. Ziff, "A Systematic Approach to Compressing a Full-Text Retrieval System," Information Processing and Management, vol. 28, no. 6, pp. 795-806, 1992.
    • (1992) Information Processing and Management , vol.28 , Issue.6 , pp. 795-806
    • Bookstein, A.1    Klein, S.T.2    Ziff, D.A.3
  • 12
    • 84856043672 scopus 로고
    • A Mathematical Theory of Communication
    • C.E. Shannon, "A Mathematical Theory of Communication," Bel Systems Technical J., vol. 27, pp. 379-423, 623-656, 1948.
    • (1948) Bel Systems Technical J. , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 13
    • 0026759927 scopus 로고
    • Tight Upper Bounds on the Redundancy of Huffman Codes
    • Jan.
    • D. Manstetten, "Tight Upper Bounds on the Redundancy of Huffman Codes," IEEE Trans. Information Theory, vol. 38, no. 1, pp. 144-151, Jan. 1992.
    • (1992) IEEE Trans. Information Theory , vol.38 , Issue.1 , pp. 144-151
    • Manstetten, D.1
  • 14
    • 0002565067 scopus 로고
    • Overview of the First Text Retrieval Conference
    • D.K. Harman, ed., National Institute of Standards Special Publication, Nov.
    • D.K. Harman, "Overview of the First Text Retrieval Conference," Proc. TREC Text Retrieval Conf., D.K. Harman, ed., pp. 1-20, National Institute of Standards Special Publication, Nov. 1992.
    • (1992) Proc. TREC Text Retrieval Conf. , pp. 1-20
    • Harman, D.K.1
  • 15
    • 0005725452 scopus 로고
    • An Empirical Evaluation of Coding Methods for Multi-Symbol Alphabets
    • Nov.
    • A. Moffat, N. Sharman, I.H. Witten, and T.C. Bell, "An Empirical Evaluation of Coding Methods for Multi-Symbol Alphabets," Information Processing and Management, vol. 30, no. 6, pp. 791-804, Nov. 1994.
    • (1994) Information Processing and Management , vol.30 , Issue.6 , pp. 791-804
    • Moffat, A.1    Sharman, N.2    Witten, I.H.3    Bell, T.C.4
  • 16
    • 0016486577 scopus 로고
    • Universal Code Word Sets and Representations of the Integers
    • Mar.
    • P. Elias, "Universal Code Word Sets and Representations of the Integers," IEEE Trans. Information Theory, vol. 21, no. 2, pp. 194-203, Mar. 1975.
    • (1975) IEEE Trans. Information Theory , vol.21 , Issue.2 , pp. 194-203
    • Elias, P.1
  • 18
    • 33747617372 scopus 로고
    • The Distribution of Prefix Overlap in Consecutive Dictionary Entries
    • July
    • R. Simion and H.S. Wilf, "The Distribution of Prefix Overlap in Consecutive Dictionary Entries," SIAM J. Applied and Discrete Methods, vol. 7, pp. 470-475, July 1986.
    • (1986) SIAM J. Applied and Discrete Methods , vol.7 , pp. 470-475
    • Simion, R.1    Wilf, H.S.2
  • 19
    • 79959936285 scopus 로고
    • An Extremely Fast Ziv-Lempel Data Compression Algorithm
    • J.A. Storer and J.H. Reif, eds., Snowbird, Utah, IEEE CS Press, Los Alamitos, Calif., Apr.
    • R.N. Williams, "An Extremely Fast Ziv-Lempel Data Compression Algorithm," Proc. IEEE Data Compression Conf., J.A. Storer and J.H. Reif, eds., Snowbird, Utah, pp. 362-371, IEEE CS Press, Los Alamitos, Calif., Apr. 1991.
    • (1991) Proc. IEEE Data Compression Conf. , pp. 362-371
    • Williams, R.N.1
  • 20
    • 0023364261 scopus 로고
    • Arithmetic Coding for Data Compression
    • June
    • I.H. Witten, R. Neal, and J.G. Cleary, "Arithmetic Coding for Data Compression," Comm. ACM, vol. 30, no. 6, pp. 520-541, June 1987.
    • (1987) Comm. ACM , vol.30 , Issue.6 , pp. 520-541
    • Witten, I.H.1    Neal, R.2    Cleary, J.G.3
  • 21
    • 0021439618 scopus 로고
    • A Technique for High Performance Data Compression
    • June
    • T.A. Welch, "A Technique for High Performance Data Compression," Computer, vol. 17, no. 6, pp. 8-20, June 1984.
    • (1984) Computer , vol.17 , Issue.6 , pp. 8-20
    • Welch, T.A.1
  • 22
    • 0023536787 scopus 로고
    • Data Compression Using Dynamic Markov Modeling
    • Dec.
    • G.V. Cormack and R.N. Horspool, "Data Compression Using Dynamic Markov Modeling," Computer J., vol. 30, no. 6, pp. 541-550, Dec. 1987.
    • (1987) Computer J. , vol.30 , Issue.6 , pp. 541-550
    • Cormack, G.V.1    Horspool, R.N.2
  • 23
    • 0021405335 scopus 로고
    • Data Compression Using Adaptive Coding and Partial String Matching
    • Apr.
    • J.G. Cleary and I.H. Witten, "Data Compression Using Adaptive Coding and Partial String Matching," IEEE Trans. Comm., vol. 32, pp. 396-402, Apr. 1984.
    • (1984) IEEE Trans. Comm. , vol.32 , pp. 396-402
    • Cleary, J.G.1    Witten, I.H.2
  • 24
    • 0030260359 scopus 로고    scopus 로고
    • Self-Indexing Inverted Files for Fast Text Retrieval
    • Oct.
    • A. Moffat and J. Zobel, "Self-Indexing Inverted Files for Fast Text Retrieval," ACM Trans. Information Systems, vol. 14, no. 4, pp. 349-379, Oct. 1996.
    • (1996) ACM Trans. Information Systems , vol.14 , Issue.4 , pp. 349-379
    • Moffat, A.1    Zobel, J.2


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