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

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

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n4	http://dbpedia.org/resource/File:
n16	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
n15	http://commons.wikimedia.org/wiki/Special:FilePath/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
prov	http://www.w3.org/ns/prov#
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Conc-tree_list

rdf:type

owl:Thing

rdfs:label

Conc-tree list

rdfs:comment

A conc-tree is a data structure that stores element sequences, and provides amortized O(1) time append and prepend operations, O(log n) time insert and remove operations and O(log n) time concatenation. This data structure is particularly viable for functional task-parallel and data-parallel programming, and is relatively simple to implement compared to other data-structures with similar asymptotic complexity. Conc-trees were designed to improve efficiency of data-parallel operations that do not require sequential left-to-right iteration order, and improve constant factors in these operations by avoiding unnecessary copies of the data. Orthogonally, they are used to efficiently aggregate data in functional-style task-parallel algorithms, as an implementation of the conc-list data abstract

owl:differentFrom

dbr:Cons

foaf:depiction

n15:Screen-conc.png

dcterms:subject

dbc:Trees_(data_structures)

dbo:wikiPageID

50562924

dbo:wikiPageRevisionID

1081660364

dbo:wikiPageWikiLink

n4:Screen-conc.png dbr:Big_O_notation dbr:Data_structure dbr:Task_parallelism dbr:AVL_trees dbc:Trees_(data_structures) dbr:Binary_tree dbr:Fortress_(programming_language) dbr:Cons dbr:Deque

owl:sameAs

wikidata:Q25345007 n16:2PHo5

dbp:wikiPageUsesTemplate

dbt:Distinguish dbt:Reflist

dbo:thumbnail

n15:Screen-conc.png?width=300

dbo:abstract

A conc-tree is a data structure that stores element sequences, and provides amortized O(1) time append and prepend operations, O(log n) time insert and remove operations and O(log n) time concatenation. This data structure is particularly viable for functional task-parallel and data-parallel programming, and is relatively simple to implement compared to other data-structures with similar asymptotic complexity. Conc-trees were designed to improve efficiency of data-parallel operations that do not require sequential left-to-right iteration order, and improve constant factors in these operations by avoiding unnecessary copies of the data. Orthogonally, they are used to efficiently aggregate data in functional-style task-parallel algorithms, as an implementation of the conc-list data abstraction. Conc-list is a parallel programming counterpart to functional cons-lists, and was originally introduced by the Fortress language.

prov:wasDerivedFrom

wikipedia-en:Conc-tree_list?oldid=1081660364&ns=0

dbo:wikiPageLength

6742

foaf:isPrimaryTopicOf

wikipedia-en:Conc-tree_list