CN112199378A - IP address matching method and device - Google Patents
IP address matching method and device Download PDFInfo
- Publication number
- CN112199378A CN112199378A CN202011376802.4A CN202011376802A CN112199378A CN 112199378 A CN112199378 A CN 112199378A CN 202011376802 A CN202011376802 A CN 202011376802A CN 112199378 A CN112199378 A CN 112199378A
- Authority
- CN
- China
- Prior art keywords
- address
- type
- bloomfilter
- class
- addresses
- 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/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/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2101/00—Indexing scheme associated with group H04L61/00
- H04L2101/60—Types of network addresses
- H04L2101/668—Internet protocol [IP] address subnets
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (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 discloses an IP address matching method and device, wherein the method comprises the following steps: filling mass IP addresses into a pre-established bloom filter BloomFilter corresponding to the IP type in a classified manner; and judging the IP type of the IP to be matched, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type. The invention improves the matching efficiency, thereby reducing the memory space occupation.
Description
Technical Field
The invention relates to the technical field of computer networks, in particular to an IP address matching method and device.
Background
In the prior art, the classification of IP addresses includes the following three types: class a IP address: the first octet indicates the network and the last three octets indicate the hosts on the network; class B IP address: the first two octets indicate the network and the last two octets indicate the host on the network. Class C IP address: the first three octets indicate the network and the last octet indicates the host on the network.
Currently, BloomFilter uses bit vectors to represent elements without storing itself, which greatly compresses the storage space of the elements. The idea of BloomFilter insertion is that an inserted element is calculated for k times by using k Hash functions, and the index of a bit array corresponding to the obtained Hash value is set to be 1; the idea of BloomFilter search is to use k functions to calculate searched elements for k times, find out the corresponding index of the bit array from the obtained value, judge whether the index is 1, if both the index are 1, the value is probably in the sequence, otherwise, the value is definitely not in the sequence.
In the prior art, a scheme for judging whether one IP exists from a hundred million-order IP set is as follows: creating a database table for storing IP fields, querying the database one by one, or using an index search scheme, however, the two processing methods occupy a large storage space and have low query performance. Therefore, there is an urgent need to solve the above problems.
Disclosure of Invention
The present invention provides an IP address matching method and apparatus, which are intended to solve the above problems in the prior art.
The invention provides an IP address matching method, which comprises the following steps:
filling mass IP addresses into a pre-established bloom filter BloomFilter corresponding to the IP type in a classified manner;
and judging the IP type of the IP to be matched, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type.
The invention provides an IP address matching device, comprising:
the filling module is used for filling the mass IP addresses into a bloom filter BloomFilter of a corresponding IP type which is established in advance in a classified manner;
and the matching module is used for judging the IP type of the IP to be matched and searching whether the IP to be matched exists in the bloom filter BloomFilter of the corresponding IP type.
An embodiment of the present invention further provides an IP address matching apparatus, including: the IP address matching method comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the computer program realizes the steps of the IP address matching method when being executed by the processor.
The embodiment of the invention also provides a computer readable storage medium, wherein an implementation program for information transmission is stored on the computer readable storage medium, and the program is executed by a processor to implement the steps of the IP address matching method.
By adopting the embodiment of the invention, the performance advantage of binary bit operation is utilized, the hundred million-level IP addresses are stored into the memory space through Hash operation, and quick matching is carried out through a Hash hit mechanism, so that the matching efficiency is improved, and the memory space occupation is reduced.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flow chart of an IP address matching method of an embodiment of the present invention;
FIG. 2 is a schematic diagram of a massive IP address classification fill in an embodiment of the invention;
FIG. 3 is a schematic diagram of IP address matching according to an embodiment of the invention;
fig. 4 is a schematic diagram of an IP address matching apparatus according to a first embodiment of the present invention;
fig. 5 is a schematic diagram of an IP address matching apparatus according to a second embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the following embodiments, and it should be understood that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it is to be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", and the like, indicate orientations and positional relationships based on those shown in the drawings, and are used only for convenience of description and simplicity of description, and do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be considered as limiting the present invention.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, features defined as "first", "second", may explicitly or implicitly include one or more of the described features. In the description of the present invention, "a plurality" means two or more unless specifically defined otherwise. Furthermore, the terms "mounted," "connected," and "connected" are to be construed broadly and may, for example, be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
Method embodiment
According to an embodiment of the present invention, an IP address matching method is provided, and fig. 1 is a flowchart of the IP address matching method according to the embodiment of the present invention, where before executing the flowchart shown in fig. 1, bloom filters of different IP types need to be constructed, and a matching method needs to be constructed, and implemented by using a BloomFilter of guava. The construction function is specifically: BloomFilter < CharSequence > filter = BloomFilter. create (tunnels. stringtunnel (), m, k);
firstly, presetting m as an expected insertion quantity, and k as an error rate; then, estimating the insertion quantity of the class A IP address to be m1, the insertion quantity of the class B IP address to be m2 and the insertion quantity of the class C IP address to be m3 according to the IP type of the IP address; and finally, obtaining the corresponding different numbers of Hash functions according to the insertion amount of different IP addresses, and respectively establishing a BloomFilter of the class A IP address, a BloomFilter of the class B IP address and a BloomFilter of the class C IP address based on the numbers. Wherein the error rate k value is a controllable variable.
As shown in fig. 1, the IP address matching method according to the embodiment of the present invention specifically includes:
step 101, filling massive IP addresses into a pre-established bloom filter BloomFilter corresponding to an IP type in a classified manner; that is, sequentially filling a large amount of IPs into the corresponding BloomFilter, as shown in fig. 2, specifically includes the following steps:
acquiring subnet masks corresponding to all IP addresses in the mass IP addresses;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and adding the Hash functions into the BloomFilter corresponding to the IP type, wherein the IP type specifically comprises the following steps: class A IP addresses, class B IP addresses, and class C IP addresses.
And 102, judging the IP type of the IP to be matched, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type. That is, whether the current IP exists is matched from a huge number of IPs.
As shown in fig. 3, the method specifically includes the following steps:
acquiring a subnet mask corresponding to the IP address to be matched;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type through a Hash hit mechanism.
The hit matching is completed by the above processing.
Apparatus embodiment one
According to an embodiment of the present invention, an IP address matching apparatus is provided, fig. 4 is a schematic diagram of an IP address matching apparatus according to a first embodiment of the present invention, and as shown in fig. 4, the IP address matching apparatus according to the embodiment of the present invention specifically includes:
the filling module 40 is used for filling the mass IP addresses into the bloom filter BloomFilter of the corresponding IP type which is established in advance in a classified manner; the filling module 40 is specifically configured to: acquiring subnet masks corresponding to all IP addresses in the mass IP addresses; judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and adding the Hash functions into the BloomFilter corresponding to the IP type, wherein the IP type specifically comprises the following steps: a class A IP address, a class B IP address, and a class C IP address;
and the matching module 42 is used for judging the IP type of the IP to be matched and searching whether the IP to be matched exists in the bloom filter BloomFilter of the corresponding IP type. The matching module 42 is specifically configured to: acquiring a subnet mask corresponding to the IP address to be matched; judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type through a Hash hit mechanism.
The apparatus of the embodiment of the present invention further comprises:
the building module is used for building bloom filters of different IP types; the method is specifically used for:
presetting m as expected insertion quantity and k as error rate;
estimating the insertion quantity of the A-type IP address to be m1, the insertion quantity of the B-type IP address to be m2 and the insertion quantity of the C-type IP address to be m3 according to the IP type of the IP address;
and obtaining corresponding different numbers of Hash functions according to the insertion amount of different IP addresses, and respectively establishing a BloomFilter of the A-class IP address, a BloomFilter of the B-class IP address and a BloomFilter of the C-class IP address based on the numbers.
The embodiment of the present invention is an apparatus embodiment corresponding to the above method embodiment, and specific operations of each module may be understood with reference to the description of the method embodiment, which is not described herein again.
Device embodiment II
An embodiment of the present invention provides an IP address matching apparatus, as shown in fig. 5, including: a memory 50, a processor 52 and a computer program stored on the memory 50 and executable on the processor 25, which computer program, when executed by the processor 52, carries out the following method steps:
firstly, bloom filters of different IP types need to be constructed, a matching method needs to be constructed, and the bloom filters of guava are used for realizing the method. The construction function is specifically: BloomFilter < CharSequence > filter = BloomFilter. create (tunnels. stringtunnel (), m, k);
firstly, presetting m as an expected insertion quantity, and k as an error rate; then, estimating the insertion quantity of the class A IP address to be m1, the insertion quantity of the class B IP address to be m2 and the insertion quantity of the class C IP address to be m3 according to the IP type of the IP address; and finally, obtaining the corresponding different numbers of Hash functions according to the insertion amount of different IP addresses, and respectively establishing a BloomFilter of the class A IP address, a BloomFilter of the class B IP address and a BloomFilter of the class C IP address based on the numbers. Wherein the error rate k value is a controllable variable.
As shown in fig. 1, the IP address matching method according to the embodiment of the present invention specifically includes:
step 101, filling massive IP addresses into a pre-established bloom filter BloomFilter corresponding to an IP type in a classified manner; that is, sequentially filling a large amount of IPs into the corresponding BloomFilter, as shown in fig. 2, specifically includes the following steps:
acquiring subnet masks corresponding to all IP addresses in the mass IP addresses;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and adding the Hash functions into the BloomFilter corresponding to the IP type, wherein the IP type specifically comprises the following steps: class A IP addresses, class B IP addresses, and class C IP addresses.
And 102, judging the IP type of the IP to be matched, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type. That is, whether the current IP exists is matched from a huge number of IPs.
As shown in fig. 3, the method specifically includes the following steps:
acquiring a subnet mask corresponding to the IP address to be matched;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type through a Hash hit mechanism.
The hit matching is completed by the above processing.
Device embodiment III
The embodiment of the present invention provides a computer-readable storage medium, on which an implementation program for information transmission is stored, and when being executed by the processor 52, the implementation program implements the following method steps:
firstly, bloom filters of different IP types need to be constructed, a matching method needs to be constructed, and the bloom filters of guava are used for realizing the method. The construction function is specifically: BloomFilter < CharSequence > filter = BloomFilter. create (tunnels. stringtunnel (), m, k);
firstly, presetting m as an expected insertion quantity, and k as an error rate; then, estimating the insertion quantity of the class A IP address to be m1, the insertion quantity of the class B IP address to be m2 and the insertion quantity of the class C IP address to be m3 according to the IP type of the IP address; and finally, obtaining the corresponding different numbers of Hash functions according to the insertion amount of different IP addresses, and respectively establishing a BloomFilter of the class A IP address, a BloomFilter of the class B IP address and a BloomFilter of the class C IP address based on the numbers. Wherein the error rate k value is a controllable variable.
As shown in fig. 1, the IP address matching method according to the embodiment of the present invention specifically includes:
step 101, filling massive IP addresses into a pre-established bloom filter BloomFilter corresponding to an IP type in a classified manner; that is, sequentially filling a large amount of IPs into the corresponding BloomFilter, as shown in fig. 2, specifically includes the following steps:
acquiring subnet masks corresponding to all IP addresses in the mass IP addresses;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and adding the Hash functions into the BloomFilter corresponding to the IP type, wherein the IP type specifically comprises the following steps: class A IP addresses, class B IP addresses, and class C IP addresses.
And 102, judging the IP type of the IP to be matched, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type. That is, whether the current IP exists is matched from a huge number of IPs.
As shown in fig. 3, the method specifically includes the following steps:
acquiring a subnet mask corresponding to the IP address to be matched;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type through a Hash hit mechanism.
The hit matching is completed by the above processing.
By adopting the embodiment of the invention, the performance advantage of binary bit operation is utilized, the hundred million-level IP addresses are stored into the memory space through Hash operation, and quick matching is carried out through a Hash hit mechanism, so that the matching efficiency is improved, and the memory space occupation is reduced.
The computer-readable storage medium of this embodiment includes, but is not limited to: ROM, RAM, magnetic or optical disks, and the like.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (7)
1. An IP address matching method, comprising:
constructing bloom filters of different IP types, specifically comprising: presetting m as expected insertion quantity and k as error rate; estimating the insertion quantity of the A-type IP address to be m1, the insertion quantity of the B-type IP address to be m2 and the insertion quantity of the C-type IP address to be m3 according to the IP type of the IP address; obtaining corresponding different numbers of Hash functions according to the insertion amount of different IP addresses, and respectively establishing a BloomFilter of an A-class IP address, a BloomFilter of a B-class IP address and a BloomFilter of a C-class IP address based on the numbers;
filling mass IP addresses into a pre-established bloom filter BloomFilter corresponding to the IP type in a classified manner;
and judging the IP type of the IP to be matched, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type.
2. The method according to claim 1, wherein the step of filling the mass IP addresses into the pre-established bloom filter BloomFilter of the corresponding IP type in a classified manner specifically comprises:
acquiring subnet masks corresponding to all IP addresses in the mass IP addresses;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and adding the Hash functions into the BloomFilter corresponding to the IP type, wherein the IP type specifically comprises the following steps: class A IP addresses, class B IP addresses, and class C IP addresses.
3. The method according to claim 1, wherein the step of judging the IP type of the IP to be matched and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type specifically comprises the steps of:
acquiring a subnet mask corresponding to the IP address to be matched;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type through a Hash hit mechanism.
4. An IP address matching apparatus, comprising:
the building module is used for building bloom filters of different IP types; the building module is specifically configured to: presetting m as expected insertion quantity and k as error rate; estimating the insertion quantity of the A-type IP address to be m1, the insertion quantity of the B-type IP address to be m2 and the insertion quantity of the C-type IP address to be m3 according to the IP type of the IP address; obtaining corresponding different numbers of Hash functions according to the insertion amount of different IP addresses, and respectively establishing a BloomFilter of an A-class IP address, a BloomFilter of a B-class IP address and a BloomFilter of a C-class IP address based on the numbers;
the filling module is used for filling the mass IP addresses into a bloom filter BloomFilter of a corresponding IP type which is established in advance in a classified manner;
and the matching module is used for judging the IP type of the IP to be matched and searching whether the IP to be matched exists in the bloom filter BloomFilter of the corresponding IP type.
5. The apparatus of claim 4,
the filling module is specifically configured to:
acquiring subnet masks corresponding to all IP addresses in the mass IP addresses;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and adding the Hash functions into the BloomFilter corresponding to the IP type, wherein the IP type specifically comprises the following steps: a class A IP address, a class B IP address, and a class C IP address;
the matching module is specifically configured to:
acquiring a subnet mask corresponding to the IP address to be matched;
judging the IP type of the corresponding IP address according to the subnet mask, calculating the insertion amount of the IP address of the IP type, calculating the number of the corresponding Hash functions according to the insertion amount, and searching whether the IP to be matched exists in a bloom filter BloomFilter of the corresponding IP type through a Hash hit mechanism.
6. An IP address matching apparatus, comprising: memory, processor and computer program stored on the memory and executable on the processor, which computer program, when executed by the processor, carries out the steps of the IP address matching method according to any of claims 1 to 3.
7. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon an implementation program of information transfer, which when executed by a processor implements the steps of the IP address matching method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011376802.4A CN112199378A (en) | 2020-12-01 | 2020-12-01 | IP address matching method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011376802.4A CN112199378A (en) | 2020-12-01 | 2020-12-01 | IP address matching method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112199378A true CN112199378A (en) | 2021-01-08 |
Family
ID=74033702
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011376802.4A Pending CN112199378A (en) | 2020-12-01 | 2020-12-01 | IP address matching method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112199378A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106570025A (en) * | 2015-10-10 | 2017-04-19 | 北京国双科技有限公司 | Data filtering method and device |
| US20180089245A1 (en) * | 2016-09-26 | 2018-03-29 | International Business Machines Corporation | Bloom filter index for device discovery |
| CN108460030A (en) * | 2017-02-17 | 2018-08-28 | 北京大学 | A kind of set element judgment method based on improved Bloom filter |
| CN111930924A (en) * | 2020-07-02 | 2020-11-13 | 上海微亿智造科技有限公司 | Data duplicate checking system and method based on bloom filter |
| CN111930923A (en) * | 2020-07-02 | 2020-11-13 | 上海微亿智造科技有限公司 | Bloom filter system and filtering method |
-
2020
- 2020-12-01 CN CN202011376802.4A patent/CN112199378A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106570025A (en) * | 2015-10-10 | 2017-04-19 | 北京国双科技有限公司 | Data filtering method and device |
| US20180089245A1 (en) * | 2016-09-26 | 2018-03-29 | International Business Machines Corporation | Bloom filter index for device discovery |
| CN108460030A (en) * | 2017-02-17 | 2018-08-28 | 北京大学 | A kind of set element judgment method based on improved Bloom filter |
| CN111930924A (en) * | 2020-07-02 | 2020-11-13 | 上海微亿智造科技有限公司 | Data duplicate checking system and method based on bloom filter |
| CN111930923A (en) * | 2020-07-02 | 2020-11-13 | 上海微亿智造科技有限公司 | Bloom filter system and filtering method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10331642B2 (en) | Data storage method and apparatus | |
| CN108599900B (en) | Method, apparatus and equipment for Polarization Coding | |
| US9104676B2 (en) | Hash algorithm-based data storage method and system | |
| EP3648410A1 (en) | Flow measurement method, device and system | |
| US20150193491A1 (en) | Data indexing method and apparatus | |
| CN108769111A (en) | A kind of server connection method, computer readable storage medium and terminal device | |
| CN109117275B (en) | Account checking method and device based on data slicing, computer equipment and storage medium | |
| CN108259328B (en) | Message forwarding method and device | |
| CN113315705B (en) | Flexible IP addressing method and device based on single Hash bloom filter | |
| CN111585815B (en) | Port data acquisition method and device | |
| CN111241088A (en) | Data writing method, data query method, device and equipment | |
| CN114513850B (en) | Positioning method, positioning device, computer equipment and medium | |
| CN104424316A (en) | Data storage method, data searching method, related device and system | |
| CN112199378A (en) | IP address matching method and device | |
| CN113966602B (en) | Distributed storage of blocks in a blockchain | |
| CN113986931B (en) | Report paging method and device, storage medium and computing equipment | |
| WO2019242374A1 (en) | Data structure, data indexing method, apparatus, and device, and storage medium | |
| CN110784561A (en) | IPv6 address segmentation method and similar site or link address set searching method | |
| CN112947858B (en) | RAID5 check value updating method, device and medium | |
| CN109995659B (en) | Network communication method and device | |
| KR102562765B1 (en) | IP Band Information Extraction System And Method Thereof | |
| CN114143083B (en) | Blacklist policy matching method and device, electronic equipment and storage medium | |
| CN117201201B (en) | Syn flood attack storage method based on full-flow storage backtracking system | |
| CN115242733B (en) | Message multicast method, multicast gateway, electronic device and storage medium | |
| CN114186100B (en) | Data storage and query method, device and database system |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20210108 |
|
| WD01 | Invention patent application deemed withdrawn after publication |