3 ms·

Project Dev here, if you'd be willing to help me with that part I would be greatful. When I talk about "fast" I mean all searches are O(1) due to the magic of h

Project Dev here, if you'd be willing to help me with that part I would be greatful. When I talk about "fast" I mean all searches are O(1) due to the magic of hash maps.

rurban 7y ago
Fast FTS use reverse indices with trigrams, not primitive hash maps.
- vram22 7y ago
  Any links to papers or docs about that? Interested.