FILTERING SEARCH - A NEW APPROACH TO QUERY-ANSWERING

被引：171

作者：

CHAZELLE, B

机构：

来源：

关键词：

D O I：

10.1137/0215051

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：703 / 724

页数：22

共 37 条

[1]

AVID Z, 1981, 22ND P ANN S F COMP, P123

[2]

BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797

[3]

BENTLEY JL, 1979, INFORM PROCESS LETT, V8, P133

[4]

BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628

[5] EFFICIENT WORST-CASE DATA-STRUCTURES FOR RANGE SEARCHING [J].

BENTLEY, JL ;

MAURER, HA .

[6] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].

BENTLEY, JL .

[7]

BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301

[8] OPTIMAL RETRIEVAL ALGORITHMS FOR SMALL REGION QUERIES [J].

BOLOUR, A .

[9]

Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P217, DOI 10.1109/SFCS.1983.75

[10] AN IMPROVED ALGORITHM FOR THE FIXED-RADIUS NEIGHBOR PROBLEM [J].

CHAZELLE, B .