CN116303585A - Flag bit-based data stream counting method, flag bit-based data stream counting equipment and storage medium - Google Patents
Flag bit-based data stream counting method, flag bit-based data stream counting equipment and storage medium Download PDFInfo
- Publication number
- CN116303585A CN116303585A CN202211217920.XA CN202211217920A CN116303585A CN 116303585 A CN116303585 A CN 116303585A CN 202211217920 A CN202211217920 A CN 202211217920A CN 116303585 A CN116303585 A CN 116303585A
- Authority
- CN
- China
- Prior art keywords
- data packet
- counter
- data
- data stream
- packet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24568—Data stream processing; Continuous queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a Flag bit-based data stream counting method, a Flag bit-based data stream counting device and a storage medium, wherein the Flag bit-based data stream counting method comprises the following steps: setting a parameter initial value; when a data packet arrives, providing key value pair information, and acquiring the position of a calculator mapped by the data packet; when the first data packet arrives, calling a counter value mapped to an insertion function update data packet of the CUS structure to be 1; comparing the counter position of each data packet with the previous data packet from the second data packet, and judging whether the data packet and the previous data packet mapped to the same counter belong to the same data stream or not; and carrying out data stream query, and selecting the minimum value as a query result. The Flag bit is utilized to detect whether the data packets mapped to the same counter belong to the same data stream, and different counting schemes are adopted to improve the accuracy of calculating the number of the data packets in the data stream and improve the measurement accuracy of the data stream; and the Flag bit is of a Bool type, and the memory occupied in the actual environment is negligible.
Description
Technical Field
The present invention relates to the field of network management technologies, and in particular, to a Flag bit-based data stream counting method, apparatus, and storage medium.
Background
In a high-speed network, huge pressure is brought to network measurement work by massive data flow, and a network flow measurement scheme based on the data flow is taken as an important means for next generation network measurement and has been widely applied to the fields of network charging, flow engineering, flow databases, network security and the like. The network flow measurement method based on the data flow only generates summary information occupying a small amount of storage space, can meet the conventional operation requirement of data processing, and particularly has the advantages of powerful function, high flexibility, high updating speed and low complexity of the data flow technology of the sketch. The Sketch is a compact data structure, is also a data structure based on Hash, can detect large flows, abnormal flows and the like in a high-speed network, and has the characteristics of balanced memory and estimation precision.
The data flow method based on the Sketch mainly comprises Count-Min Sketch (CMS), count Sketch (CS), conservative Update Sketch (CUS), augmented Sketch (AS) and the like, and the algorithm does not store the element per se, but stores the Count of the element. CMS is a typical and most widely used structure of a sketch, where a Hash function is used to Hash key value pairs of a data packet, and then a mapping is stored in a counter, and each counter bucket mapped to the Hash key pair needs to be updated, and a CUS only needs to update the smallest counter bucket. CS is similar to CMS except that each array in CS is associated with two Hash functions. The AS adds an additional filter to the sketch to dynamically capture frequent items. Although the above-mentioned several slots provide a role in the frequency counting of network traffic measurement, they have the problems of a large number of memory accesses, high consumption of hash calculation resources, low accuracy, large error, and the like.
Because hash conflicts exist in the hash table, the query result of the CMS may only be greater than or equal to the true value, and only the frequency of the elements may be overestimated, especially for elements with fewer occurrences, the accuracy may be lower. The CUS improves the accuracy of data flow counting on the CMS basis by adopting a conservative updating method, but cannot perform a delete operation, because after an element is inserted for a period of time, the smallest one in the smallest bucket that the element previously maps to is not necessarily itself, and other elements may share the counting bucket, so that other elements may be affected if the delete operation is performed.
Based on the above, the invention provides a data flow counting method based on Flag bit on the basis of CUS provided for improving the accuracy of CMS aiming at the overestimation problem of CMS, aiming at detecting whether the data packets mapped to the same counter belong to the same data flow or not by setting one Flag bit, and then adopting different counting schemes to improve the counting operation of the counter so as to improve the measurement accuracy.
Disclosure of Invention
This section is intended to outline some aspects of embodiments of the invention and to briefly introduce some preferred embodiments. Some simplifications or omissions may be made in this section as well as in the description summary and in the title of the application, to avoid obscuring the purpose of this section, the description summary and the title of the invention, which should not be used to limit the scope of the invention.
The present invention has been made in view of the above-mentioned problems with the conventional Flag bit-based data stream counting method.
Therefore, the invention aims to provide a data flow counting method based on Flag bits.
In order to solve the technical problems, the invention provides the following technical scheme:
setting a parameter initial value;
when a data packet arrives, firstly providing key value pair information in the data packet, then carrying out Hash calculation according to a Hash function of a CUS algorithm, and obtaining a calculator position mapped to the data packet;
when the first data packet arrives, calling an insertion function of the CUS structure, and updating a counter value mapped by the data packet to be 1;
comparing the counter position of each data packet with the previous data packet from the second data packet, and judging whether the data packet and the previous data packet mapped to the same counter belong to the same data stream or not;
and carrying out data flow inquiry, determining all mapped counter positions, comparing the sizes of counter values, and selecting the minimum value as an inquiry result.
As a preferable scheme of the Flag bit-based data stream counting method of the present invention, the method comprises: the initial values of the set parameters include,
setting the width value and the depth value of a CUS structure to fixed values, initializing all counter values in the CUS structure to 0, and initializing flag bit to flag=1.
As a preferable scheme of the Flag bit-based data stream counting method of the present invention, the method comprises: the CUS structure is a two-dimensional matrix array with width w and depth d and is used for storing the counting information of elements, and each array comprises w counters and d hash functions h j (j＝1，2，...，d)。
As a preferable scheme of the Flag bit-based data stream counting method of the present invention, the method comprises: the hash computation is denoted as h j (key), (j=1, 2, …, d) and obtaining the counter position mapped by the data packet after the hash calculation, and marking as f (x) i ，p i )；
Wherein s is i Representing the flow to which the packet belongs, p i Indicating the counter location to which the packet is mapped.
As a preferable scheme of the Flag bit-based data stream counting method of the present invention, the method comprises: the insertion function of the CUS structure includes,
when the data packet arrives, mapping and counting are carried out according to the key value pair mode, firstly, a hash function in the CUS structure is called, d times of hash calculation are carried out on the key field of the data packet, a corresponding counter is found, then only the minimum value in the mapped counter is subjected to increasing operation, namely, the minimum counter value is updated to be the current value plus the value field value of the data packet.
As a preferable scheme of the Flag bit-based data stream counting method of the present invention, the method comprises: from the second packet that arrives, the counter position of each packet is compared with the previous packet to determine whether the packet belongs to the same data stream as the previous packet mapped to the same counter,
if the positions of the counters mapped by the front data packet and the rear data packet are different, normally counting according to the counting rule of the CUS;
if the counting positions of the front data packet map and the rear data packet map are the same, namely hash collision occurs and the data packets belong to the same data stream, marking the flag as 1;
if the counting positions of the front and back data packet mappings are the same and belong to different identical data streams, marking the flag as 0;
finally, updating in a counter according to the value of the flag;
if flag=1, the packet counter value is incremented by 1;
if flag=0, the packet counter value is incremented by 0.5.
As a preferable scheme of the Flag bit-based data stream counting method of the present invention, the method comprises: making the data stream query includes,
calling a CUS query function, firstly carrying out hash calculation according to key fields of a data packet to find out corresponding hash function mapped counters, then finding out the minimum value in the counters to serve as a frequency estimated value of the data packet, and finally selecting the minimum value to serve as an estimated value.
A Flag bit based data stream counting system, the system comprising:
the data collection module initializes related parameters and facilitates subsequent calculation;
the data judging module is used for detecting whether the data packets mapped to the same counter belong to the same data stream or not by using the flag bit, and then adopting different counting schemes to improve the counting operation of the counter;
and the data query module determines a final estimated value and improves the measurement accuracy of the data stream.
A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, is the step of implementing the method of any one of claims 1 to 7.
A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
The invention has the beneficial effects that: the Flag bit is utilized to detect whether the data packets mapped to the same counter belong to the same data stream, then different counting schemes are adopted to improve the counting operation of the counter, so that the accuracy of calculating the number of the data packets in the data stream can be improved, the overestimation of the CMS is reduced, and the measurement accuracy of the data stream is improved; and the Flag bit is of a Bool type, only occupies one byte of memory space, and can ignore extra memory required by the Flag in an actual environment.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art. Wherein:
fig. 1 is a schematic diagram of the overall structure of the Flag-based data stream counting method of the present invention.
Fig. 2 is a flow chart of inserting a data packet in the Flag bit-based data flow counting method of the present invention.
Detailed Description
In order that the above-recited objects, features and advantages of the present invention will become more readily apparent, a more particular description of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, but the present invention may be practiced in other ways other than those described herein, and persons skilled in the art will readily appreciate that the present invention is not limited to the specific embodiments disclosed below.
Further, reference herein to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic can be included in at least one implementation of the invention. The appearances of the phrase "in one embodiment" in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments.
Further, in describing the embodiments of the present invention in detail, the cross-sectional view of the device structure is not partially enlarged to a general scale for convenience of description, and the schematic is only an example, which should not limit the scope of protection of the present invention. In addition, the three-dimensional dimensions of length, width and depth should be included in actual fabrication.
Example 1
Referring to fig. 1 and 2, a Flag bit-based data stream counting method includes:
as shown in FIG. 1, the method comprises two parts, namely an element item and a CUS; wherein, the element item consists of two modules of item and flag; item is a record element; the flag is a flag bit, and can be used for judging whether the data packet belongs to the same data stream; the CUS is a two-dimensional array with width w and depth d and is used for storing counting information of elements; the principle is that whether the data packets mapped to the same counter belong to the same data stream is detected according to the flag bit, and then classified for counting.
Wherein p is a data packet in fig. 1.
According to the data flow counting method based on the Flag bit, the CUS structure can count the frequency of the corresponding flow of the data packet, and the structure is shown in the right half part of fig. 1.
The data flow counting method of the Flag bit is called CUSF.
Wherein the CUS structure is a two-dimensional array with width w and depth d, each array comprises w counters and d hash functions h j (j＝1，2，...，d)。
When a packet arrives, it is mapped and stored in the form of key-value pair, where the key field may be attribute information in the packet header, such as five-tuple (source IP address, source port, destination IP address, destination port, and transport layer protocol), and the value field may be the number of times a flow occurs or the size of the flow.
When updating the count, the key field of the arrived data packet is hashed d for finding the mapped counter, and then only the smallest (or those) of the mapped counters is incremented, i.e. the smallest counter value is updated to the current value plus the value field value of the data packet.
When inquiring, the key value pairs generated by different data flows are different, hash calculation is carried out according to the key field of the data packet to find out the counters mapped by the hash functions, and then the minimum value in the counters is found out to be used as the frequency estimated value of the data packet.
The method is called, and as shown in fig. 2, the following steps are executed:
s1: parameter initial values are set. It should be noted that:
the width and depth values of the CUS structure are set to fixed values, all counter values in the CUS structure are initialized to 0, and flag bits are initialized to flag=1.
S2: when a data packet arrives, firstly providing the key value pair information in the data packet, then carrying out Hash calculation according to the Hash function of the CUS algorithm, and obtaining the position of the calculator mapped by the data packet. It should be noted that:
when a data packet arrives, key-value pair (value) information is first extracted from the data packet, then Hash calculation is performed according to a Hash function of the CUS algorithm, and a counter position mapped to the data packet is obtained and is recorded as f(s) i ，p i )。
Wherein the hash calculation is denoted as h j (key)，(j＝1，2，…，d)，s i Representing the flow to which the packet belongs, p i Indicating the counter location to which the packet is mapped.
S3: when the first data packet arrives, the insertion function of the CUS structure is called, and the counter value mapped by the updated data packet is 1. It should be noted that:
the insertion function of the CUS structure is that mapping counting is carried out according to the key value pair mode when a data packet arrives, the hash function in the CUS structure is firstly called, d times of hash calculation is carried out on the key field of the data packet, a corresponding counter is found, then only the minimum value in the mapped counter is subjected to increasing operation, namely the minimum counter value is updated to be the current value plus the value field value of the data packet.
S4: from the second packet that arrives, the counter position of each packet is compared with the previous packet to determine whether the packet belongs to the same data stream as the previous packet mapped to the same counter. It should be noted that:
if the positions of the counters mapped by the front data packet and the rear data packet are different, normally counting according to the counting rule of the CUS;
if the counting positions of the front data packet map and the rear data packet map are the same, namely hash collision occurs and the data packets belong to the same data stream, marking the flag as 1;
if the counting positions of the front and back data packet mappings are the same and belong to different identical data streams, marking the flag as 0;
finally, updating in a counter according to the value of the flag;
if flag=1, the packet counter value is incremented by 1;
if flag=0, the packet counter value is incremented by 0.5.
S5: and carrying out data flow inquiry, determining all mapped counter positions, comparing the sizes of counter values, and selecting the minimum value as an inquiry result. It should be noted that:
calling a CUS query function, firstly carrying out hash calculation according to key fields of a data packet to find out corresponding hash function mapped counters, then finding out the minimum value in the counters to serve as a frequency estimated value of the data packet, and finally selecting the minimum value to serve as an estimated value.
Example 2
The present embodiment is a fourth embodiment of the present invention, and the embodiment is different from the first embodiment in that a verification test of a data stream counting method based on Flag bits is provided, and technical effects adopted in the method are verified and described.
When the Count-Min Sketch processes the element counting problem of the data stream, the hash table has hash conflict, the CMS only overestimates the frequency of the element, especially for the element with fewer occurrence times, the accuracy rate is lower, conservative Update Sketch proposed for improving the accuracy rate of the CMS is improved by adopting a conservative updating method, but the Count of the data stream is improved by adopting a conservative updating method, but the Count-up operation cannot be performed, because after the element is inserted for a period of time, the smallest element in the smallest barrel mapped by the element is not necessarily the minimum element, and other elements possibly share the counting barrel, so that if the deletion operation is performed, other elements can be influenced, on the basis of the CMS and the CUS, the invention provides a data stream counting method CUSF based on the Flag bit, which adds a Flag bit of Bool type, adopts different counting schemes to improve the counting operation of the counter so as to improve the measurement accuracy.
Experimental comparison of CUSF with CUS: assuming that there are a, b streams to be updated to the counter for a certain period of time, the arrival sequence of the packets is a, b, a, b, b, a, a, b, a, a, the counter is initialized to 0, the flag=1, the width w=10 of the cus, the depth d=2, and at least one of the positions of the a, b streams mapped to the counter is the same.
There are two situations: in the first case, both streams a, b map to the same location in the counter, i.e. h 1 (a)＝h 1 (b)、h 2 (a)＝h 2 (b)，。
In the second case, the positions of the two streams a, b mapped to the counter are the same only one, i.e. h 1 (a)＝h 1 (b)、h 2 (a)≠h 2 (b) Or h 1 (a)≠h 1 (b)、h 2 (a)＝h 2 (b)。
Taking the first case as an example, let h1 (a) =h1 (b) =2, h2 (a) =h2 (b) =5, and the count results of cus and CUSF are shown in tables 1 and 2.
Table 1: counting results of data flows on CUS
Table 2: counting results of data flows on CUSF
The estimated values of the data flow a and the data flow b are inquired in the CUS algorithm, the inquiring result is 10 packets, the number of the data packets of the actual flow a is only 6 packets, the data flow b is only 4 data packets, the inquiring accuracy of the data flow a and the data flow b is respectively 60% and 40%, the inquiring result in the CUSF algorithm is 7 packets, the inquiring accuracy of the data flow a reaches 86%, the accuracy of the data flow b is 57%, and compared with the CUS algorithm, the inquiring accuracy of the CUSF algorithm is improved by about 22%. From this, it can be seen that the accuracy of the CUSF algorithm is higher, and is more suitable for flow measurement in a high-speed network environment.
In summary, the present invention proposes a Flag-based data stream counting method, by setting a Flag bit of a pool type (the set Flag bit is of a pool type and occupies only one byte of memory space, and in practical environment, additional memory required by the Flag can be ignored), the method is used for detecting whether a data packet mapped to the same counter belongs to the same data stream as a previous data packet, if the positions of the counters mapped by the previous and next data packets are the same (i.e. hash collision occurs), and belongs to the same data stream, the Flag is recorded as 1, if the data packets belong to different data streams, the Flag is recorded as 0, and then the number of data packets in the data stream can be calculated more accurately according to the value of the Flag to update in the counter, which reduces overestimation and improves the measurement accuracy of the data stream.
It should be noted that the above embodiments are only for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that the technical solution of the present invention may be modified or substituted without departing from the spirit and scope of the technical solution of the present invention, which is intended to be covered in the scope of the claims of the present invention.
Claims (10)
1. A data flow counting method based on Flag bit is characterized in that: comprising the steps of (a) a step of,
setting a parameter initial value;
when a data packet arrives, firstly providing key value pair information in the data packet, then carrying out Hash calculation according to a Hash function of a CUS algorithm, and obtaining a calculator position mapped to the data packet;
when the first data packet arrives, calling an insertion function of the CUS structure, and updating a counter value mapped by the data packet to be 1;
comparing the counter position of each data packet with the previous data packet from the second data packet, and judging whether the data packet and the previous data packet mapped to the same counter belong to the same data stream or not;
and carrying out data flow inquiry, determining all mapped counter positions, comparing the sizes of counter values, and selecting the minimum value as an inquiry result.
2. The Flag-based data stream counting method according to claim 1, wherein: the initial values of the set parameters include,
setting the width value and the depth value of a CUS structure to fixed values, initializing all counter values in the CUS structure to 0, and initializing flag bit to flag=1.
3. The Flag-based data stream counting method according to claim 2, wherein: the CUS structure is a two-dimensional matrix array with width w and depth d and is used for storing the counting information of elements, and each array comprises w counters and d hash functions h j (j＝1，2，...，d)。
4. The Flag-based data stream counting method according to claim 1, wherein: the hash computation is denoted as h j (key), (j=1, 2, …, d) and obtaining the counter position mapped by the data packet after the hash calculation, and marking as f(s) i ，p i )；
Wherein s is i Representing the flow to which the packet belongs, p i Indicating the counter location to which the packet is mapped.
5. The Flag-based data stream counting method according to claim 1, wherein: the insertion function of the CUS structure includes,
when the data packet arrives, mapping and counting are carried out according to the key value pair mode, firstly, a hash function in the CUS structure is called, d times of hash calculation are carried out on the key field of the data packet, a corresponding counter is found, then only the minimum value in the mapped counter is subjected to increasing operation, namely, the minimum counter value is updated to be the current value plus the value field value of the data packet.
6. The Flag-based data stream counting method according to claim 1, wherein: from the second packet that arrives, the counter position of each packet is compared with the previous packet to determine whether the packet belongs to the same data stream as the previous packet mapped to the same counter,
if the positions of the counters mapped by the front data packet and the rear data packet are different, normally counting according to the counting rule of the CUS;
if the counting positions of the front data packet map and the rear data packet map are the same, namely hash collision occurs and the data packets belong to the same data stream, marking the flag as 1;
if the counting positions of the front and back data packet mappings are the same and belong to different identical data streams, marking the flag as 0;
finally, updating in a counter according to the value of the flag;
if flag=1, the packet counter value is incremented by 1;
if flag=0, the packet counter value is incremented by 0.5.
7. The Flag-based data stream counting method according to claim 6, wherein: making the data stream query includes,
calling a CUS query function, firstly carrying out hash calculation according to key fields of a data packet to find out corresponding hash function mapped counters, then finding out the minimum value in the counters to serve as a frequency estimated value of the data packet, and finally selecting the minimum value to serve as an estimated value.
8. A Flag bit based data stream counting system, the system comprising:
the data collection module initializes related parameters and facilitates subsequent calculation;
the data judging module is used for detecting whether the data packets mapped to the same counter belong to the same data stream or not by using the flag bit, and then adopting different counting schemes to improve the counting operation of the counter;
and the data query module determines a final estimated value and improves the measurement accuracy of the data stream.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, is the step of implementing the method of any one of claims 1 to 7.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211217920.XA CN116303585A (en) | 2022-09-30 | 2022-09-30 | Flag bit-based data stream counting method, flag bit-based data stream counting equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211217920.XA CN116303585A (en) | 2022-09-30 | 2022-09-30 | Flag bit-based data stream counting method, flag bit-based data stream counting equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116303585A true CN116303585A (en) | 2023-06-23 |
Family
ID=86822743
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211217920.XA Pending CN116303585A (en) | 2022-09-30 | 2022-09-30 | Flag bit-based data stream counting method, flag bit-based data stream counting equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116303585A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116881338A (en) * | 2023-09-07 | 2023-10-13 | 北京傲星科技有限公司 | Data mining method and related equipment for data stream based on large model |
-
2022
- 2022-09-30 CN CN202211217920.XA patent/CN116303585A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116881338A (en) * | 2023-09-07 | 2023-10-13 | 北京傲星科技有限公司 | Data mining method and related equipment for data stream based on large model |
| CN116881338B (en) * | 2023-09-07 | 2024-01-26 | 北京傲星科技有限公司 | Data mining method and related equipment for data stream based on large model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104156380B (en) | A kind of distributed memory hash indexing method and system | |
| CN105630955B (en) | A kind of data acquisition system member management method of high-efficiency dynamic | |
| WO2017012491A1 (en) | Similarity comparison method and apparatus for high-dimensional image features | |
| CN101577721A (en) | Method for splitting Broome filter by indexes and inserting, deleting and inquiring methods thereof | |
| US10983976B2 (en) | Optimized full-spectrum cardinality estimation based on unified counting and ordering estimation techniques | |
| CN110858823B (en) | Data packet classification method and device and computer readable storage medium | |
| CN110532307B (en) | Data storage method and query method of stream sliding window | |
| CN108304409B (en) | Carry-based data frequency estimation method of Sketch data structure | |
| Xiao et al. | Using parallel bloom filters for multiattribute representation on network services | |
| Hua et al. | A multi-attribute data structure with parallel bloom filters for network services | |
| JP2769065B2 (en) | Method and apparatus for use in a digital data processing system | |
| Dai et al. | Identifying and estimating persistent items in data streams | |
| CN108460030B (en) | Set element judgment method based on improved bloom filter | |
| CN116303585A (en) | Flag bit-based data stream counting method, flag bit-based data stream counting equipment and storage medium | |
| CN111541617B (en) | Data flow table processing method and device for high-speed large-scale concurrent data flow | |
| US20170300529A1 (en) | Optimized full-spectrum order statistics-based cardinality estimation | |
| CN110750565B (en) | Real-time interval query method based on Internet of things data flow sliding window model | |
| Fan et al. | Onesketch: A generic and accurate sketch for data streams | |
| CN104731889A (en) | Query result size estimation method | |
| Liu et al. | SEAD counter: Self-adaptive counters with different counting ranges | |
| CN107943415A (en) | The method and system of lookup free cluster based on FAT file system | |
| CN108809764B (en) | GPU-based network access over-point connection number estimation method under sliding window | |
| Reviriego et al. | Improving packet flow counting with fingerprint counting | |
| Khan et al. | The impact of check bits on the performance of bloom filter | |
| CN112286966A (en) | Data stream processing method, data stream recovery method, data stream processing device, data stream recovery device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |