ALGORITHMS FOR BD TREES

[1] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517

[2] UBIQUITOUS B-TREE [J]. COMPUTING SURVEYS, 1979, 11 (02) : 121 - 137

[3] AN EMPIRICAL PERFORMANCE COMPARISON OF SOME VARIATIONS OF THE K-D TREE AND BD TREE [J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1985, 14 (03): : 135 - 159

[4] DANDAMUDI SP, 1984, THESIS U SASKATCHEWA

[5] DANDAMUDI SP, 1986, 865 U SASK DEP COMP

[6] Knuth D. E., 1973, ART COMPUTER PROGRAM

[7] LOOMIS MES, 1983, DATA MANAGEMENT FILE

[8] Ohsawa Y., 1983, Information Processing 83. Proceedings of the IFIP 9th World Computer Congress, P539

[9] MULTIDIMENSIONAL TRIES USED FOR ASSOCIATIVE SEARCHING [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (04) : 150 - 157

[10] Rivest R. L., 1976, SIAM Journal on Computing, V5, P19, DOI 10.1137/0205003

[1] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517

[2] UBIQUITOUS B-TREE [J]. COMPUTING SURVEYS, 1979, 11 (02) : 121 - 137

[3] AN EMPIRICAL PERFORMANCE COMPARISON OF SOME VARIATIONS OF THE K-D TREE AND BD TREE [J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1985, 14 (03): : 135 - 159

[4] DANDAMUDI SP, 1984, THESIS U SASKATCHEWA

[5] DANDAMUDI SP, 1986, 865 U SASK DEP COMP

[6] Knuth D. E., 1973, ART COMPUTER PROGRAM

[7] LOOMIS MES, 1983, DATA MANAGEMENT FILE

[8] Ohsawa Y., 1983, Information Processing 83. Proceedings of the IFIP 9th World Computer Congress, P539

[9] MULTIDIMENSIONAL TRIES USED FOR ASSOCIATIVE SEARCHING [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (04) : 150 - 157

[10] Rivest R. L., 1976, SIAM Journal on Computing, V5, P19, DOI 10.1137/0205003