riaz.2012
BAN USERA phone book typically stores name and phone number , but first name and last name is used to identify clients. So we will need to come with a data structure to model phonebook assuming first and last name uniquely refer to a contact number. A possible option would be using a dynamic perfect hashing technique that uses a 2-tier hash level schemes such that the second level of hashing guarantees collision free hashing.
Now given the gigantic size of the customer base , we can maintain 2 hash structures..one smaller one in the main memory of maybe size (say X) and the bigger hash table in the secondary memory will be some multiple of X...so that a any of the portion from secondary memory fit completely into the main memory space for queries.
I believe this architecture will hold suffice for the problem statement.
Garbage Collection is one of the memory management technique which can be either automatically implemented by the compiler or has to be explicitly specified by the developer in few languages. In the mark and sweep way of garbage collection works using a flag to denote usage. A root set of objects are identified and also also objects that refer to them or are referred by them are marked and then a top-bottom dependency check is done on these flags and when a objects is out from the dependency chain , there is a change in the flag which becomes a sweet-spot for garbage collection and the gc executes the sweep operation.
- riaz.2012 September 13, 2015
We could use the weighted quick-union with path compression to accomplish this task.
- riaz.2012 September 24, 2015