- METHOD FOR MANAGING T-TREE INDEX KEY IN MAIN MEMORY DBMS

摘要

1. the art that the invention defined in the claims; The invention of tea in the main memory database management system - will on tree index key management.; 2. The invention attempts to solve the technical challenges; The present invention is based on the T- tree is the most widely used as the index structure of the main memory DBMS intended to provide a variable-length key, multi-attribute key, which can effectively support the duplicate key index key management method.; 3. Resolution of the subject matter of the invention,; The present invention, in the index key management method in a T- tree index that is applied to the main memory database management system (DBMS),; T- inside the tree, the object is the number of attributes that make up the key, and to store the T- tree index structure consisting of and, in the non-key value object address information for the attribute, the value of the key corresponding thereto but to obtain from, should the key comprises a variable-length key (variable-length keys), a multi-key attribute (multiple-attribute keys), a duplicate key (dupllicated keys).; 4. An important use of the invention,; The present invention is used to fight T- tree index structure in the database management system (DBMS).