can span multiple disk pages. To mi

can span multiple disk pages. To minimize the number of I/O operations to retrieve each list Si, the
system would attempt to keep each list Si in a set of consecutive disk pages, so
the entire list can be retrievedwith just one disk seek.A B+-tree index can be used
to map each keyword Ki to its associated inverted list Si .