Viewing profile — stephen_mcd
stephen_mcd
HN member- Joined
- Sat, Apr 10, 2010, 9:09 AM UTC
- HN karma
- 533
- Public activity
- 155 items
- HN profile
- View on Hacker News ↗
About stephen_mcd
Recent public activity
-
comment
Comment #16248075
Cool! I built CurioDB a while back with the same idea, but using Akka as the underlying framework. Persistent Redis with distributed transactions, embedded Lua and a websocket fron…
-
comment
Comment #12723775
You're not wrong, Walter.
- story
- story
-
comment
Comment #11426175
CurioDB too: http://curiodb.jupo.org
-
comment
Comment #11287009
If each key/value in the DB is treated as distributed (as per the actor model), a lot of the limitations Redis faces in a distributed environment are solved. I wrote a lot more abo…
-
comment
Comment #11280664
I really love the idea of explaining the actor model as tons of tiny little servers compared to a single monolithic server. I tried to make the same comparison recently when I talk…
- story
- story
-
comment
Comment #10326076
Great project. I recently used LuaJ to embed Lua scripting inside CurioDB: https://github.com/stephenmcd/curiodb - it's a distributed Redis clone built with Scala/Akka. In terms of…
-
comment
Comment #10068957
Yep, one actor per KV means some kind of distributed coordination would be needed - that doesn't exist yet.
-
comment
Comment #10068954
That'd be good!
-
comment
Comment #10067846
Hey Jon, long time no see. :-) Yes I imagine the thinking there is similar in your project, eg: Redis/CurioDB :: Node/SocketCluster ( https://github.com/SocketCluster/socketcluster…
-
comment
Comment #10067654
Glad you like it! Hardware requirements would depend on your usage of course, it's like asking about the length of a piece of string. :-) Honestly though, the code probably needs a…
- story
- story
-
comment
Comment #9559631
Funny is a +1 on Slashdot, while on HN it'd be a -1.
- story
-
comment
Comment #9494891
The rotated A in the Aerospike logo reminds me of a system that's fallen over, and now you can't unsee it: http://www.aerospike.com/
-
comment
Comment #8643453
You can easily render a tree many levels deep in O(n) time using a single DB query as an adjacency list with a lookup dictionary: http://blog.jupo.org/2010/01/26/linear-traversal-o…
- story
-
comment
Comment #8271694
Perhaps it was more a case of accuracy for what we were looking at at the time then :-) It's something we run out of band on a subset of our data, so it's never been performance cr…
-
comment
Comment #8271619
Great article. I went through a similar process about a year ago for https://kouio.com (RSS reader). In its case I needed to coalesce closely matching RSS feeds purely for storage …
-
comment
Comment #8018753
https://twitter.com/stephen_mcd - hit me up, lots of open source
-
comment
Comment #7703398
I use the web version of kouio on android every day, it's tailored directly to mobile devices: https://kouio.com/blog/kouio-your-mobile-rss-reader You can also push articles out to…