Index mapping (or direct addressing, or a trivial hash function) in computer science describes using an array, in which each position corresponds to a key in the universe of possible values.The technique is most effective when the universe of keys is reasonably small, such that allocating an array with one position for every possible key is affordable.Its effectiveness comes from the fact that an arbitrary position in an array can be examined in constant time.
Attributes | Values |
---|---|
rdf:type |
|
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
Wikipage page ID |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage |
|
sameAs | |
dbp:wikiPageUsesTemplate | |
has abstract |
|
prov:wasDerivedFrom | |
page length (characters) of wiki page |
|
foaf:isPrimaryTopicOf | |
is Link from a Wikipage to another Wikipage of | |
is Wikipage redirect of | |
is Wikipage disambiguates of | |
is foaf:primaryTopic of |