Ecient Storage and Retrieval of In-Memory Static Data

Hash or B-Tree based composite indexes, are the two most commonly used techniques for searching and re- trieving data from memory. Although these techniques have a serious memory limitation, that restricts free- dom to search by any combination of single key/data attribute, that comprises the composite search key, the techniques are still accepted considering the trade os with better performance on insert and update opera- tions. But when the data is semi-static, which does not change often, there is a need and scope for a better tech- nique that provides the exibility and freedom to e- ciently search by any possible key, without creating any composite index. This paper explains such algorithmic technique along with its data structures.