Supercharge Your Innovation With Domain-Expert AI Agents!

A Dynamic Programming Data Sharding Optimization Method Based on Range Query Boundary Set

A technology of data sharding and dynamic programming, applied in database indexing, structured data retrieval, special data processing applications, etc., can solve problems such as poor feasibility

Inactive Publication Date: 2021-10-15
GUANGXI NORMAL UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Such problems can be solved by enumeration, but the complexity of enumeration methods is mostly exponential, and the feasibility is poor

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
  • A Dynamic Programming Data Sharding Optimization Method Based on Range Query Boundary Set

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0015] A dynamic planning data fragmentation optimization method based on the range query boundary set, including the following steps:

[0016] 1) Establish a data access probability model under the range query load: Define the collection of all boundaries of the range query on the data set, called the range query boundary set, in the record-based data organization mode, a data record query cumulative probability = data record The number of times / total queries that are queried by the load is queried, define the king DD DS in a data sheet-based data organization mode. k Length length k , Data sheet DS k The query cumulative probability is P k , Data sheet DS k Query cumulative probability P k Take the value of DS k The maximum value of the query cumulative probability of the data recorded;

[0017] 2) Find the optimal K-shard: Based on dynamic planning method, find the optimal K-slice of this optimization target can be broken down into find a optimal slice position B 1 , Make dat...

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 discloses a dynamic programming data fragmentation optimization method based on a range query boundary set, which is characterized in that it comprises the following steps: 1) establishing a data access probability model under a range query load; 2) finding the optimal K-shard ; 3) Repeat step 2), the calculation of the optimal query cost can be decomposed iteratively until all K-1 optimal slice positions b are found 1 , b 2 ,...,b K‑1 , then the optimization objective is transformed into the query cost C(b i , b j ), the sum of i, j ∈ [1, N]. This method uses the dynamic programming method to search for the optimal slice location in the range query boundary set. The optimal data slice can reduce the management and maintenance cost of data, as well as the positioning and addressing cost and transmission cost in data query, and improve query efficiency.

Description

Technical field [0001] The present invention relates to a data fragmentation optimization technique under a range of tilt properties on large data, and is specifically a dynamic planning data fragmentation optimization method based on a range query boundary set. Background technique [0002] Data slice is a horizontal or longitudinal segmentation of the table, which is the strategy of the data management system in the face of large-scale data, that is, the "scored" idea management data. Original data is recorded as a particle size to organize and manage, the cost is amazing, and each record has a location addressing overhead and transfer overhead, so the query optimization in the recorded data organization is also limited. . [0003] In some combination optimization issues, optimized goals are to maximize or minimize a particular target value. Such problems can be solved by enumeration, but the complexity of the enumeration method is mostly the index level, feasibility. Inventiv...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/22
CPCG06F16/2282
Inventor 葛微李先贤王金艳
Owner GUANGXI NORMAL UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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