The time complexities of the search algorithms given
in the previous section all depend on the number of
intervals in the interval lists instead of the numbers
of IDs. For example, the time complexity of the
PROBEISECT algorithm is O.m n log m/ where n
denotes the number of interval lists and m denotes the
number of intervals in each interval list. Thus, if the
interval lists in Ginix contain fewer intervals, the search
algorithms will be faster. On the other hand, interval
lists containing fewer intervals will require less storage
space.