http://dbpedia.org/ontology/abstract
|
In computer science, the augmented map is … In computer science, the augmented map is an abstract data type (ADT) based on ordered maps, which associates each ordered map an augmented value. For an ordered map with key type , comparison function on and value type , the augmented value is defined based on two functions: a base function and a combine function , where is the type of the augmented value. The base function converts a single entry in to an augmented value, and the combine function combines multiple augmented values. The combine function is required to be associative and have an identity (i.e., forms a monoid). We extend the definition of the associative function as follows: Then the augmented value of an ordered map is defined as follows: Accordingly, an augmented map can be formally defined as a seven-tuple . For example, an augmented map with integral keys and values, on which the augmented value is defined as the sum of all values in the map, is defined as: As an abstract data type, the augmented map is often used to model problems and serves as an abstraction with a useful interface. It is designed for supporting fast range sums, which means to quickly return the augmented value of all entries in a certain key range.lue of all entries in a certain key range.
|
http://dbpedia.org/ontology/wikiPageID
|
58463358
|
http://dbpedia.org/ontology/wikiPageLength
|
10040
|
http://dbpedia.org/ontology/wikiPageRevisionID
|
1093145663
|
http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Inverted_index +
, http://dbpedia.org/resource/Associative_array +
, http://dbpedia.org/resource/Category:Abstract_data_types +
, http://dbpedia.org/resource/Monoid +
, http://dbpedia.org/resource/Abstract_data_type +
, http://dbpedia.org/resource/Associativity +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Category:Data_types +
, http://dbpedia.org/resource/Interval_tree +
, http://dbpedia.org/resource/Associative +
, http://dbpedia.org/resource/Range_tree +
, http://dbpedia.org/resource/Sweepline_algorithm +
, http://dbpedia.org/resource/PAM_library +
, http://dbpedia.org/resource/Identity_%28mathematics%29 +
, http://dbpedia.org/resource/Category:Data_structures +
|
http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Data_structures +
, http://dbpedia.org/resource/Template:Data_types +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Notelist +
|
http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Abstract_data_types +
, http://dbpedia.org/resource/Category:Data_types +
, http://dbpedia.org/resource/Category:Data_structures +
|
http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Augmented_map?oldid=1093145663&ns=0 +
|
http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Augmented_map +
|
owl:sameAs |
https://global.dbpedia.org/id/9GWEo +
, http://www.wikidata.org/entity/Q60788397 +
, http://dbpedia.org/resource/Augmented_map +
|
rdfs:comment |
In computer science, the augmented map is … In computer science, the augmented map is an abstract data type (ADT) based on ordered maps, which associates each ordered map an augmented value. For an ordered map with key type , comparison function on and value type , the augmented value is defined based on two functions: a base function and a combine function , where is the type of the augmented value. The base function converts a single entry in to an augmented value, and the combine function combines multiple augmented values. The combine function is required to be associative and have an identity (i.e., forms a monoid). We extend the definition of the associative function as follows:on of the associative function as follows:
|
rdfs:label |
Augmented map
|