Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
susam
64 days ago
|
parent
|
context
|
favorite
| on:
Bloom filters are good for search that does not sc...
What you've described here is an n-gram inverted index (with n = 2) represented as a bitset. We could call it a
bigram bitset inverted index
. Glad to know you designed and implemented all of this from first principles, and that it serves you well!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: