20. A non-transitory computer readable medium comprising computer executable instructions for retrieving items stored in memory, said computer readable medium comprising instructions for: obtaining zero or more characters as a search input; examining said search input and traversing a tree built from one or more items each having at least one integer associated therewith, each integer representing a component of a respective item and having been generated using a first value indicative of a location where said item can be found in a memory, a second value indicative of a bias level for said item, a third value indicative of an offset within said item where said component begins, and a fourth value indicative of a length of said component within said item to enable said component to be found; upon reaching a terminus in said tree according to said zero or more characters, returning all integers stored at one or more leaf nodes beneath said terminus in said tree; for each integer, determining from said integer, said first value indicative of said location and said second value indicative of said bias level, accessing said item in said memory at said location, determining said third and fourth values, finding said component in said item using said third value, extracting said component according to said fourth value, and returning said component and its bias level for a list of search results; sorting said list of search results using bias levels from said at least one integer; and providing said list of search results.
20. A non-transitory computer readable medium comprising computer executable instructions for retrieving items stored in memory, said computer readable medium comprising instructions for: obtaining zero or more characters as a search input; examining said search input and traversing a tree built from one or more items each having at least one integer associated therewith, each integer representing a component of a respective item and having been generated using a first value indicative of a location where said item can be found in a memory, a second value indicative of a bias level for said item, a third value indicative of an offset within said item where said component begins, and a fourth value indicative of a length of said component within said item to enable said component to be found; upon reaching a terminus in said tree according to said zero or more characters, returning all integers stored at one or more leaf nodes beneath said terminus in said tree; for each integer, determining from said integer, said first value indicative of said location and said second value indicative of said bias level, accessing said item in said memory at said location, determining said third and fourth values, finding said component in said item using said third value, extracting said component according to said fourth value, and returning said component and its bias level for a list of search results; sorting said list of search results using bias levels from said at least one integer; and providing said list of search results. 21. The non-transitory computer readable medium according to claim 20 , wherein said values are determined by masking said integer to extract respective ones of said first, second, third, and fourth values.