The Third Hard Problem
11–20 of 70 posts
Re: The Third Hard Problem
#12And that's a problem because Aggregability is NP-Hard: https://dl.acm.org/doi/abs/10.1145/1165555.1165556
So a tree is a way to take a high dimensionality graph and make it usefully lower dimensionality, but, given the aforementioned proof, that reduction is going to go from being a lossless compression to a heuristic. So any interesting problem (at least, any problem interesting to me) is only going to be aided (read: not solved exhaustively) by that hierarchy.
I'm okay with this. Being okay with this has been one of the most freeing things over the last 20 years of my career. Accept inaccuracy, and find usefulness in your data structures.
Re: The Third Hard Problem
#13I thought the two hard problems were naming things, cache invalidation, and off-by-one errors?
Re: The Third Hard Problem
#14Re: The Third Hard Problem
#15Re: The Third Hard Problem
#16Re: The Third Hard Problem
#17Re: The Third Hard Problem
#18Putting object into trees is basically a caching problem.
Re: The Third Hard Problem
#19Re: The Third Hard Problem
#20The first chapter of this waves away the fact that hierarchical filesystems are now useless, but it is still a fact. There is no more reason to organize your files than there is to drive around in a chariot. It is hard to map one domain to the other, but it is also not necessary. With AI indexing and recall it's less necessary than it has ever been.