In this paper we evaluate a selection of data retrieval algorithms for storage e ciency retrieval speed and partial matching capabilities using a large information retrieval dataset We evaluate standard data structures for example inverted le lists and hash tables but also a novel binary neu ral network that incorporates single epoch training superimposed coding and associative matching in a bi...
