... (N-grams) are equal.4.3 Searching for a RecordWe construct a B+-tree for each N-gram file in thedataset for N = 2, 3, 4, 5, and keep the key of thefirst N-gram for each file in memory. When a ... second.5A rotational latency should also be taken into account be-fore the sequential reading can be done.2, and so forth. For example, for a given query OurHonorable , the record that would be pointed ... performed bymoving all the tokens in positions 0 (p − 1) to theend for each N-gram in the data set. Thus, for allthe bigrams in the data set, we need one extra copysorted in position 1, for...