MEDIAN SPLIT TREES - FAST LOOKUP TECHNIQUE FOR FREQUENTLY OCCURRING KEYS

被引：29

作者：

SHEIL, BA ^{[1
]}

机构：

[1] HARVARD UNIV, CAMBRIDGE, MA 02138 USA

来源：

关键词：

D O I：

10.1145/359642.359653

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：947 / 958

页数：12

共 9 条

[1]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[2]

KAY M, 1976, WORD RECOGNITION

[3]

Knuth D. E., 1971, Acta Informatica, V1, P14, DOI 10.1007/BF00264289

[4]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[5]

Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1

[6]

Kuera H., 1967, COMPUTATIONAL ANAL P

[7] COMPRESSED TRIES [J].

MALY, K .

SPRUGNOLI, R .

[9]

ZIPF GK, 1949, HUMAN BEHAVIOR PRINC