Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
gregburd
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
Show HN: A sparse, compressed bitmap index in C. Better than Roaring Bitmaps?
(codeberg.org)
2 points
by
gregburd
5mo ago
|
0 comments
2.
▲
Show HN: A self-balancing skip-list (a.k.a. "splay-list") library in C
(codeberg.org)
4 points
by
gregburd
5mo ago
|
0 comments
3.
▲
Show HN: Lime, a parser generator that can merge grammars at runtime
(codeberg.org)
2 points
by
gregburd
5mo ago
|
0 comments
4.
▲
Show HN: Noxu DB, a Rust Port of Berkeley DB Java Edition
(codeberg.org)
3 points
by
gregburd
5mo ago
|
0 comments
5.
▲
by
gregburd
8y ago
Would you consider this in the spirit of Lotus Improv, but for the web?
6.
▲
by
gregburd
10y ago
Certainly copyleft has a place, but changing the license to LGPLv3 would allow this very useful library to be used much more broadly while continuing to require that improvements to the shared code be made public. If glibc were GPLv3 rathe
7.
▲
by
gregburd
10y ago
I think the business, regulatory and infrastructure requirements are entirely different. They co-opt existing networks and only have to provide a SIM card, like other MVNOs. They don't have to deal with multi-year back-room deals for
8.
▲
by
gregburd
10y ago
While I commend the developers of Minio for building what appears to be a functional S3-API-compatible system in Go Lang it seems to me to be missing the key thing that makes S3 a compelling object/data storage solution -- the distrib
9.
▲
by
gregburd
12y ago
This is a much more recent presentation by Kyle (the author of the linked article) with a more mature version of his Jepsen tool. I imagine he'll get around to a written version of his findings soon, until then it's worth the tim
10.
▲
by
gregburd
13y ago
My favorite small and understandable implementation of Lisp in C is by Ian Piumarta. [1] [1] http://piumarta.com/software/lysp/
11.
▲
by
gregburd
13y ago
Lysp ( http://piumarta.com/software/lysp/ ) is fairly close to what I'm guessing you're "pining" for and if not, hey it's open source so have at it!
12.
▲
by
gregburd
13y ago
If you have a 1.4.2 cluster you can do a rolling upgrade to 2.0 without doing a "dump/restore". Please remember, this is a tech-preview, don't upgrade your production cluster to 2.0 until it's been released for pro
13.
▲
by
gregburd
13y ago
I think it's this facet of Bitcoin that's going to end up causing problems in the not too distant future. There will be an ever increasing number of "trapped" coins, BTC that belongs to someone who has abandoned it leav
14.
▲
by
gregburd
14y ago
You don't consider Amazon/S3 or Redis NoSQL databases?
15.
▲
by
gregburd
14y ago
One key difference is that Riak will rebalance data across nodes as they are added or removed automatically, Cassandra will not. You have to manually adjust the partitioning of data, balancing it by hand.
16.
▲
by
gregburd
14y ago
Great to hear that you're cutting over to Riak. We highly recommend that your minimum cluster size is your N value (replication value) + 2. I your case that likely means 5 nodes for your starting cluster, not 3. There are many reasons. h
17.
▲
by
gregburd
15y ago
Hoard is fine, but if we're going to start talking about various scalable memory allocators designed for concurrent, multi-core/cpu systems then... libumem is the user space slab memory allocator first available in Solaris 9 (SunOS 5.4) now
18.
▲
by
gregburd
16y ago
I look forward to benchmarking the SQLite WAL against the newly integrated Berkeley DB and SQLite. Berkeley DB's btree is also a WAL design with many many years of tuning. It's good for SQLite users to have choice. (Disclaimer: I'm the pr