| http://dbpedia.org/ontology/abstract
|
Extendible hashing is a type of hash syste … 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. SpadFS filesystem use extendible hashing.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_1.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://codex.cs.yale.edu/avi/db-book/db6/slide-dir/PPT-dir/ch11.ppt +
, https://web.archive.org/web/20070123144615/http:/www.csm.astate.edu/~rossa/datastruc/Extend.html +
, http://www.smckearney.com/adb/notes/lecture.extendible.hashing.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
8019200
|
| http://dbpedia.org/ontology/wikiPageLength
|
10815
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1083809004
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Trie +
, http://dbpedia.org/resource/Linear_hashing +
, http://dbpedia.org/resource/Ronald_Fagin +
, http://dbpedia.org/resource/Consistent_hashing +
, http://dbpedia.org/resource/Least_significant_bit +
, http://dbpedia.org/resource/Stable_hashing +
, http://dbpedia.org/resource/Hash_function +
, http://dbpedia.org/resource/File:Extendible_hashing_5.svg +
, http://dbpedia.org/resource/File:Extendible_hashing_6.svg +
, http://dbpedia.org/resource/File:Extendible_hashing_3.svg +
, http://dbpedia.org/resource/Global_File_System +
, http://dbpedia.org/resource/File:Extendible_hashing_4.svg +
, http://dbpedia.org/resource/File:Extendible_hashing_1.svg +
, http://dbpedia.org/resource/File:Extendible_hashing_2.svg +
, http://dbpedia.org/resource/Python_%28programming_language%29 +
, http://dbpedia.org/resource/ZFS +
, http://dbpedia.org/resource/B-trees +
, http://dbpedia.org/resource/Hash_table +
, http://dbpedia.org/resource/Category:Hashing +
, http://dbpedia.org/resource/Category:Search_algorithms +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:DADS +
, http://dbpedia.org/resource/Template:Tmath +
, http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Sfnp +
, http://dbpedia.org/resource/Template:Citation +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Search_algorithms +
, http://dbpedia.org/resource/Category:Hashing +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/System +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Extendible_hashing?oldid=1083809004&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_1.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_2.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_3.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_4.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_5.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Extendible_hashing_6.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Extendible_hashing +
|
| owl:sameAs |
http://fa.dbpedia.org/resource/%D8%AF%D8%B1%D9%87%D9%85%E2%80%8C%D8%B3%D8%A7%D8%B2%DB%8C_%D9%82%D8%A7%D8%A8%D9%84_%DA%AF%D8%B3%D8%AA%D8%B1%D8%B4 +
, http://www.wikidata.org/entity/Q5421911 +
, http://rdf.freebase.com/ns/m.026nrq0 +
, https://global.dbpedia.org/id/4jnLd +
, http://sr.dbpedia.org/resource/Pro%C5%A1ireno_he%C5%A1iranje +
, http://yago-knowledge.org/resource/Extendible_hashing +
, http://dbpedia.org/resource/Extendible_hashing +
|
| rdf:type |
http://dbpedia.org/class/yago/WikicatSearchAlgorithms +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Act100030358 +
|
| rdfs:comment |
Extendible hashing is a type of hash syste … 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. SpadFS filesystem use extendible hashing.
|
| rdfs:label |
Extendible hashing
|
