Key-independent optimality
id:
key-independent-optimality-317-12020706
title:
Key-independent optimality
text:
Key-independent optimality is a property of some binary search tree data structures in computer science
proposed by John Iacono.
Suppose that key-value pairs are stored in a data
structure, and that the keys have no relation to their paired values. A data structure has key-independent optimality if, when randomly assigning the keys, the expected performance of the data structure is within a constant factor of the optimal data structure. Key-independent optimality is related to dynamic optimality
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Key-independent_optimality
date created:
date modified:
2019-09-30T12:53:48Z
main entity:
{"identifier":"Q17093029","url":"https://www.wikidata.org/entity/Q17093029"}
image:
fields total:
13
integrity:
13