Multi-level cache sensitive indexing method

A multi-level, indexing technology, applied in structured data retrieval, special data processing applications, instruments, etc., can solve problems such as dependence on hardware resources, achieve the effects of expanding capacity, improving utilization, and reducing height

Inactive Publication Date: 2016-10-26
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF4 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At the same time, the technology proposed in patent [2] adopts hardware prefetching technology, which can expand the capacity of tree nodes and improve query efficiency, but it depends on the hardware resources of the computer itself.

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
  • Multi-level cache sensitive indexing method
  • Multi-level cache sensitive indexing method
  • Multi-level cache sensitive indexing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 2

[0056] Embodiment 3 of the present invention introduces a method for inserting a disk page where a keyword is located in a leaf node. The specific steps are as follows:

[0057] A. If the number of keywords contained in the leaf node is less than the threshold, execute step B. Otherwise, go to step E

[0058] B. Determine the page number pid where the keyword key is stored;

[0059] C. If Extend min_key or max_key and increase the number of keys in the node flag:

[0060] D. Obtain the Bloom filter corresponding to the page in the leaf node according to pid-min_pid, and insert the key into the current leaf node

[0061] The Bloom filter, end.

[0062] E. For the leaf node N to be split, create two new nodes N 1 , N 2 ;

[0063] F. Set N 1 The scope of the included keyword key:

[0064] G. Set N 2 The scope of the included keyword key:

[0065] H. For the keyword key in N, if the key is in N 1 Within the range, update N according to the pid of the page where 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

The invention relates to a multi-level cache sensitive indexing method for a database, and belongs to the technical field of efficient database query in computer databases. An index structure is divided into two levels by studying the behavior characteristics and the physical characteristics of different levels of storage media, and the different levels are specially optimized according to the difference of the storage media. The internal nodes of an index tree are similar to those of a B+ tree, and the node fan-out degree of the internal nodes is improved for the main memory-cache level according to a cache access mechanism by adopting an internal node division mode. By adopting a compression coding mode on keywords inside internal node subareas, the utilization rate of the main memory space utilized by the internal nodes of indexes is improved, and the cache hit rate is improved. The leaf nodes of the index tree are Bloom filters for establishing pages for storing keywords in a memory by adopting the Bloom filter technology in the probability theory based on the magnetic disk-main memory level, and are organized into index leaf nodes, so that the number of magnetic disk exchanges in the query process is reduced.

Description

technical field [0001] The invention relates to a multi-level cache-aware indexing method, which belongs to the technical field of high-efficiency query in computer space databases. Background technique [0002] Patent [1] optimizes the memory page to improve the efficiency of the main memory and disk level, but does not involve the main memory-cache level. The B+ tree index method proposed in [5] occupies an important position in traditional databases. In order to improve the B + - The cache-awareness of the tree, Jun Rao proposed its variant CSB in the literature [2] + Tree (CacheSensitive B + -Trees). CSB + The update operation of the tree is similar to B + tree, with B + The tree is different in that each node of the CSB+ tree only retains a few pointers. By reducing the number of pointers in the node, the same cache space can retain more keywords, thus showing better performance. The T-tree index method proposed in literature [3] has excellent overall performan...

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/29
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