SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Pesquisa operacional (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200423 |
Resumo: | Hash tables are among the most important data structures known to mankind. Throughhashing, the address of each stored object is calculated as a function of the object's contents. Because they do not require exorbitant space and, in practice, allow for constant-time dictionary operations (insertion, lookup, deletion), hash tables are often employed in the indexation of large amounts of data. Nevertheless, there are numerous problems of somewhat different nature that can be solved in elegant fashion using hashing, with significant economy of time and space. The purpose of this paper is to reinforce the applicability of such technique in the area of Operations Research and to stimulate further reading, for which adequate references are given. To our knowledge, the proposed solutions to the problems presented herein have never appeared in the literature, and some of the problems are novel themselves. |
id |
SOBRAPO-1_daa8dc15adf788387f278f29766c2131 |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382015000200423 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLEShash tablesefficient algorithmspractical algorithmsaverage-time complexityHash tables are among the most important data structures known to mankind. Throughhashing, the address of each stored object is calculated as a function of the object's contents. Because they do not require exorbitant space and, in practice, allow for constant-time dictionary operations (insertion, lookup, deletion), hash tables are often employed in the indexation of large amounts of data. Nevertheless, there are numerous problems of somewhat different nature that can be solved in elegant fashion using hashing, with significant economy of time and space. The purpose of this paper is to reinforce the applicability of such technique in the area of Operations Research and to stimulate further reading, for which adequate references are given. To our knowledge, the proposed solutions to the problems presented herein have never appeared in the literature, and some of the problems are novel themselves.Sociedade Brasileira de Pesquisa Operacional2015-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200423Pesquisa Operacional v.35 n.2 2015reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2015.035.02.0423info:eu-repo/semantics/openAccessBento,Lucila Maria de SouzaSá,Vinícius Gusmão Pereira deSzwarcfiter,Jayme Luizeng2015-07-27T00:00:00Zoai:scielo:S0101-74382015000200423Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2015-07-27T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
title |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
spellingShingle |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES Bento,Lucila Maria de Souza hash tables efficient algorithms practical algorithms average-time complexity |
title_short |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
title_full |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
title_fullStr |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
title_full_unstemmed |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
title_sort |
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES |
author |
Bento,Lucila Maria de Souza |
author_facet |
Bento,Lucila Maria de Souza Sá,Vinícius Gusmão Pereira de Szwarcfiter,Jayme Luiz |
author_role |
author |
author2 |
Sá,Vinícius Gusmão Pereira de Szwarcfiter,Jayme Luiz |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Bento,Lucila Maria de Souza Sá,Vinícius Gusmão Pereira de Szwarcfiter,Jayme Luiz |
dc.subject.por.fl_str_mv |
hash tables efficient algorithms practical algorithms average-time complexity |
topic |
hash tables efficient algorithms practical algorithms average-time complexity |
description |
Hash tables are among the most important data structures known to mankind. Throughhashing, the address of each stored object is calculated as a function of the object's contents. Because they do not require exorbitant space and, in practice, allow for constant-time dictionary operations (insertion, lookup, deletion), hash tables are often employed in the indexation of large amounts of data. Nevertheless, there are numerous problems of somewhat different nature that can be solved in elegant fashion using hashing, with significant economy of time and space. The purpose of this paper is to reinforce the applicability of such technique in the area of Operations Research and to stimulate further reading, for which adequate references are given. To our knowledge, the proposed solutions to the problems presented herein have never appeared in the literature, and some of the problems are novel themselves. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015-08-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200423 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200423 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0101-7438.2015.035.02.0423 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
dc.source.none.fl_str_mv |
Pesquisa Operacional v.35 n.2 2015 reponame:Pesquisa operacional (Online) instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) instacron:SOBRAPO |
instname_str |
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
instacron_str |
SOBRAPO |
institution |
SOBRAPO |
reponame_str |
Pesquisa operacional (Online) |
collection |
Pesquisa operacional (Online) |
repository.name.fl_str_mv |
Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
repository.mail.fl_str_mv |
||sobrapo@sobrapo.org.br |
_version_ |
1750318017808433152 |