Mostra el registre d'ítem simple
Optimal and nearly optimal weighted skip lists
dc.contributor.author | Martínez Parra, Conrado |
dc.contributor.author | Roura Ferret, Salvador |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-02-02T14:15:03Z |
dc.date.available | 2016-02-02T14:15:03Z |
dc.date.issued | 1995-01-01 |
dc.identifier.citation | Martínez Parra, Conrado; Roura Ferret, Salvador. "Optimal and nearly optimal weighted skip lists". 1995. |
dc.identifier.uri | http://hdl.handle.net/2117/82430 |
dc.description.abstract | We consider the problem of building a static (i.e. no updates are performed) skip list of n elements, given these n elements and the corresponding access probabilities or weights. We develop a dynamic programming algorithm that builds an optimal skip list in the sense that the average access cost is minimized. We also consider nearly optimal skip lists, whose average access cost is not optimal but good enough, and can be built more efficiently than optimal skip lists. Several related issues are also discussed, for instance, other approaches to the construction of nearly optimal skip lists or the construction of optimal skip lists that minimize different kinds of search costs. |
dc.format.extent | 25 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-95-34-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | Static data sets |
dc.subject.other | Skip lists |
dc.title | Optimal and nearly optimal weighted skip lists |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1849506 |
dc.description.version | Postprint (published version) |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]