Back to Results
First PageMeta Content
Information retrieval / Error detection and correction / Information / Hash table / Hash function / Trie / Extendible hashing / Cryptographic hash function / B-tree / Information science / Search algorithms / Hashing


Extendible Hashing-A Fast Access Method for Dynamic Files
Add to Reading List

Document Date: 2005-11-08 01:51:24


Open Document

File Size: 1,93 MB

Share Result on Facebook

City

Zurich / San Jose / /

Company

McCreight / Bayer / IBM Research Laboratory / /

Country

Switzerland / /

Currency

USD / /

Facility

IBM Research Laboratory / University of Toronto / /

IndustryTerm

capacity secondary-storage devices / radix search tree / systematic search / digital search trees / secondarystorage devices / search trees / radix search trees / binary search / sequential processing / binary search trees / then radix search trees / seconday-storage devices / radix search / File maintenance algorithms / search techniques / search tree / obvious efficient solution / radix search tree underlying alphabet / tree search schemes / secondary-storage devices / /

Organization

Department of Computer Science / OF FILE ORGANIZATION / Institut Informatik / EVOLUTION OF FILE ORGANIZATION / University of Toronto / Association for Computing Machinery / /

Person

Newell / Simon / NICHOLAS PIPPENGER / RONALD FAGIN / H. RAYMOND STRONG / Al B Hash / /

Position

Walker / /

ProvinceOrState

New York / California / /

Technology

random access / simulation / virtual memory / same algorithm / File maintenance algorithms / /

SocialTag