title: Mysql B+ Tree implementation
body: <p>Mysql uses B+ tree for implementing indexes. Lets say my primary index is of type (name, age, city). Can someone throw some light how Mysql implements a B+ tree on these kinds of keys ?</p>
  
  <p>My hunch is that it treats the whole tuple as a key and it treats it like a partial order. Eg: </p>
  
  <p>(John, 24, New Jersey) &lt; (John, 24, New York) &lt; (John, 25, New Jersey) &lt; (John, 25, New York)</p>