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...

Descripción completa

Detalles Bibliográficos
Autores: Moura, Edleno S. de, Ferreira, Berg, da Silva, Altigran, Baeza Yates, Ricardo
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2024
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10230/71410
Acceso en línea:http://hdl.handle.net/10230/71410
http://dx.doi.org/10.5753/jbcs.2024.4236
Access Level:acceso abierto
Palabra clave:Bit-parallelism
Autocomplete
Trie
Error tolerance
id ES_e146f7e9740f7c1b54d596af7c5cfd1d
oai_identifier_str oai:recercat.cat:10230/71410
network_acronym_str ES
network_name_str España
repository_id_str
spelling BWBEV: a bitwise query processing algorithm for approximate prefix searchMoura, Edleno S. deFerreira, Bergda Silva, AltigranBaeza Yates, RicardoBit-parallelismAutocompleteTrieError toleranceWe 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.Sociedade Brasileira de Computação202520252024info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/71410http://dx.doi.org/10.5753/jbcs.2024.4236http://hdl.handle.net/10230/71410reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésJournal of the Brazilian Computer Society. 2024 Oct 27;30(1):527-41Copyright (c) 2024 Edleno S. de Moura, Berg Ferreira, Altigran da Silva, Ricardo Baeza-Yates. This work is licensed under a Creative Commons Attribution 4.0 International License.http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:recercat.cat:10230/714102026-05-29T05:05:01Z
dc.title.none.fl_str_mv BWBEV: a bitwise query processing algorithm for approximate prefix search
title BWBEV: a bitwise query processing algorithm for approximate prefix search
spellingShingle BWBEV: a bitwise query processing algorithm for approximate prefix search
Moura, Edleno S. de
Bit-parallelism
Autocomplete
Trie
Error tolerance
title_short BWBEV: a bitwise query processing algorithm for approximate prefix search
title_full BWBEV: a bitwise query processing algorithm for approximate prefix search
title_fullStr BWBEV: a bitwise query processing algorithm for approximate prefix search
title_full_unstemmed BWBEV: a bitwise query processing algorithm for approximate prefix search
title_sort BWBEV: a bitwise query processing algorithm for approximate prefix search
dc.creator.none.fl_str_mv Moura, Edleno S. de
Ferreira, Berg
da Silva, Altigran
Baeza Yates, Ricardo
author Moura, Edleno S. de
author_facet Moura, Edleno S. de
Ferreira, Berg
da Silva, Altigran
Baeza Yates, Ricardo
author_role author
author2 Ferreira, Berg
da Silva, Altigran
Baeza Yates, Ricardo
author2_role author
author
author
dc.subject.none.fl_str_mv Bit-parallelism
Autocomplete
Trie
Error tolerance
topic Bit-parallelism
Autocomplete
Trie
Error tolerance
description 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.
publishDate 2024
dc.date.none.fl_str_mv 2024
2025
2025
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/71410
http://dx.doi.org/10.5753/jbcs.2024.4236
http://hdl.handle.net/10230/71410
url http://hdl.handle.net/10230/71410
http://dx.doi.org/10.5753/jbcs.2024.4236
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Journal of the Brazilian Computer Society. 2024 Oct 27;30(1):527-41
dc.rights.none.fl_str_mv http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422277978750976
score 15.812429

Similares en LA Referencia