Search code examples
algorithmstring-matchingnearest-neighborlocality-sensitive-hash

Can Locality Sensitive Hashing used on dynamic data?


Can Locality Sensitive Hashing used on dynamic data? For example assume I use LSH first on a 1,000,000 documents and store the results on a index, then I want to add another document to the index created. Can I do it using LSH?


Solution

  • Yes.

    As lsh uses multiple hashes to generate multiple signatures, then this signatures banded to generate indexes. If you store the random hash functions and banding process, you can reuse that to generate index for the new insertion. Thus for every new insert you will have corresponding index