vicaya

19 ms·

151.
by vicaya 17y ago
Well, the facts mentioned in the post just confirms my judgment why MooTools/Prototype are bad: monkey-patching existing objects and polluting global namespace like no tomorrow, all in the name of object-orientation in a perfectly capable l
152.
by vicaya 17y ago
Instead of a thinly veiled advertisement, how about some information on the capability of the hardware: histograms of RAM size, hard drives, CPU units (equivalents of some known CPU) and network speed/latency for these "50,000" machines? Wi
153.
by vicaya 17y ago
One caveat: Sector/Sphere is not used by anyone (notable) in the industry. I hope they become a viable alternative to Hadoop as they do have some strong points on paper. OTOH, an industry maven told me recently that "they don't listen" (to
154.
by vicaya 17y ago
He probably equates NoSQL to KV stores that has no chance of having SQL implemented, as they have no efficient range scan capabilities. It's totally feasible to have full SQL (and more) implementation on top over Hypertable.
155.
by vicaya 17y ago
Any reasons why they picked MooTools instead of JQuery? MooTools is a Prototype derivative. Prototype derivatives are huge pains, as they litter the global namespace like they own it, which makes sane mashup implementations practically impo
156.
by vicaya 17y ago
MapReduce is about hiding explicit parallel primitives like threads and MPI from users (programmers): You only need to implement two functions map and reduce in a typical framework. Yes, you can certainly implement MapReduce with MPI partia
157.
by vicaya 17y ago
I'd been a fan of Sector/Sphere and Dr. Gu for a while. But here is the biggest problem of the benchmark: "replication is disabled" for maximum performance, which means these are not realistic benchmarks for large scale clusters (> 200
158.
by vicaya 17y ago
Ousterhout and gang are credible guys, but this is completely back of the envelope vaporware. Some numbers are a bit dubious as well, like 1M request/s per server. Let's say the requests is simple messages like twitter with average length o
159.
by vicaya 17y ago
I'd argue that the integer overflow inside new implementation is a compiler bug.
160.
by vicaya 17y ago
1000 nodes are nothing if you crawl the entire web and keep a history. I'm sure someone already has a modified version of an OSS bigtable cluster at 1PB+ and close to 1k nodes :) >> they don't support range scan efficiently either &
161.
by vicaya 17y ago
They serve different purposes. Riak is a DHT (for key sharding) layer intended to run on top of different backends, just like Dynamo. CouchDB has an integrated storage engine. Riak doesn't support range queries (nature of DHT). I'm pretty s
162.
by vicaya 17y ago
Yet another Dynamo/DHT. Now I've seen implementations in Java (Dynamo, Cassandra, Voldemort), Perl (Blekko) and now Erlang. I wonder if any of these has been used on >1000 node cluster? I haven't seen any mention of checksums (besides t
163.
by vicaya 17y ago
Were you using GCC's __attribute__((__packed__))? Anyway, the standard way (to handle protocols) is to parse the thing not making any assumption of the struct layout.
164.
by vicaya 17y ago
According to Nikolas Askitis' PhD thesis, Judy Array actually underperforms Burst trie (also a sorted collection) by significant margins in both space and time. Burst trie is much easier to implement (a few hundred lines of C++ or Java code
165.
by vicaya 17y ago
I get surprising (to me) amount of stuff done on my 10" netbook (a $200 dell mini 10v) with vim and git, while the kids are asleep, though my "main" dev setup is a 18.4" laptop + a 24".
166.
by vicaya 17y ago
Replication != backup, if you/someone accidentally/maliciously screw up your data with the API, the screw ups are replicated as well, especially with Cassandra, where there is no builtin data versioning. Backups are essential when you're do
167.
by vicaya 17y ago
Well, you can get both with Hypertable, where you can alter table to add/drop column families in O(1) time, while still have schema free benefits with column qualifiers.
168.
by vicaya 17y ago
Well, ad-hoc querying can be implemented in Hypertable with HQL, it's just not a priority at the moment, so features are a bit lacking. I mean, it's not an inherent 'darkside' of distributed database. OTOH, I've done cap shell with HQL an
169.
by vicaya 17y ago
With completely schema-free db, you have to encode 'column' in a key, which means you cannot delete or rename a column easily (in O(1) time).
170.
by vicaya 17y ago
Virtualization is the duct tape. Service is the only thing that matters to users, which can be built more efficiently upon non-hardware-virtualized distributed computing/storage platforms, where OS will be evolved into mainly security conta
171.
by vicaya 17y ago
They need to move to Nevada like Zappo did to avoid incurring the exorbitant CA retail tax and electronics recycle fee. I often picked Amazon even if Newegg is slightly cheaper and faster in shipping.
172.
by vicaya 17y ago
It seems that most of the benefits listed can also be achieved using any decent template system to serve the css files.
173.
by vicaya 17y ago
The behavior of 'this' is from DOM bindings and not from the language per se. Javascript can set 'this' of any calling context to any object with 'apply' or 'call'. The convention for on* handlers is that 'this' is set to the DOM element wh
174.
by vicaya 17y ago
I found 1M messages/day rather too low. So I checked the video, sure enough they have 1B messages/day using close to 10Gbps at peak, with 100+ servers. A correctly built (epoll/reactor based) C/C++ based system should be able to handle that
175.
by vicaya 17y ago
That's what noscript is for.
176.
by vicaya 17y ago
According to his benchmarks, compilation of C code (Pidgin at least) doesn't seem to benefit from SSD, even the 5400RPM drive performs the same. SSD for developers is usually waste of money from technical POV, as the working set usually fit
177.
by vicaya 17y ago
Actually, I found vim quite discoverable, you can pretty much type :help <topic> on anything and you'll see ton of stuff around that are interesting.
178.
by vicaya 17y ago
General concurrent programming is hard because of the shared mutable states and their interdependencies, which are ripe grounds for deadlocks and race conditions. However, there are many successful attempts to solve large chunks of problems
179.
by vicaya 17y ago
It also shows the correct state of merge/rebase in the prompt as well. In many distributions, it's installed as /etc/bash_completion.d/git when you install git from a package management system, you just need to source /etc/bash_completion t
180.
by vicaya 17y ago
gfs1 is still single master, but the workload is much simpler in this case: it serves the gfs2 master bigtable cluster exclusively. Most of the documented gfs master failures are due to misbehaved map-reduce clients. Also the gfs1 master ca

More ›