NEW DATA-STRUCTURES FOR ORTHOGONAL RANGE QUERIES

被引：87

作者：

WILLARD, DE ^{[1
]}

机构：

[1] HARVARD UNIV,CAMBRIDGE,MA 02138

来源：

关键词：

D O I：

10.1137/0214019

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：232 / 253

页数：22

共 47 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

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

[3]

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

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

BENTLEY, JL ;

MAURER, HA .

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

BENTLEY, JL .

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, P122, DOI 10.1109/SFCS.1983.17

[10]

COLE R, 1984, 25TH IEEE S F COMP S, P112