Partial Range Query on Inverted File with Combined Index
I don't think you've got the idea for an inverted file quite right.  If there are three attributes (X, Y, and Z), the natural approach is to have three inverted lists:


The first list maps from the value of X to the record (or from the value of X to the Name, if the Name is unique for each record and is how the record is identified).
The second list maps from the value of Y to the record (or from the value of Y to the Name, if the Name is unique for each record).
The third list maps from the value of Z to the record (or from the value of Z to the Name, if the Name is unique for each record).


So, if there are three attributes, we might end up with three inverted files.

See Figure 1.2 in the book for an example of an inverted file.



Now for the idea of a combined index.  A combined index for the attribute ordering XYZ would be a sorted list of records, where the sort order works as follows:


If two records differ in their X attribute, then order them by the value of their X attribute (and ignore their Y,Z attributes).
If two records have the same X attribute but differ in their Y attribute, then order them by the value of their Y attribute (ignoring their Z attribute).
If two records have the same X and Y attributes but differ in their Z attribute, then order them by the value of their Z attribute.


This is known as lexicographic order, where the attributes are taken in the order X,Y,Z.  You can think of this as XYZ-lexicographic order.  Once we sort using this particular order, we get a combined index for the attribute ordering XYZ.

Of course we could also form a combined index for other attribute orderings as well.  We might form multiple combined indices, each with a different attribute ordering.  The order in each combined index is different.  If there are $n$ attributes, we could have up to $n!$ different combined indices, corresponding to the $n!$ different permutations (orderings) on the $n$ attributes.  Nothing says we have to store all of those possible combined indices; we could store just one of them, or some of them, or all of them, or none of them.



A combined index is different from an inverted file.

However, you might notice that if you have a combined index for attribute order XYZ, then this obviates the need for an inverted file for attribute X, since you can use the combined index for XYZ in any place where you would have wanted an inverted file for X.



This is all explained pretty clearly in the book you cited.  I recommend you work through the example in Figures 1.1 and 1.2 in the book, to better understand inverted lists.