PARTIAL MATCH RETRIEVAL IN IMPLICIT DATA-STRUCTURES

[1] ALT H, 1982, CS8282 PENNS STAT U

[2] ALT H, 1981, LECTURE NOTES COMPUT, V118, P156

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

[4] IMPLICIT DATA-STRUCTURES FOR THE DICTIONARY PROBLEM [J]. JOURNAL OF THE ACM, 1983, 30 (01) : 80 - 94

[5] FREDERICKSON GN, 1980, IEEE FOCS, P255

[6] APPLICATION OF FINITE GEOMETRY IN FILE ORGANIZATION FOR RECORDS WITH MULTIPLE-VALUED ATTRIBUTES [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1968, 12 (02) : 180 - &

[7] MUNRO JI, 1979, 17TH P ANN ALL C

[8] MUNTO JI, 1980, J COMPUT SYSTEM SCI, V21, P236

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

[10] SHOULD TABLES BE SORTED [J]. JOURNAL OF THE ACM, 1981, 28 (03) : 615 - 628

[1] ALT H, 1982, CS8282 PENNS STAT U

[2] ALT H, 1981, LECTURE NOTES COMPUT, V118, P156

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

[4] IMPLICIT DATA-STRUCTURES FOR THE DICTIONARY PROBLEM [J]. JOURNAL OF THE ACM, 1983, 30 (01) : 80 - 94

[5] FREDERICKSON GN, 1980, IEEE FOCS, P255

[6] APPLICATION OF FINITE GEOMETRY IN FILE ORGANIZATION FOR RECORDS WITH MULTIPLE-VALUED ATTRIBUTES [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1968, 12 (02) : 180 - &

[7] MUNRO JI, 1979, 17TH P ANN ALL C

[8] MUNTO JI, 1980, J COMPUT SYSTEM SCI, V21, P236

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

[10] SHOULD TABLES BE SORTED [J]. JOURNAL OF THE ACM, 1981, 28 (03) : 615 - 628