Matches in DBpedia 2014 for { <http://dbpedia.org/resource/HTree> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- HTree abstract "An HTree is a specialized tree data structure for directory indexing, similar to a B-tree. They are constant depth of either one or two levels, have a high fanout factor, use a hash of the filename, and do not require balancing. The HTree algorithm is distinguished from standard B-tree methods by its treatment of hash collisions, which may overflow across multiple leaf and index blocks. HTree indexes are used in the ext3 and ext4 Linux filesystems, and were incorporated into the Linux kernel around 2.5.40. HTree indexing improved the scalability of Linux ext2 based filesystems from a practical limit of a few thousand files, into the range of tens of millions of files per directory.PHTree is a derivation intended as a successor. It fixes all the known issues with HTree except for write multiplication.".
- HTree wikiPageExternalLink node3.html.
- HTree wikiPageExternalLink index.html.
- HTree wikiPageID "19763183".
- HTree wikiPageRevisionID "601564868".
- HTree subject Category:B-tree.
- HTree subject Category:Disk_file_systems.
- HTree subject Category:Linux.
- HTree subject Category:Trees_(data_structures).
- HTree comment "An HTree is a specialized tree data structure for directory indexing, similar to a B-tree. They are constant depth of either one or two levels, have a high fanout factor, use a hash of the filename, and do not require balancing. The HTree algorithm is distinguished from standard B-tree methods by its treatment of hash collisions, which may overflow across multiple leaf and index blocks.".
- HTree label "HTree".
- HTree sameAs m.05_5_ff.
- HTree sameAs Q5924569.
- HTree sameAs Q5924569.
- HTree wasDerivedFrom HTree?oldid=601564868.
- HTree isPrimaryTopicOf HTree.