| Message |
How it does that is, when you create an Index, you store a pointer or a tag to the data you want accessed in a hashmap, which basically is nothing more than a data structure that holds a key and it's associated mapped data. Like a big reference table. The advantage is it's super fast, because unlike searching through a tree like structure for what you're looking for, you only have to know the key and you get your results with "one hop" So, when it's out of date, the hashmap needs to be updated with new keys and their associated data. Hence, you wont be able to find the data on a search. This is a very basic overview.
-------------------------------------------------------------------------------- Member # 42254's 1991 Twin Turbo
 Sig Quotes: your brillant (n/m) - Zski (Generation Z) 14:36:48 06/17/04 Fat kids will eat anything. (n/m) - SooperZ95 22:13:47 07/05/04 Get divorced. (n/m) - Kenny 22:10:09 07/07/04 BTW, spelling has nothing to do with being stupid, stupid. - AzHeat 22:08:35 11/21/04 First of all, we already know you're a little pussy bitch from San Francisco - Marshall 21:36:41 06/08/05
Are you in the know?
|
 |