Viewing profile — bradleykuszmaul
bradleykuszmaul
HN member- Joined
- Thu, Aug 23, 2012, 4:01 PM UTC
- HN karma
- 16
- Public activity
- 8 items
- HN profile
- View on Hacker News ↗
About bradleykuszmaul
No profile information was provided.
Recent public activity
-
comment
Comment #18208209
Tokutek licensed the fractal tree under GPLv2 with an explicit patent license to make clear that anyone could use the fractal tree code. I don't know what Percona did after the aqu…
-
comment
Comment #9274362
Looking at that post on Leif's drawing, I think I agree that the B-tree is placed incorrectly. It turns out that B-trees are on the optimal read/write tradeoff curve, but they are …
-
comment
Comment #9259145
Many important databases do contain 100-byte rows. Sometimes the biggest tables contain 100-byte rows, and then smaller tables contain larger rows. I'd have to disagree with your a…
-
comment
Comment #9258891
No, I don't think you can view a fractal tree as an LSM tree with C=1. One conclusion of this paper is that for worst-case workloads, LSM trees are not as good asympotically as fra…
-
comment
Comment #9258859
To complain about contention under multithreaded workloads seems to be missing the point. At the point that multithreaded workloads are becoming a problem, the ingestion rate is hu…
-
comment
Comment #9258839
I'm the author of this paper, and I'll try to respond to some of what has been stated on this thread. > A fully compacted LSM-tree should be equivalent to a b-tree in terms of read…
-
comment
Comment #5590336
If you are interested in this, you should look at our source distribution's license file. We have done the work to get a patent license from MIT, Stony Brook, and Rutgers so that t…
-
comment
Comment #5589760
Sadly, we don't use TokuDB to run our web site. It's some relatively inexpensive service.