Readit NewsWill take a look, thanks! I think you meant height-optimized tries, since I had a tough time giving it at first :)
Ideally I'd like to find a way to store a non overlapping ordered list of intervals while being able to atomically (wrt other insertions) avoid inserting overlaps. This is part of a data structure tracking locked ranges, so being able to update them in parallel would be nice, since it today takes a lock over the whole tree while inserting new locked ranges.
Probably, this would require something with next value pointers. Maybe I could do some kind of scheme where to insert you have to first optimistically lock the predecessor with the to be inserted node, and then insert the new node where it belongs?
You should also check out the Maple Tree (https://docs.kernel.org/core-api/maple_tree.html).
It's the data structure used to track non-overlapping intervals in the Linux kernel's virtual memory subsystem.
If you don't mind sharing, what's your use case for such a data structure?
Most of this list is about how to dress for senpai; figuratively speaking. A pretty depressing take on "how to do important research that matters".
I would hope that would be of the most unimportant part of science, totally irrelevant to what's important and what matters. But maybe that's not true today.
How is that the case? The tips seem to aim for impactful research: picking good ideas and executing well on them. There's a tacit assumption that such impactful research will win best paper awards, but that's actually not substantiated and isn't obviously correct, since best paper selection committees can't see the future. For example, many (maybe most?) winners of retrospective awards (test-of-time / influential paper) aren't papers that won a best paper award when originally published.
Most of the author's papers he cites in the post, including the membership inference paper which is one of the papers the author is "most proud of," didn't win best paper awards.