Timeline for How are anti viruses so fast?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2019 at 9:16 | comment | added | LSerni | @harperville it is a N-tree, yes. Here, of course, N=256. A binary tree has N=2. You could do this using directories (if there wasn't a directory length limit), using the hash in binary. Then the directory also is implemented as a tree - I think usually a B-tree, which is a N-tree with variable N. If you only populated the trees where there is some hash, you'd end up with a B-tree. And if the directory was indeed implemented as a B-tree itself and there weren't other inefficiencies involved (there are!), then you could keep all the files in a single directory for faster access. | |
| Apr 12, 2019 at 9:11 | history | edited | LSerni | CC BY-SA 4.0 |
added 100 characters in body
|
| Apr 12, 2019 at 2:05 | comment | added | harperville | In your explanation about 256 directories and 256 subdirectories, etc., etc....what type of data structure is this? For instance, it's not a binary tree, but it is a tree, right? Is it just a directory tree? Excellent answer. I'm surprised it didn't spark more discussion. Thanks for taking the time to provide such quality content. | |
| Nov 27, 2017 at 10:52 | history | edited | LSerni | CC BY-SA 3.0 |
added 575 characters in body
|
| Nov 27, 2017 at 10:44 | history | edited | LSerni | CC BY-SA 3.0 |
added 575 characters in body
|
| Nov 13, 2017 at 22:09 | history | edited | LSerni | CC BY-SA 3.0 |
added 3542 characters in body
|
| Nov 13, 2017 at 11:05 | history | edited | LSerni | CC BY-SA 3.0 |
added 674 characters in body
|
| Nov 11, 2017 at 23:27 | history | answered | LSerni | CC BY-SA 3.0 |