The investigation of the Gemini algorithm : a file organization and access technique

Includes bibliographical references (page 83)A method of file organization which combines fast access, ease of maintenance, and sequential ordering is proposed for a dynamic random access file. This method, termed the Gemini Algorithm, is a combination of the scatter storage (hashing) technique for the data file and a B+tree index organization. During query and data file record modification processes, only the hash component of the Gemini algorithm is utilized. The B+tree component of Gemini algorithm is utilized solely in the periodic processing. During data file record insertion and deletion, both the hash and B+tree components must be maintained. The major premise behind the development of the Gemini algorithm is that additional overhead can be allowed for data file record insertion and deletion as these processes are relatively minor segment of total file interaction. (See more in text