DBpedia – Linked Data Fragments

Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hashed_array_tree> ?p ?o }

• Hashed_array_tree abstract "In computer science, a hashed array tree (HAT) is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments (or "leaves") to store the data elements, unlike simple dynamic arrays which maintain their data in one contiguous memory area. Its primary objective is to reduce the amount of element copying due to automatic array resizing operations, and to improve memory usage patterns.Whereas simple dynamic arrays based on geometric expansion waste linear (Ω(n)) space, where n is the number of elements in the array, hashed array trees waste only order O(√n) storage space. An optimization of the algorithm allows to eliminate data copying completely, at a cost of increasing the wasted space.It can perform access in constant (O(1)) time, though slightly slower than simple dynamic arrays. The algorithm has O(1) amortized performance when appending a series of objects to the end of a hashed array tree. Contrary to its name, it does not use hash functions.".
• Hashed_array_tree thumbnail HashedArrayTree16.svg?width=300.
• Hashed_array_tree wikiPageID "12673184".
• Hashed_array_tree wikiPageLength "4804".
• Hashed_array_tree wikiPageOutDegree "19".
• Hashed_array_tree wikiPageRevisionID "649315574".
• Hashed_array_tree wikiPageWikiLink Array_data_structure.
• Hashed_array_tree wikiPageWikiLink B-tree.
• Hashed_array_tree wikiPageWikiLink Big_O_notation.
• Hashed_array_tree wikiPageWikiLink Category:Arrays.
• Hashed_array_tree wikiPageWikiLink Computer_science.
• Hashed_array_tree wikiPageWikiLink Dynamic_array.
• Hashed_array_tree wikiPageWikiLink Hash_function.
• Hashed_array_tree wikiPageWikiLink Hash_table.
• Hashed_array_tree wikiPageWikiLink Power_of_two.
• Hashed_array_tree wikiPageWikiLink Quotient.
• Hashed_array_tree wikiPageWikiLink Random_access.
• Hashed_array_tree wikiPageWikiLink Remainder.
• Hashed_array_tree wikiPageWikiLink Unrolled_linked_list.
• Hashed_array_tree wikiPageWikiLink VList.
• Hashed_array_tree wikiPageWikiLink File:HashedArrayTree16.svg.
• Hashed_array_tree wikiPageWikiLinkText "Hashed Array Tree".
• Hashed_array_tree wikiPageWikiLinkText "Hashed array tree".
• Hashed_array_tree hasPhotoCollection Hashed_array_tree.
• Hashed_array_tree wikiPageUsesTemplate Template:Data_structures.
• Hashed_array_tree wikiPageUsesTemplate Template:Reflist.
• Hashed_array_tree wikiPageUsesTemplate Template:Sqrt.
• Hashed_array_tree subject Category:Arrays.
• Hashed_array_tree type Array.
• Hashed_array_tree type Structure.
• Hashed_array_tree comment "In computer science, a hashed array tree (HAT) is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments (or "leaves") to store the data elements, unlike simple dynamic arrays which maintain their data in one contiguous memory area.".
• Hashed_array_tree label "Hashed array tree".
• Hashed_array_tree sameAs درخت_آرایه_درهم.
• Hashed_array_tree sameAs m.02w__zt.
• Hashed_array_tree sameAs Хеширано_стабло.
• Hashed_array_tree sameAs Q5678892.
• Hashed_array_tree sameAs Q5678892.
• Hashed_array_tree wasDerivedFrom Hashed_array_tree?oldid=649315574.
• Hashed_array_tree depiction HashedArrayTree16.svg.
• Hashed_array_tree isPrimaryTopicOf Hashed_array_tree.