Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5421911> ?p ?o }
Showing triples 1 to 23 of
23
with 100 triples per page.
- Q5421911 subject Q6467387.
- Q5421911 subject Q7005249.
- Q5421911 abstract "Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing is an incremental operation (done one bucket at a time, as needed). This means that time-sensitive applications are less affected by table growth than by standard full-table rehashes.Extendible hashing was described by Ronald Fagin in 1979.Practically all modern filesystems use either extendible hashing or B-trees.In particular, the Global File System, ZFS, and the SpadFS filesystem use extendible hashing.".
- Q5421911 thumbnail Extendible_hashing_1.svg?width=300.
- Q5421911 wikiPageExternalLink ch11.pdf.
- Q5421911 wikiPageExternalLink Extend.html.
- Q5421911 wikiPageExternalLink lecture.extendible.hashing.pdf.
- Q5421911 wikiPageWikiLink Q136113.
- Q5421911 wikiPageWikiLink Q1757218.
- Q5421911 wikiPageWikiLink Q183427.
- Q5421911 wikiPageWikiLink Q207440.
- Q5421911 wikiPageWikiLink Q28865.
- Q5421911 wikiPageWikiLink Q387015.
- Q5421911 wikiPageWikiLink Q5486715.
- Q5421911 wikiPageWikiLink Q6467387.
- Q5421911 wikiPageWikiLink Q6553456.
- Q5421911 wikiPageWikiLink Q677051.
- Q5421911 wikiPageWikiLink Q7005249.
- Q5421911 wikiPageWikiLink Q7595766.
- Q5421911 wikiPageWikiLink Q93124.
- Q5421911 comment "Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing is an incremental operation (done one bucket at a time, as needed).".
- Q5421911 label "Extendible hashing".
- Q5421911 depiction Extendible_hashing_1.svg.
