Key value mapping method for linear data table

A mapping method and data table technology, applied in the field of data table processing, can solve problems such as low efficiency and inability to meet the needs of large data volume processing, and achieve the effect of enhancing scalability

Inactive Publication Date: 2012-06-27
ELECTRIC POWER RES INST OF STATE GRID ZHEJIANG ELECTRIC POWER COMAPNY +1
View PDF1 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Other methods, such as the direct mapping method, although there is no conflict

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
  • Key value mapping method for linear data table
  • Key value mapping method for linear data table
  • Key value mapping method for linear data table

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] row index data content illustrate 1 This is data row. Index = 1. data line 1 2 This is data row. Index = 2. data line 2 … This is data row. Index = n. other data rows

[0026] The key-value mapping steps of the present invention are as follows:

[0027] 1. First create a row information structure for the first row of data, the value of which is:

[0028] Structure index: take the row index number minus 1, the first row is 0.

[0029] Key value: Initialized to 0, the value is calculated in a subsequent step.

[0030] Key-value type: take 0, which means an integer type.

[0031] Key value length: The value of the integer type is 4, which means it occupies 4 bytes of space.

[0032] Data length: Take the actual length of the data, the first line of data is 27.

[0033] Reserved unit: currently not used, initialized to 0.

[0034] External data flag: non-external data, the value is 0.

[0035] structure index key v...

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

In the conventional mass data mapping methods, though some methods solve conflict problems to a certain degree, the key value mapping efficiency is reduced; and though some methods have no conflict problems, the efficiency is low, and requirements on large data processing cannot be met. The invention provides a key value mapping method for a linear data table. The key value mapping method comprises the following steps of: loading data, and building a row information structure for each row of data; after loading data successfully, selecting a key value function for generated key value information, and taking the value of the key value function as a storage address of the key value function; filling a key value result into the row information structure, and detecting key value conflict; recalculating the key value if a conflict is existent till obtaining a unused key value; and storing the row information structure into a key value table, taking the first row of data address is a first address, and storing the data into a mapping data region. By application of the method disclosed by the invention, mass data can be inquired in a manner with high-efficiency, flexibility and low resource occupancy rate.

Description

technical field [0001] The invention relates to a data table processing method, in particular to a linear data table key-value mapping method. Background technique [0002] At present, hash table mapping is mainly used when establishing key-value mapping for massive data tables. The elements in the hash table are determined by the hash function, and the key K of the data element is used as an argument, and the value is calculated by a fixed function, which is the storage address of the element. No matter how finely the hash function is designed, conflicts will occur, that is, the keywords of multiple data elements are mapped to the same place. Therefore, other auxiliary algorithms must be introduced to solve the conflict problem. Although the addition of auxiliary algorithms solves the conflict problem to a certain extent, it reduces the efficiency of key-value mapping, which is contrary to the design goal. [0003] Other methods, such as the direct mapping method, althoug...

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 ELECTRIC POWER RES INST OF STATE GRID ZHEJIANG ELECTRIC POWER COMAPNY
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