6 ms·
Most interesting thing I have seen for for database indexes is this paper. https://www.arxiv-vanity.com/papers/1712.01208v1/ https://www.arxiv-vanity.com/paper
by jacksmith21006 8y ago
Most interesting thing I have seen for for database indexes is this paper.
https://www.arxiv-vanity.com/papers/1712.01208v1/ https://www.arxiv-vanity.com/papers/1712.01208v1/
Using a Neural Network in place of a B-tree. What is interesting is a NN can use many processors at the same time versus you can not with a B-tree.
In the end it comes down the power as in joules to get something done.
- koverstreet 8y agoit's more about space efficiency. if a model can fit in only one or two cachelines, and get you "close enough", you may end up touching a lot less memory than if you just did a binary search.