Organization of multi-access in databases

Abstract

A particular, but important problem of freeing database memory in multi-access conditions is considered. A number of solutions to this problem are proposed and their advantages and disadvantages are noted. Three methods of organizing work with free space are considered. The first method assumes two additional modes of capturing pages: “Joint deletion” and “deletion”. In the second method, the pages after the last tuple have been deleted are inserted at the end of the free list. The third method involves the actual presentation of the freed pages of the relationship to the free memory pool of the segment and is postponed until the relationship is reorganized.