High dimension data index structure design method based on solid state hard disk

An index structure, high-dimensional data technology, applied in the direction of electrical digital data processing, special data processing applications, computing, etc., can solve the problems of reduced performance, increased read operations, and reduced gap between reading and writing of solid-state hard drives, so as to improve efficiency Effect

Inactive Publication Date: 2012-07-04
PEKING UNIV
View PDF3 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the biggest problem with this method is that as the length of the log chain increases, the read operations on the log chain will increase dramatically
In particular, the closer the node is to the root node, the longer the log chain (because the update of the upper layer of the R tree is very frequent), and on the

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
  • High dimension data index structure design method based on solid state hard disk
  • High dimension data index structure design method based on solid state hard disk
  • High dimension data index structure design method based on solid state hard disk

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] The specific implementation manners of the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. The following examples serve to illustrate the present invention, but do not limit the scope of the present invention.

[0055] The excessively long log chain in the RFTL method is the main factor causing the degradation of read performance. The core idea of ​​the present invention is to merge fragments previously scattered in different parts of the log chain together, which will ensure that access to each layer will only result in one read operation at most. In addition, the compressed logs of different nodes will be merged into one page as much as possible, thus significantly reducing the number of writes.

[0056] Such as figure 2Shown is an overview of the index structure design of the present invention. The top layer is the application program, which sends requests, which are divided into two categ...

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 relates to a high dimension data index structure design method based on a solid state hard disk, which includes the following steps: an index structure is divided into an original R tree area and a node difference log area which are respectively used for storing original version data and difference logs of the original version and the latest version; a Hashtable is designed in the internal storage to store nodes and update information in corresponding relation to the position of the node difference log area; once a new update is finished, update log of an earlier time at the node is read out, and then the log and the current log are combined and stored again to serve as all updated logs at the node so far. Based on the previous R tree, the node difference log area is added, node difference logs are designed, and random update operation is changed to random update so as to improve update efficiency. The node difference logs are capable of enabling logs aiming at a certainnode to be stored within a certain range, and read operation of the node difference log R tree is at most twice that of the previous R tree.

Description

technical field [0001] The invention relates to a database index structure, in particular to a high-dimensional data index structure design method based on a solid state disk. Background technique [0002] R tree is one of the most widely used high-dimensional data index structures. The traditional R-tree design assumes that the external storage is a disk. As flash memory technology matures, flash-based SSDs are widely used. Due to the characteristics of flash memory, the random update of SSD is relatively slow. Due to the large number of random update operations in the R-tree structure, the traditional R-tree design cannot well adapt to the characteristics of SSDs. [0003] From large data centers to small embedded systems, flash memory is an ideal substitute for hard disks and is widely used in different systems. Such a large-scale application mainly benefits from its excellent I / O characteristics, high reliability and low power consumption. Flash-based disks, such as...

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 PEKING UNIV
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