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...
| Autores: | , , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2024 |
| País: | España |
| Recursos: | Universitat Pompeu Fabra |
| Repositório: | Repositorio Digital de la UPF |
| OAI Identifier: | oai:repositori.upf.edu:10230/71410 |
| Acesso em linha: | http://hdl.handle.net/10230/71410 http://dx.doi.org/10.5753/jbcs.2024.4236 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Bit-parallelism Autocomplete Trie Error tolerance |
| Resumo: | 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. |
|---|