Phoenix-180

A fresh pull request with all the changes for guideposts. 
Tested in a single cluster for different combinations. 
"SELECT count(*) FROM  %s WHERE host='CS' AND domain='Apple.com' AND FEATURE >= 'Dashboard' AND FEATURE <= 'Report';" % (table)) 
With 5000000 rows
Withoutpatch
===========
COUNT(1)
----------
    555169
Time: 2.264 sec(s)
Withpatch
=========
  COUNT(1)
----------
    555169
Time: 0.813 sec(s)

Withoutpatch
==========
  COUNT(1)
----------
   1002201
Time: 1.889 sec(s)
Withpatch
==========
  COUNT(1)
----------
   1002201
Time: 1.075 sec(s)

Am sure we would get better results if we are able to tune the guidePosts width so that instead of fetching in the range of 1000s inside a region we can fetch 10ks of result in every chunk.  Also should work with bigger tables and more rows.
The tests were performed with 256*1024 and 1024 * 1024 as the guidepostsWidth size. 
The main thing you can observe in the above case is that the query targetted to single region is parallelized and distributed to smaller chunks and so the work done by every thread is less. 
We don't want to do an intersect here. We want to do a merge sort between the region boundaries and the guideposts along these lines:

* get the region boundaries (we know these ranges cover the table completely)
* merge bisect the region boundary ranges with the guideposts. The
guideposts are keys, not ranges. Normally a guidepost (gp1) to its
next guidepost (gp2) will not span a region boundary. If it does, it
means that a split has occurred and the guideposts have not been
updated. In that case, you'd get an extra range from gp1 to
region.upperRange and from region.upperRange to gp2.

So the processing would be along the lines of walking through both the
region boundary ranges and the guideposts like a merge sort, bisecting
when necessary.