8. The method of claim 1 , further comprising merging ordered data entries.
8. The method of claim 1 , further comprising merging ordered data entries. 9. The method of claim 8 , wherein said merging results in a storage space requirement for said index that is characterized according to an equation: 
 O(nK 2 (K+m)/m) wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.