BWBEV: A Bitwise Query Processing Algorithm for Approximate Prefix Search
We tackle the challenge of conducting an approximate prefix search within datasets of strings. We explore using a bit-parallelism technique to compute the edit distance between distinct strings and illustrate its adaptation for an approximate prefix search procedure referred to as BWBEV. This techni...
| Authors: | , , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2024 |
| Country: | Brasil |
| Institution: | Sociedade Brasileira de Computação (SBC) |
| Repository: | Journal of the Brazilian Computer Society |
| Language: | English |
| OAI Identifier: | oai:journals-sol.sbc.org.br:article/4236 |
| Online Access: | https://journals-sol.sbc.org.br/index.php/jbcs/article/view/4236 |
| Access Level: | Open access |
| Keyword: | bit-parallelism autocomplete trie error tolerance |
| Summary: | We tackle the challenge of conducting an approximate prefix search within datasets of strings. We explore using a bit-parallelism technique to compute the edit distance between distinct strings and illustrate its adaptation for an approximate prefix search procedure referred to as BWBEV. This technique employs a unary representation of edit vectors alongside bitwise operations to efficiently update these vectors during the edit distance computation. We also show how to apply our new bit-parallelism technique strategy to online edit distance computation between strings without index structure. Our experiments with BWBEV applied to approximate prefix search for a query autocompletion task revealed a substantial acceleration of over 36% when contrasted against state-of-the-art methods. |
|---|