Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
aphyr
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
59 ms
·
481.
▲
by
aphyr
14y ago
In short, don't. In Riak you would aim to update those views at write time, to minimize the number of reads required.
482.
▲
by
aphyr
14y ago
I've never seen a Riak MR job over more than 3 million keys complete, on a 6-node SSD cluster. It might be possible, but you'd have to throw a lot more HW at it than the comparable Hadoop setup.
483.
▲
by
aphyr
14y ago
I feel somewhat responsible for this confusion, as the guy being quoted here... :-( Riak will handle billions of keys just fine. We had, I dunno, a half a billion in a six node bitcask-backed cluster and were only at half capacity. Much muc
484.
▲
by
aphyr
14y ago
The publishing houses have been around for centuries, literally. One of the interesting things about scientific publishing is that the current arrangement is a recent phenomenon. Many journals started out as independent or university-af
485.
▲
by
aphyr
14y ago
I'm in favor of decoupling data structure from interface entirely, via records + protocols. Hierarchies have their place, but ultimately can't deal with cross-cutting concerns. Mixins with structural typing is one way to approach the pr
486.
▲
Know a Delay: Nagle's Algorithm and You.
(blog.boundary.com)
5 points
by
aphyr
14y ago
|
0 comments
487.
▲
by
aphyr
15y ago
Largely agree, but I don't think the "loner vs social" distinction is important. You can be a creative thinker, explorer, and builder with any type of social alignment.
488.
▲
by
aphyr
15y ago
The point, I think, is that the event buffer obeys the same transactional semantics as the data the event refers to. If you are not able to thread all state atomically through the message system, this can offer improved consistency guarante
489.
▲
by
aphyr
15y ago
Given cash-strapped, effective, charitable organizations with a better than 90% operational efficiency are not hard to find, yes.
490.
▲
by
aphyr
15y ago
Honestly I never found a briowser that didn't support multiple a record failover. Older versions of ie mostly. You do need to be aware that many nameservers will reorder a records by integer sort or delta to their own IP, which can make you
491.
▲
by
aphyr
15y ago
Thats a great way to handle it. In our case we had an, er, extensive legacy schema to preserve. Moral of the story: plan to scale early. You don't have to actually build that scaling infrastructure ... but keep its requirements in mind.
492.
▲
by
aphyr
15y ago
[edit] It's good that you call the clients. Nothing drives me nuts more than trying to sift through a painful ticket system where everything is tracked only by reference number. What pisses me off was that this wasn't even a DMCA request-
493.
▲
by
aphyr
15y ago
Sure. This is a really quick off the cuff summary, so I'm gonna say some things that are loose, out of date, or maybe flat out wrong. Comments welcome. :) The ideal situation is that both datacenters can handle your total load, but when o
494.
▲
by
aphyr
15y ago
We established multiple datacenters across different providers with active-active DNS, so neither of them could take us down. It's not really for the faint of heart, though. We spent a fair amount of time trying to get the right services to
495.
▲
by
aphyr
15y ago
A large (10m uniques/mo) web site I used to work for had a complete DMCA takedown process in place. Links on every page, web forms, contact emails, physical addresses, etc. Then our site went dark one evening. I spent an hour frantically tr
496.
▲
by
aphyr
15y ago
Possibly. I haven't read the particular technique they're planning to use here, but I recall some old attacks against Bind relied on query reflection, which might work in the absence of cached data.
497.
▲
by
aphyr
15y ago
No; the root nameservers have fixed IPs. Those IP addresses, and those of the vulnerable DNS servers to be used as reflectors, can be written down beforehand.
498.
▲
by
aphyr
15y ago
But simultaneously, the subcities are not repeatable in that the relationship between the intercity roads and the local infrastructure will be kinked; you need to adapt the circular intercity infrastructure (both the subway and local road
499.
▲
by
aphyr
15y ago
I don't understand why the author chose to kink the subways to preserve the same orientation in each satellite. Those corners are going to slow down trains and impose more wear, which means more failures. It also adds a huge amount of track
500.
▲
by
aphyr
15y ago
I've been working on this problem, in various forms, for the last ten years. It's pushed me to write https://github.com/aphyr/reimann , a network event stream processor for centralized graphing, metrics, dashboards, alerting, and analytics
501.
▲
by
aphyr
15y ago
Event loops and asynchronous reactor patterns have been around since what, the late 70s? Node "callback soup" is isomorphic to the structured programming models of dataflows and transactional architectures. Event-reactor systems with async
502.
▲
by
aphyr
15y ago
http://www.infinitelooper.com/?v=-sfZqL4Plxc&p=n#/260;27...
503.
▲
by
aphyr
15y ago
What I'm pointing out is that "steps" are arbitrary; they're not intrinsic properties of the system. You can express the entire program as a definition tree without ordered expressions.
504.
▲
by
aphyr
15y ago
No. You're thinking imperatively. The pure form would express something like: "given the property sorted(s) defined in this way, let s be a set such that for all elements e of s, e is an element of the program input. Then let the output of
505.
▲
by
aphyr
15y ago
Riak has many shortcomings, but I wouldn't describe latency or installation as primary concerns. Our cold response times have a 99% bound of 8ms, and median of 5ms on commodity SSDs. Installation is handled by apt and is trivial to automate
506.
▲
by
aphyr
15y ago
Ruby and Python (not to mention basically every other language) have a plethora of threaded, forking, and evented models for concurrency. Thin/Rack/Sinatra, for example, behaves capably in a thread-per-request mode. Reactor systems are not
507.
▲
by
aphyr
15y ago
Nil was a part of Lisp 1, which is why I was confused. It predates Algol W by seven years. As null references and nil are somewhat different beasts, I'm not sure the criticism "billion dollar mistake" applies fully.
508.
▲
by
aphyr
15y ago
Nils are a very bad code smell. They come from C's null, which is a billion dollar mistake[1], according to its creator: Tonny Hoare. Specially now that we have monads[2, 3]. Do you have a source for this? I was under the impression nil w
509.
▲
by
aphyr
15y ago
I disagree. I find it most natural to assume nil and false are negatively charged because that's how the language is defined . If I want to differentiate between nil and false, I use .nil? or == false. Somehow this has never been a problem
510.
▲
by
aphyr
15y ago
No. I think individual fingers are actually less precise than manipulating an object with the whole hand. For one, it's hard to see what's under your fingertip, whereas a stylus can be very thin. You're able to use more muscles and apply le
More ›