Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method of read-optimized memory database T-tree index structure

A tree index and database technology, applied in the computer field, can solve problems such as height and Cache hit rate limiting performance, and achieve the effect of improving Cache hit rate, reducing data access time, and improving operability

Inactive Publication Date: 2014-07-02
XI AN JIAOTONG UNIV
View PDF4 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In the case of a small amount of data search, the AVL tree is widely used because of its simple programming and high algorithm efficiency. However, in the face of large data volume access, the height of the tree and the Cache hit rate become factors that limit its performance. We need to consider using other data structures to replace it

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
  • Method of read-optimized memory database T-tree index structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0016] The present invention will be described in detail below in conjunction with the accompanying drawings.

[0017] A read-optimized in-memory database T-tree index structure, comprising the following methods:

[0018] The first step is to construct the data structure of the t-T tree with reference to the accompanying drawings: according to the existing data, similar to the ordinary T-tree index establishment process, the T-tree index structure is established, and the data is processed according to the size N of the nodes in the T-tree structure Insert operation, find the position of the first data not greater than the current value, perform insertion, and sometimes need to move the position of some data; if the data in a node is full, a new node needs to be allocated to store the data, and at the same time, if the current node's The height difference between the left and right subtrees is greater than or equal to 2, and the tree rotation operation is required to maintain t...

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

Disclosed is a method of a read-optimized memory database T-tree index structure. The method includes: for creating a data structure of a t-T tree, building a T-tree index structure according to existing data, performing insertion operation on the data according to size N of nodes in a T-tree structure, guaranteeing orderliness of data in the nodes, further performing split operation if one node is filled up with the data so as to guarantee balance of the tree, and do not performing any operation on internal T-tree left-right subtree fields in the tree structure in the stage in the process of creating the t-T tree; performing data query operation in the built t-T tree, wherein query operation is divided into single-value query and range query. High data access efficiency provided by the T-tree structure is fully utilized, so that good read performance is provided on the whole; cache hit ratio is increased by the aid of a cache locality-sensitive algorithm and by reduction of use of pointers.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a method for reading an optimized memory database T-tree index structure. Background technique [0002] In the database system, in order to speed up data access, an index structure can be established, and the index structure is a structure in which the values ​​of one or more columns (for example, the last name (lname) column of the employee table) are sorted. If you are looking up a particular employee by his or her last name, the index helps to get the information faster than searching all the rows in the table. Common disk database indexes include B-tree index, B+ tree index, and T-tree index. Their use can significantly reduce the number of disk I / O. With the reduction of memory prices, memory database technology has been widely used. Different from the disk database system, the memory database system significantly reduces or eliminates the disk I / O during dat...

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
CPCG06F16/2246G06F16/2453
Inventor 段章峰伍卫国钱德沛崔金华王寅峰
Owner XI AN JIAOTONG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com