March 24, 2011

MySQL, hash joins and Infobright

Over a 24 hour or so period, Daniel Abadi, Dmitriy Ryaboy and Randolph Pullen all remarked on MySQL’s lack of hash joins. (It relies on nested loops instead, which were state-of-the-art technology around the time of the Boris Yeltsin administration.) This led me to wonder — why is this not a problem for Infobright?

Per Infobright chief scientist Dominik Slezak, the answer is

Infobright perform joins using its own optimization/execution layers (that actually include hash join algorithms and advanced knowledge-grid-based nested loop optimizations in particular).

Categories: Infobright, MySQL, Theory and architecture 
Subscribe to our complete feed!

Comments

4 Responses to “MySQL, hash joins and Infobright”

  1. Justin Swanhart on March 24th, 2011 9:42 pm

    Both Infobright and InfiniDB can do hash joins. InfiniDB does them in parallel.

  2. Hubi on March 27th, 2011 4:30 pm

    SQL Server too.
    http://msdn.microsoft.com/en-us/library/ms189313.aspx

  3. Randolph on March 31st, 2011 8:49 pm

    What’s a ” advanced knowledge-grid-based nested loop optimization” ?

  4. Curt Monash on March 31st, 2011 11:52 pm

    “Knowledge grid” is an Infobright term.

Leave a Reply




Feed: DBMS (database management system), DW (data warehousing), BI (business intelligence), and analytics technology Subscribe to the Monash Research feed via RSS or email:

Login

Search our blogs and white papers

Monash Research blogs

User consulting

Building a short list? Refining your strategic plan? We can help.

Vendor advisory

We tell vendors what's happening -- and, more important, what they should do about it.

Monash Research highlights

Learn about white papers, webcasts, and blog highlights, by RSS or email.