Database indexing method and device

Abstract

An embodiment of the invention provides a database indexing method and device. The method comprises receiving a database operation requirement through a database, performing indexing operation on key values to be operated in the database according to the database operation requirement, wherein the database is in a T-Tree data structure, each node in the T-Tree stores the key values through a binary tree structure, and accordingly, indexing can be performed according to the T-Tree data structure, the binary tree structure of each node in the T-Tree when indexing is performed on the key values to be operated in the database, and the indexing efficiency in the database is improved.

Description

technical field [0001] The invention relates to computer technology, in particular to a database indexing method and device. Background technique [0002] The working data in the memory database is data that resides in the memory. It does not need to read the data from the disk before processing, and does not need to write the result back to the disk after processing, thus saving the time of disk input and output I / O. [0003] In the memory database, the T-Tree algorithm is widely used, in which the data of the T-Tree nodes are stored tightly and can be stored in an array. When inserting a new data in the middle, multiple data in the array must be continuously moved to make room for the new data. Moreover, when inserting new data into a full node, if the data is to be inserted into the middle position, the smallest data in the node must first be inserted into the left branch of the current node, that is, the overflow; or the largest data in the node must be inserted into I...

AI Technical Summary

Problems solved by technology

[0004] However, when inserting data in the T-Tree algorithm, recursive operations are usually used, which requires a large amount of data movement, resulting in inefficient indexing in the database

Images