COMPARISON OF ALGORITHMS FOR DATA BASE COMPRESSION BY USE OF FRAGMENTS AS LANGUAGE ELEMENTS

被引：44

作者：

SCHUEGRAF, EJ

HEAPS, HS

机构：

[1] UNIV ALBERTA,DEPT COMP SCI,EDMONTON,ALBERTA,CANADA

[2] SIR GEORGE WILLIAMS UNIV,DEPT COMP SCI,MONTREAL,QUEBEC,CANADA

来源：

INFORMATION STORAGE AND RETRIEVAL | 1974年 / 10卷 / 9-10期

关键词：

D O I：

10.1016/0020-0271(74)90069-2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：309 / 319

页数：11

共 18 条

[1]

BOOTHROYD J, 1967, COMPUT J, V10, P306

[2] EVALUATION AND SELECTION OF FILE ORGANIZATION - MODEL AND SYSTEM [J].

CARDENAS, AF .

COMMUNICATIONS OF THE ACM, 1973, 16 (09) :540-548

[3] IDENTIFICATION OF VARIABLE-LENGTH, EQUIFREQUENT CHARACTER STRINGS IN A NATURAL LANGUAGE DATA BASE [J].

CLARE, AC ;

COOK, EM ;

LYNCH, MF .

COMPUTER JOURNAL, 1972, 15 (03) :259-&

[4]

DIMSDALE JJ, 1973, J LIBR AUTOMAT, V6, P37

[5]

GILBERT EN, 1959, BELL SYS TECH J, V38, P913

[6]

Heaps H. S, 1972, INFOR INFORM SYSTEMS, V10, P47

[7] OPTIMUM PROCEDURES FOR ECONOMIC INFORMATION RETRIEVAL [J].

HEAPS, HS ;

THIEL, LH .

INFORMATION STORAGE AND RETRIEVAL, 1970, 6 (02) :137-&

[8] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[9] FINDING SHORTEST ROUTE BETWEEN 2 POINTS IN A NETWORK [J].

NICHOLSO.TA .

COMPUTER JOURNAL, 1966, 9 (03) :275-&

[10]

NUGENT WR, 1962, AD272401 NTIS TECH R

← 1 2 →