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. 
I can do that of getting one single familyl and get the guideposts for them but the above logic of arranging the guideposts and creating keyranges from it and then intersecting from the regions would work fine right?
So assume there are two regions (A -D) (E - J)
and the collected guide posts have A C E G I
So we will create keyranges from this [] A, A C, C E, E G, G I, I [].
And then intersect with the region boundary which will give you
A C, C E, E G, G I, I J.