Viewing profile — elbee
elbee
HN member- Joined
- Thu, Feb 07, 2013, 4:55 PM UTC
- HN karma
- 22
- Public activity
- 13 items
- HN profile
- View on Hacker News ↗
About elbee
Recent public activity
-
comment
Comment #11137432
That will work as a way to strengthen the hashes (a few other people pointed that out as well). My point was that if you have a system which can go straight from SHA2(password) to …
-
comment
Comment #11137251
Waiting until login until you upgrade to bcrypt is a requirement is compotent password storage. At this point in time all Linode should know is SHA-2(password) and they can't use t…
-
comment
Comment #11063687
If you want to do mutual exclusion using distributed locking then you end up in a painful place (as the article points out). In general you can't distinguish between a process that…
-
comment
Comment #6446557
On the other hand unsigned types are a huge pain if you want to iterate through an array backwards because you have to use subtraction. A lot of people end up with something like t…
-
comment
Comment #6229924
To be honest, I have no idea what "agility" is. Perhaps I am too cautious but I'll want to see a lot more data than some hand-picked benchmarks and a mystical "unique constraints a…
-
comment
Comment #6229836
So out of the main b-tree operations (Insert/Replace/Delete/Seek/Next/Prev) you make a convincing argument that Tokutek can be faster than b-trees for inserts , if you use non-uniq…
-
comment
Comment #6229340
This reading list will cover a lot the current generation of b-tree techniques, but not the cutting-edge stuff (e.g. Tokutek): * Ubiquitous B-Tree (Douglas Comer): http://doi.acm.o…
-
comment
Comment #6229284
That looks extremely interesting! The idea of amortizing the cost of inserts is fascinating. Looking at the design you sketched a few questions come to mind: 1) Multi-threading: su…
-
comment
Comment #6228741
I'm not talking about a b-tree that won't fit in L2, I'm talking about a B-tree that won't even fit in main memory. In those cases, even with SSDs, the cost of pulling a page off d…
-
comment
Comment #6228549
The B-tree implementations used in a lot of databases have tweaks, but they are surprisingly similar to the textbook descriptions. In general, B-trees are actually a very useful da…
-
comment
Comment #5495497
In some systems the problem is that you can never be guaranteed that the after_commit hook will always run. This is especially true in multi-server systems where the cache, databas…
-
comment
Comment #5495304
One risk of not using expiration at all is that if the database is updated but the after_commit hook doesn't finish (crash, out of resources etc.) then the cached data remains outd…
-
comment
Comment #5183142
1) In main.c the vals array is statically sized at 256 entries, but entries are put into it mod terminal width, with no guarantee that the terminal is <= 256 characters wide. That …