Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
leventov
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
61.
▲
by
leventov
12y ago
I entirely agree with you. Naming the post "Comparison to Redis" and adding some paragraphs about this is a bit glory hunting, because having two buzzwords in the title is better than one :) Basically it's just Memcached inte
62.
▲
by
leventov
12y ago
Now they think about adding concurrency anyway ( https://news.ycombinator.com/item?id=9026344 ) And one day they will implement that, because it is quite difficult to keep talking that single-threaded database solution is OK
63.
▲
Memcached design and comparison with Redis
(key-value-stories.blogspot.com)
36 points
by
leventov
12y ago
|
9 comments
64.
▲
by
leventov
12y ago
Comarison with Trove and other primitive collections libs: http://java.dzone.com/articles/time-memory-tradeoff-example Why faster: - no supplemental "states" array in open adressing implementation - keys and
65.
▲
Show HN: OpenHFT Collections – the fastest Java hash sets and maps ever
(github.com)
4 points
by
leventov
12y ago
|
2 comments