Analysis of an optimized search algorithm for skip lists
It was suggested in Pugh's Skip List Cookbook to avoid redundant queries in the skip list search algorithm by marking those elements whose key had already been checked by the search algorithm. We present here a precise analysis of the total search cost (expectation and variance), where the cost...
| Autor: | |
|---|---|
| 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/96775 |
| Acceso en línea: | https://hdl.handle.net/2117/96775 |
| Access Level: | acceso abierto |
| Palabra clave: | Redundant queries Skip list search algorithm Total search cost Expectation Variance Key-to-key comparisons Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | It was suggested in Pugh's Skip List Cookbook to avoid redundant queries in the skip list search algorithm by marking those elements whose key had already been checked by the search algorithm. We present here a precise analysis of the total search cost (expectation and variance), where the cost of the search is measured in terms of the number of key-to-key comparisons. These results are then compared with the corresponding values of the standard search algorithm. |
|---|