|
|
|
|
|
by gpderetta
1965 days ago
|
|
If you do not need to do similarity searches, indexing over the (fixed size and numeric, possibly cryptographic) hash of the string might work. edit: but that will map to an uniform range, making interpolation trivial. As this solution can be used for any type, I'm probably missing something. The index discussed in the paper can probably be used for range queries (which hashing would prevent), not just punctual searches. edit: bah, I'm just reinventing an hash map. |
|