Abstract: Disclosed is a computer program stored in a computer readable storage medium according to an exemplary embodiment of the present disclosure. The computer program executes operations for enhancing search performance of data when the computer program is executed by one or more processors and the operations may include: setting a traverse time stamp of an index search for searching a target index key; searching the index tree along a link connected from a root node of the index tree to a leaf node; writing in a time stamp table at least one index time stamp of the root node and the leaf node passed in the index search; determining whether a path of the index search needs to be changed; and determining a start node of re-search at least partially based on the time stamp table.

Abstract: According to one exemplary embodiment of the present disclosure, disclosed is a computer program stored in a computer readable storage medium. The computer program causes operations for improving data retrieval performance to be performed when the computer program is executed by one or more processors of a computing device, and the operations include: an operation of initiating an index search for retrieving a target index key from a root node of an index tree; an operation of performing an index tree search to a child node along a link connected to the child node; and an operation of reading a currently searched node and determining whether to change an index search route.

Abstract: According to some exemplary embodiments of the present disclosure, a method for index recovery performed by a database server is disclosed. The method is an index redo logging method performed by a database server.

Abstract: The method is an index redo logging method performed by a database server. The method may include performing a first recovery step of determining, by an instruction for recovering via an index redo log comprising an index physical redo log and an index logical redo log, an index tree structure by applying the index physical redo log, wherein the index physical redo log is generated by first index redo logging corresponding to a change of the index tree structure; and performing a second recovery step of performing an index tree search on the determined index tree structure to obtain physical information of the index logical redo log, and applying the index logical redo log to the determined index tree structure using the obtained physical information, wherein the index logical redo log is generated by second index redo logging corresponding to a data change in the index or generated based on a table redo log by the instruction for recovering.

Abstract: Disclosed is a computer program stored in a computer readable storage medium according to an exemplary embodiment of the present disclosure. The computer program executes operations for enhancing search performance of data when the computer program is executed by one or more processors and the operations may include: setting a traverse time stamp of an index search for searching a target index key; searching the index tree along a link connected from a root node of the index tree to a leaf node; writing in a time stamp table at least one index time stamp of the root node and the leaf node passed in the index search; determining whether a path of the index search needs to be changed; and determining a start node of re-search at least partially based on the time stamp table.

Abstract: According to one exemplary embodiment of the present disclosure, disclosed is a computer program stored in a computer readable storage medium. The computer program causes operations for improving data retrieval performance to be performed when the computer program is executed by one or more processors of a computing device, and the operations include: an operation of initiating an index search for retrieving a target index key from a root node of an index tree; an operation of performing an index tree search to a child node along a link connected to the child node; and an operation of reading a currently searched node and determining whether to change an index search route.