title: Choosing a Data structure for very large data
body: <p>I have x (millions) positive integers, where their values can be as big as allowed (+2,147,483,647). Assuming they are unique, what is the best way to store them for a lookup intensive program. </p>
  
  <p>So far i thought of using a binary AVL tree or a hash table, where the integer is the key to the mapped data (a name). However am not to sure whether i can implement such large keys and in such large quantity with a hash table (wouldn't that create a >0.8 load factor in addition to be prone for collisions?)</p>
  
  <p>Could i get some advise on which data structure might be suitable for my situation</p>