OPTIMAL RETRIEVAL ALGORITHMS FOR SMALL REGION QUERIES

被引:13
作者
BOLOUR, A
机构
关键词
D O I
10.1137/0210056
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:721 / 741
页数:21
相关论文
共 24 条
[1]  
Aho A. V., 1979, ACM Transactions on Database Systems, V4, P168, DOI 10.1145/320071.320074
[2]  
BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797
[3]  
BENTLEY JL, 1979, INFORM PROCESS LETT, V8, P133
[4]   EFFICIENT WORST-CASE DATA-STRUCTURES FOR RANGE SEARCHING [J].
BENTLEY, JL ;
MAURER, HA .
ACTA INFORMATICA, 1980, 13 (02) :155-168
[5]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[6]   OPTIMALITY PROPERTIES OF MULTIPLE-KEY HASHING FUNCTIONS [J].
BOLOUR, A .
JOURNAL OF THE ACM, 1979, 26 (02) :196-210
[7]  
BOLOUR A, 1977, THESIS U CALIFORNIA
[8]  
Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933
[9]   HASHING FUNCTIONS [J].
KNOTT, GD .
COMPUTER JOURNAL, 1975, 18 (03) :265-278
[10]  
Knuth D.E., 1972, ART COMPUTER PROGRAM, V3