This HTML5 document contains 68 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Index_map
dbo:wikiPageWikiLink
dbr:Index_mapping
Subject Item
dbr:Index_mapping
rdf:type
yago:WikicatSearchAlgorithms yago:WikicatAssociativeArrays yago:Activity100407535 yago:Event100029378 yago:PsychologicalFeature100023100 yago:Array107939382 yago:Procedure101023820 yago:Rule105846932 yago:Group100031264 yago:Arrangement107938773 yago:YagoPermanentlyLocatedEntity yago:WikicatArrays yago:Algorithm105847438 owl:Thing yago:Abstraction100002137 yago:Act100030358
rdfs:label
Index mapping
rdfs:comment
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.
dcterms:subject
dbc:Articles_with_example_C_code dbc:Arrays dbc:Hashing dbc:Search_algorithms dbc:Associative_arrays
dbo:wikiPageID
25165023
dbo:wikiPageRevisionID
983734240
dbo:wikiPageWikiLink
dbr:Array_data_structure dbr:ASCII dbr:Day dbc:Articles_with_example_C_code dbc:Arrays dbr:Computer_science dbr:Instruction_path_length dbr:Memory_allocation dbr:Hash_table dbc:Search_algorithms dbr:Universe_(mathematics) dbr:Month dbr:Time_complexity dbr:Hash_function dbc:Hashing dbr:Associative_array dbr:Multiway_branch dbr:Index_map dbr:Day_of_the_week dbc:Associative_arrays dbr:Switch_statement dbr:Lookup_table
owl:sameAs
yago-res:Index_mapping freebase:m.09gjg43 wikidata:Q6017841 n14:4nWUg
dbp:wikiPageUsesTemplate
dbt:Distinguish dbt:Reflist
dbo:abstract
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.
prov:wasDerivedFrom
wikipedia-en:Index_mapping?oldid=983734240&ns=0
dbo:wikiPageLength
2810
foaf:isPrimaryTopicOf
wikipedia-en:Index_mapping
Subject Item
dbr:Control_table
dbo:wikiPageWikiLink
dbr:Index_mapping
Subject Item
dbr:HYPO_CBR
dbo:wikiPageWikiLink
dbr:Index_mapping
Subject Item
dbr:Portable,_Extensible_Toolkit_for_Scientific_Computation
dbo:wikiPageWikiLink
dbr:Index_mapping
Subject Item
dbr:Index
dbo:wikiPageWikiLink
dbr:Index_mapping
dbo:wikiPageDisambiguates
dbr:Index_mapping
Subject Item
dbr:Multiway_branch
dbo:wikiPageWikiLink
dbr:Index_mapping
Subject Item
dbr:Switch_statement
dbo:wikiPageWikiLink
dbr:Index_mapping
Subject Item
dbr:Trivial_hash_function
dbo:wikiPageWikiLink
dbr:Index_mapping
dbo:wikiPageRedirects
dbr:Index_mapping
Subject Item
wikipedia-en:Index_mapping
foaf:primaryTopic
dbr:Index_mapping