Dynamic hybrid indexing method for non-relational database

A non-relational, dynamic hybrid technology, applied in database indexing, structured data retrieval, digital data information retrieval, etc., can solve the problems of not supporting non-primary key fields to build indexes, and unable to support index queries.

Active Publication Date: 2019-07-30
DONGHUA UNIV
View PDF2 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The technical problem to be solved by the present invention is: the key-value pair non-relational database itself does not support non-primary key fields to build an index, although the non-primary key fields can be enc

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
  • Dynamic hybrid indexing method for non-relational database
  • Dynamic hybrid indexing method for non-relational database
  • Dynamic hybrid indexing method for non-relational database

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0112] Below in conjunction with specific embodiment, further illustrate the present invention. It should be understood that these examples are only used to illustrate the present invention and are not intended to limit the scope of the present invention. In addition, it should be understood that after reading the teachings of the present invention, those skilled in the art can make various changes or modifications to the present invention, and these equivalent forms also fall within the scope defined by the appended claims of the present application.

[0113] A kind of non-relational database dynamic hybrid indexing method that the present invention relates to mainly has the following four parts:

[0114] (1) The non-primary key index structure of the key-value pair non-relational database is established.

[0115] (2) Defines the weight of non-primary key fields. The weight value of the field is updated according to the frequency of the field as a query condition in a perio...

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 dynamic hybrid indexing method for a non-relational database, which is characterized by comprising the following steps of establishing a non-primary key indexing structure of a key value pair non-relational database; defining the weight of the non-primary key field, and updating the weight value of the non-primary key field by taking the field as the frequency of the query condition and the historical weight of the field within one period; dynamically dividing index types; and carrying out hybrid indexing. According to the mixed indexing method of the key value pairnon-relational database provided by the invention, the conditional query efficiency of the non-primary key field can be effectively improved. The method overcomes the defect that the key value pair non-relational data does not support the non-primary key field and does not support the index query, and establishes the mixed index of the non-primary key field. In terms of big data storage, the function of quick query is achieved, and unnecessary storage expenditure is saved.

Description

technical field [0001] The invention relates to a method for establishing an index in big data retrieval, and belongs to the technical field of big data storage and retrieval. Background technique [0002] Distributed non-relational databases have high availability, high scalability, and high reliability, and are often used as storage support for big data. Distributed non-relational databases are divided into document type, key-value pair type, etc., and they have their own shortcomings. Some non-relational distributed databases of key-value pairs have dynamic scalability in fields and can flexibly store data of different structures, but they can only perform primary key index queries, and non-primary key queries can only scan and search. [0003] Many scholars have conducted research on this problem, and have also proposed some solutions to improve the retrieval speed. When storing some special data, some main fields can be encoded into the primary key to improve query ef...

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): G06F16/22G06F16/245G06F16/2458
CPCG06F16/2246G06F16/245G06F16/2462Y02D10/00
Inventor 章昭辉蒋昌俊王鹏伟张晓波
Owner DONGHUA 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