While accessing a term stored in a B+ tree in an inverted file i

While accessing a term stored in a B+ tree in an inverted file index, range searchings are expensive.

答案：FALSE