New Paper: On the application of Bloom Filter Hierarchies representing
Sub-word Token Bigram Occurrence to Probabilistic Full Text Search
This is a note regarding a prototype I've been working on for a few months in the domain of Decentralized Search (and Indexing)
It covers a data structure with interesting properties that I've been playing with, and documents some experiments regarding naive full text search performance.
Comments/questions/critique welcome.
PDF: https://sarahjamielewis.com/decentralization/search/ftsbloom.pdf
Sarah Jamie Lewis /
npub14m…vp58n
2024-05-29 23:22:05
Author Public Key
npub14mfj9wu5ujvu6rxj8w62dvkvqj7myqc6kz0upz3kuw3wx4dz9vgstvp58nPublished at
2024-05-29 23:22:05Event JSON
{
"id": "1b934db44f1e75774eb9f5998b495b2875a6f6e216a55d783bb6ea936b1e850d",
"pubkey": "aed322bb94e499cd0cd23bb4a6b2cc04bdb2031ab09fc08a36e3a2e355a22b11",
"created_at": 1717024925,
"kind": 1,
"tags": [
[
"proxy",
"https://mastodon.social/users/sarahjamielewis/statuses/112526945518929306",
"activitypub"
]
],
"content": "New Paper: On the application of Bloom Filter Hierarchies representing\nSub-word Token Bigram Occurrence to Probabilistic Full Text Search\n\nThis is a note regarding a prototype I've been working on for a few months in the domain of Decentralized Search (and Indexing)\n\nIt covers a data structure with interesting properties that I've been playing with, and documents some experiments regarding naive full text search performance.\n\nComments/questions/critique welcome.\n\nPDF: https://sarahjamielewis.com/decentralization/search/ftsbloom.pdf",
"sig": "134eb0af575e5e6e3ae578af0f89778f1eafc4dc755526da20cadf6ce6a495dcd289939fd1eb2efd5ff36840d362ad7a8d250b63da107b643586a87c3d33ed90"
}