Patent ID: 6571250
Filing Date: 2003-05-27
Classification: G06F,Y10S

Abstract:
A data management method using a B-tree index for managing identification information relating to data containing a key as a data pointer, and for finding a data pointer relating to the key based on a key value,said method having a data structure with which a plurality of data pointers relating to a key are stored, which is different from that of a leaf node storing an index entry containing the key, and in which data can be pointed to from an index entry containing the key to realize concurrent access in a plurality of processes, and comprising the steps of: when a data pointer relating to a key is added or deleted, obtaining a first log record containing information about adding or deleting a data pointer to or from the data structure storing the plurality of data pointers relating to the key; updating an index entry containing the key stored in a leaf node; obtaining a second log record containing information that the data pointer has been added or deleted to or from the data structure; and adding or deleting the data pointer to or from the data structure, and when a result of a process in which the data pointer is added or deleted is canceled, determining whether or not the data pointer has been added or deleted to or from the data structure by using information in the second log record; and adding or deleting the data pointer to or from the data structure according to information in the first log record if it is determined that the pointer has not been added or deleted to or from the data structure.