Hi,
I'm trying to improve vGrive performance by changing the mechanism of searching the repository in the web and searching file system multiple times. I think vGrive could do a full search and keep the results locally for imediate references. It would be a kind of cache, where imediate new searches could be made locally in less expensive operations.
I think there are two good alternatives for that. Keeping the records in memory in a HashTable or saving them to a database.
I'd like to try memory option first.
Of course it would be a huge change in system backbone, so I'm trying to go one step at time. This is the first as implementing DriveFile as a class instead of struct. The next is doing a readability refactor in list_files and finally caching things up.
I hope it can be useful.
Thanks.
Hi, I'm trying to improve vGrive performance by changing the mechanism of searching the repository in the web and searching file system multiple times. I think vGrive could do a full search and keep the results locally for imediate references. It would be a kind of cache, where imediate new searches could be made locally in less expensive operations. I think there are two good alternatives for that. Keeping the records in memory in a HashTable or saving them to a database. I'd like to try memory option first. Of course it would be a huge change in system backbone, so I'm trying to go one step at time. This is the first as implementing DriveFile as a class instead of struct. The next is doing a readability refactor in list_files and finally caching things up. I hope it can be useful. Thanks.