Supercharge Your Innovation With Domain-Expert AI Agents!

A count-min digest method and apparatus based on erasure code

An erasure code and summary technology, applied in the field of network communication, can solve the problems of query error and difficult to define query error, and achieve the effect of reducing query error

Active Publication Date: 2019-03-29
NAT UNIV OF DEFENSE TECH
View PDF8 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, the existing count-min summaries have query errors, and the query errors depend on the distribution of the values ​​of the common location keys, and it is difficult to define the query errors in advance

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 count-min digest method and apparatus based on erasure code
  • A count-min digest method and apparatus based on erasure code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0017] In order to make the object, technical solution and advantages of the present invention clearer, the implementation manner of the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0018] refer to figure 1 , which is a schematic flow chart of an erasure code-based count-min summary method provided by an embodiment of the present invention. The specific process is as follows:

[0019] The first step is to build a count-min summary structure based on erasure codes.

[0020] The second step is to perform the insert operation.

[0021] The third step is to perform the decoding operation.

[0022] The fourth step is to execute the query operation.

[0023] Introduce in detail the concrete technical scheme of the embodiment of the present invention below:

[0024] The first step is to build a count-min digest structure (abbreviated as ECM) based on erasure codes. One ECM includes k bit arrays. Each bit array inc...

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

Embodiments of the present invention provide a count-min digest method and apparatus based on erasure code, which includes: constructing a count-min summary structure based on the erasure code; performing an insert operation to insert a value corresponding to the to-be-inserted key and the to-be-inserted key into the bucket of the count-min summary structure to obtain an initial count-min summary;performing a decoding operation to search for and repair the bucket in the initial count-min summary shared by the plurality of the to-be-inserted keys to obtain a target count-min digest; and performing a query operation to obtain the corresponding value of a to-be-queried key in the target count-min summary. The embodiment of the invention also proposes a count-min summary device based on the erasure code. Embodiments of the present invention can eliminate or reduce query errors.

Description

technical field [0001] The invention relates to the technical field of network communication, in particular to an erasure code-based count-min digest method and device. Background technique [0002] The count-min digest is a compact data structure commonly used in fields such as data management and computer networking. It is used to record the elements of a collection of key-value (key-value) pairs, with constant time maintenance and query overhead. Count-min summarization has been widely used due to the extensive abstract representation capability of collections of key-value pairs. For example, count-min summaries are used to record the size of network flows in routers and switches of software-defined networks; in data flow management systems, count-min summaries are used to record the occurrence frequency of data flows. [0003] A common count-min summary consists of a set of bit arrays, each bit array contains the same number of "buckets" ("bucket" is a logical concept,...

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/2455
Inventor 符永铨李东升徐小平黄春沈思淇梅松竹王庆林邓晓歌
Owner NAT UNIV OF DEFENSE TECH
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