2026-04-13T01:20:18Zhttps://recercat.cat/oai/request

oai:recercat.cat:10230/714102025-10-10T19:28:02Zcom_2072_6col_2072_452952

00925njm 22002777a 4500 dc Moura, Edleno S. de author Ferreira, Berg author da Silva, Altigran author Baeza Yates, Ricardo author 2025-10-07T06:10:51Z 2025-10-07T06:10:51Z 2024 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. http://hdl.handle.net/10230/71410 Bit-parallelism Autocomplete Trie Error tolerance BWBEV: a bitwise query processing algorithm for approximate prefix search