Key addressable data storage

The AK5 search tree is a popular and eflcient data storage technique yielding near optimal retrieval times when doing retrieval by key comparisons. By considering the internal bit configuration and doing some minor bit manipulation, the key can uniquely determine storage location in a tree or a two dimensioned array without using key comparisons. when using the bit configuration of the key and using a similar tree structure, we can store and retrieve data faster than an AI4 tree. Data can be stored directly into dynamically allocated two dimensioned array or the tree using the identical technique. The performance surpasses A VL trees even when a tree structure is used since all key comparisons are avoided. The technique relies solely on the bit configuration of the key to determine its location in the tree or its location in a two dimensioned ragged edged array. The paper &scribes the technique used to store and retrieve keys without comparisons.