B-skip trees, a data structure between skip lists and B-trees

At a first look a skip-list is rather a collection of smartly connected linear linked list than a tree but they are, however, closely connected to trees. To prove it, we introduce random B-skip trees that inherit the performance rates of skip-lists. Moreover, we give a bijection between both data st...

Descripción completa

Detalles Bibliográficos
Autores: Gabarró Vallès, Joaquim|||0000-0003-3771-2813, Messeguer Peypoch, Xavier|||0000-0001-7430-4857
Tipo de recurso: informe técnico
Fecha de publicación:1994
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/96803
Acceso en línea:https://hdl.handle.net/2117/96803
Access Level:acceso abierto
Palabra clave:B-skip trees
Skip-lists
Àrees temàtiques de la UPC::Informàtica::Programació
id ES_83b8bcfb81bb3948627667caa0d9bfbc
oai_identifier_str oai:upcommons.upc.edu:2117/96803
network_acronym_str ES
network_name_str España
repository_id_str
spelling B-skip trees, a data structure between skip lists and B-treesGabarró Vallès, Joaquim|||0000-0003-3771-2813Messeguer Peypoch, Xavier|||0000-0001-7430-4857B-skip treesSkip-listsÀrees temàtiques de la UPC::Informàtica::ProgramacióAt a first look a skip-list is rather a collection of smartly connected linear linked list than a tree but they are, however, closely connected to trees. To prove it, we introduce random B-skip trees that inherit the performance rates of skip-lists. Moreover, we give a bijection between both data structures that commute with elementary operations. Random B-skip trees are randomized B-trees where the number of keys of an internal node is given by a geometrically distributed random variable with parameter p. A random B-skip tree with n keys and parameter p has a O(log_{1/p} n) expected height and (1-p)/ p expected number of keys in a node, consequently an update operation can be done in expected time O(log_{1/p} n). The expected number of split and join operations needed to insert or delete a key is independent of n and is equal to 1/(1-p).19941994-12-0120162016-11-18reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/96803reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/968032026-05-27T15:37:01Z
dc.title.none.fl_str_mv B-skip trees, a data structure between skip lists and B-trees
title B-skip trees, a data structure between skip lists and B-trees
spellingShingle B-skip trees, a data structure between skip lists and B-trees
Gabarró Vallès, Joaquim|||0000-0003-3771-2813
B-skip trees
Skip-lists
Àrees temàtiques de la UPC::Informàtica::Programació
title_short B-skip trees, a data structure between skip lists and B-trees
title_full B-skip trees, a data structure between skip lists and B-trees
title_fullStr B-skip trees, a data structure between skip lists and B-trees
title_full_unstemmed B-skip trees, a data structure between skip lists and B-trees
title_sort B-skip trees, a data structure between skip lists and B-trees
dc.creator.none.fl_str_mv Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Messeguer Peypoch, Xavier|||0000-0001-7430-4857
author Gabarró Vallès, Joaquim|||0000-0003-3771-2813
author_facet Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Messeguer Peypoch, Xavier|||0000-0001-7430-4857
author_role author
author2 Messeguer Peypoch, Xavier|||0000-0001-7430-4857
author2_role author
dc.subject.none.fl_str_mv B-skip trees
Skip-lists
Àrees temàtiques de la UPC::Informàtica::Programació
topic B-skip trees
Skip-lists
Àrees temàtiques de la UPC::Informàtica::Programació
description At a first look a skip-list is rather a collection of smartly connected linear linked list than a tree but they are, however, closely connected to trees. To prove it, we introduce random B-skip trees that inherit the performance rates of skip-lists. Moreover, we give a bijection between both data structures that commute with elementary operations. Random B-skip trees are randomized B-trees where the number of keys of an internal node is given by a geometrically distributed random variable with parameter p. A random B-skip tree with n keys and parameter p has a O(log_{1/p} n) expected height and (1-p)/ p expected number of keys in a node, consequently an update operation can be done in expected time O(log_{1/p} n). The expected number of split and join operations needed to insert or delete a key is independent of n and is equal to 1/(1-p).
publishDate 1994
dc.date.none.fl_str_mv 1994
1994-12-01
2016
2016-11-18
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/96803
url https://hdl.handle.net/2117/96803
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412156811771904
score 15,300719

Similares en LA Referencia