This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License
Key-independent optimality is a property of some binary search tree data structures in computer scienceproposed by John Iacono.Suppose that key-value pairs are stored in a datastructure, 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.
| Property | Value |
|---|---|
| dbo:abstract |
|
| dbo:wikiPageID |
|
| dbo:wikiPageLength |
|
| dbo:wikiPageRevisionID |
|
| dbo:wikiPageWikiLink | |
| dbp:wikiPageUsesTemplate | |
| dct:subject | |
| gold:hypernym | |
| rdf:type | |
| rdfs:comment |
|
| rdfs:label |
|
| owl:sameAs | |
| prov:wasDerivedFrom | |
| foaf:isPrimaryTopicOf | |
| is dbo:wikiPageWikiLink of | |
| is foaf:primaryTopic of |