MAINTAINING VERY LARGE INDEXES SUPPORTING EFFICIENT RELATIONAL QUERYING

摘要

The merger of a small sort vector with a big sort vector by the use of low limit and high limit pointers which are intialized to point into the big sort vector f or each entry in the small sort vector. The merge of the big and small sort vectors is carried out by successive refinement passes through the small sort vector to achieve the convergence of the low and high limit pointers. The convergence point for the pointers indicates the insertion point for each entry in the small sort vector in the big sort vector. The converged limit pointers are used to define the merged big and small sort vectors.