<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>20bits - Latest Comments in General</title><link>http://20bits.disqus.com/</link><description></description><language>en</language><lastBuildDate>Tue, 20 May 2008 03:17:07 -0000</lastBuildDate><item><title>Re: Facebook Users Are Fans of Entertainment</title><link>http://20bits.com/2008/05/19/facebook-users-are-fans-of-entertainment/#comment-494354</link><description>Hey Jesse,&lt;br&gt;&lt;br&gt;I'm writing a post on this now ... should be up by morning</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Nick O'Neill</dc:creator><pubDate>Tue, 20 May 2008 03:17:07 -0000</pubDate></item><item><title>Re: Facebook Users Are Fans of Entertainment</title><link>http://20bits.com/2008/05/19/facebook-users-are-fans-of-entertainment/#comment-494081</link><description>Thanks!  Send it to your friends. :)</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Tue, 20 May 2008 02:01:19 -0000</pubDate></item><item><title>Re: Facebook Users Are Fans of Entertainment</title><link>http://20bits.com/2008/05/19/facebook-users-are-fans-of-entertainment/#comment-493886</link><description>Fantastic.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">daveambrose</dc:creator><pubDate>Tue, 20 May 2008 01:10:10 -0000</pubDate></item><item><title>Re: Facebook Bans Google Friend Connect</title><link>http://20bits.com/2008/05/15/facebook-bans-google-friend-connect/#comment-478453</link><description>John,&lt;br&gt;&lt;br&gt;I actually agree, in part.  Facebook is trying their hardest to hold&lt;br&gt;onto the monolith they've constructed.  That's certainly something&lt;br&gt;they have that Google doesn't.&lt;br&gt;&lt;br&gt;But you're right in that they think they have more control than they&lt;br&gt;do.  The Microsoft-style lock-in isn't there yet and Facebook has&lt;br&gt;given away its hand.  They can't even emulate Microsoft correctly&lt;br&gt;&amp;mdash; you stay open until everyone is using your platform and then&lt;br&gt;cripple everyone else.&lt;br&gt;&lt;br&gt;Part of it is that these old strategies just aren't as feasible as&lt;br&gt;they once were.  On the network people move too fast to lock them&lt;br&gt;down.&lt;br&gt;&lt;br&gt;The tighter the grip the quicker their users will slip through their fingers.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Fri, 16 May 2008 16:57:05 -0000</pubDate></item><item><title>Re: Facebook Bans Google Friend Connect</title><link>http://20bits.com/2008/05/15/facebook-bans-google-friend-connect/#comment-478193</link><description>You have the right read on the 'press their competitive advantage" - but i'd submit to you that they don't have that yet.   In fact  Facebook came across like Netscape not Microsoft.  Facebook thinks they have sustainability in their platform - not yet.  It's a false sense of security on their part.  They aren't at the Microsoft levels of leverage yet.  In their mind they are but not in competitive strategy.  &lt;br&gt;&lt;br&gt;It's Google who has the leverage not Facebook.&lt;br&gt;&lt;br&gt;Here's my post&lt;br&gt;&lt;br&gt;&lt;a href="http://furrier.org/2008/05/15/facebook-just-pulled-a-netscape-hey-facebook-what-are-you-thinking/"&gt;http://furrier.org/2008/05/15/facebook-just-pul...&lt;/a&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">John Furrier</dc:creator><pubDate>Fri, 16 May 2008 16:24:43 -0000</pubDate></item><item><title>Re: Interview Questions: Two Bowling Balls</title><link>http://20bits.com/2008/04/03/interview-questions-two-bowling-balls/#comment-469962</link><description>Actually it can be proven that 14 is the best (integer) you can get. Proving this can be another interview question :)</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">rouli</dc:creator><pubDate>Thu, 15 May 2008 13:48:27 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-468727</link><description>Perhaps the most important attribute of a B-Tree is that it is a balanced data structure. This is the primary reason that O(log n) operations exist for insert, delete, and search.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jacque Confortis</dc:creator><pubDate>Thu, 15 May 2008 06:00:19 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-464345</link><description>Another important point to mention is when indexes are NOT a good idea. You shouldn't just blindly add indexes for any fields mentioned in a query's WHERE clause. Aside from the insert/update cost and disk space consumption, the optimizer may rightly decide not to use the index in the first place if the fraction of the rows in the table that are satisfied by the WHERE clause is relatively high (say, 5% or more of all the rows in the table). This is because scanning an index requires extra I/O, and random I/O at that.&lt;br&gt;&lt;br&gt;Another interesting interview question is "how would you build a system that can use multiple indexes on a *single* table to answer a single query"? (That is, given WHERE a = k1 OR b = k2, how do you make use of indexes on both a and b?)</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Neil</dc:creator><pubDate>Wed, 14 May 2008 18:59:24 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-462116</link><description>Glad to hear it!  Are you interested in just more database-related articles or something more general?</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Wed, 14 May 2008 14:27:45 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-461994</link><description>I am a developer who is learning MySQL (and general DBA type stuff) and this was great!  I hope you continue to pump out this kinda stuff.  I am adding you to my Google Reader.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bryan Migliorisi</dc:creator><pubDate>Wed, 14 May 2008 14:10:49 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-459295</link><description>Yeah, he wanted you to talk about B-trees, hashes, bitmaps, R-trees, etc.  I would've just asked him to clarify.  Circumspect interview questions are stupid &amp;mdash; ask what you want to know.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Tue, 13 May 2008 23:33:38 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-458975</link><description>I've been asked this in a phone interview before. Went through the whole "makes your queries faster but there's slows down inserts and deletes" stuff fine. But then the interviewer started asking about "types" of indexes. I replied I just knew about the indexing type, and perhaps the "unique" index type of mysql. I can't really figure out if he was trying to get me to talk about the other type (primary key) or the actual methods of indexing (b-tree vs hashing). It didn't seem too essential to the position I was interviewing for anyway.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hung</dc:creator><pubDate>Tue, 13 May 2008 22:20:01 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/2008/05/13/interview-questions-database-indexes/#comment-458821</link><description>Testing DIsqus comments.  Let's see if it works!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Tue, 13 May 2008 21:54:59 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/?p=134#comment-453815</link><description>Moo moo moo</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Tue, 13 May 2008 01:04:05 -0000</pubDate></item><item><title>Re: Interview Questions: Database Indexes</title><link>http://20bits.com/?p=134#comment-453813</link><description>Test</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jfarmer</dc:creator><pubDate>Tue, 13 May 2008 01:03:46 -0000</pubDate></item></channel></rss>