virtuabhi

32 ms·

301.
by virtuabhi 13y ago
Indexes do not solve the locality problem (see Non-clustered indexes). Even for in-memory databases, it is non-trivial to minimize cache misses in irregular data structures like B-trees. Now why MapReduce "might" be a better fit f
302.
by virtuabhi 13y ago
Single hardware with many cores does not give the same performance as multiple machines. For example, consider disk throughput. If the data is striped across multiple nodes then the read request can be executed in parallel, resulting in lin
303.
by virtuabhi 13y ago
My thoughts exactly. I had assumed that tpateck would have magnified a figure of speech (e.g. full control -> judge can only appoint not remove), ranted about some obtuse point (e.g. which foreign government does not spy), and enjoyed th
304.
by virtuabhi 14y ago
I listened to his presentation. IMHO the presenter laid too much stress on parallelism and concurrency being different, but never explained the difference clearly and succinctly. But from the presenter's side, I can see that he needs to sel
305.
Is iPad for production and Nexus 7 for consumption?(news.cnet.com)
1 points by virtuabhi 14y ago|0 comments
306.
by virtuabhi 15y ago
Instead of plain redundancy, error correcting codes (e.g. Hamming code) should be able to control errors http://en.wikipedia.org/wiki/Error-correcting_code#List_of_e...
307.
by virtuabhi 15y ago
Here is that article by Joel Stein http://www.time.com/time/magazine/article/0,9171,1999416,00....
308.
Model checking with Spin(ubirevera.wordpress.com)
5 points by virtuabhi 17y ago|0 comments
309.
Combining different software licenses(ubirevera.wordpress.com)
1 points by virtuabhi 17y ago|0 comments