Index method for main storage database based on T-lt tree

A database and indexing technology, applied in the field of database indexing, can solve problems such as tree imbalance, high overhead, and inapplicability to main memory databases

Inactive Publication Date: 2009-11-25
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF2 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0016] Among them, patent ② and papers ① and ② are all about the indexing mechanism of B-tree and B+ tree, which are suitable for disk-based database indexing mechanisms, but not for main memory databases, and are similar to balanced binary trees in terms of time and space overhead; patent ① an

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Index method for main storage database based on T-lt tree
  • Index method for main storage database based on T-lt tree
  • Index method for main storage database based on T-lt tree

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach

[0112] (1) After creating the data table, we create an index based on the T-lt tree for the given attribute and store it in the disk file;

[0113] (2) When NHSecure starts, first read the data file and the index file from the disk into the memory respectively, and build an index based on the T-lt tree in the memory;

[0114] (3) When executing SQL operations, only the data and index structures in the memory are updated;

[0115] (4) NHSecure saves the updated data files and index files to the disk in time after the SQL operation at regular intervals;

[0116] (5) When exiting NHsecure, first store the data file and index file in the corresponding disk file, and then exit.

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides an index method for a main storage database based on a T-lt tree, improving the defect of the T tree, adding a tail pointer on each node of the T tree which directly points to a successor of the node to form a T-lt tree. The index method comprises a database inquiring operation, a keyword insertion operation and a keyword deleting operation. The node structure of the T-lt tree has one more tail pointer than the T node. If the node has a tail node, the tail pointer points to the tail node. If the node has no tail node, the tail pointer directly points to the successor. The tail node of the T-lt tree has one more pointer which directly points to the successor than the T node. The method reduces the traversal number to the tree, decrease the rotation number of the tree, can improve the inquiring efficiency in the main storage database and saves the space time spending.

Description

technical field [0001] The invention relates to a database indexing method, which is mainly applied in a database management system based on main storage, and belongs to the field of computer databases. Background technique [0002] As large-capacity memory becomes cheaper and cheaper, it is now easier to configure a computer with a large amount of memory. As far as the database system is concerned, it is already possible to keep the "main version" of the database in memory, which can greatly improve system performance, such as a large reduction in I / O operations, transaction state transitions and associated CPU caches Substitutions are greatly reduced, lock contention is reduced, more efficient in-memory lookup structures and query processing can be used, etc. [0003] The "master version" of the database or the database system in which the entire database is resident in memory is called a main memory database (MMDB, Main Memory Database). Due to the different characteris...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 秦小麟柏传杰戴华
Owner NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap