A kind of ipv6 data partition and fast search method

Abstract

The invention provides an IPv6 (Internet Protocol Version 6) data partitioning and fast-searching method. partitions with different scales can be divided according to actual application conditions of an IPv6 address, the IPv6 address is stored in different partitions at multiple layers, an thus, no matter which district IP partition data are in, the data can be distributed in each partition in a relatively balanced form; and moreover, on the basis, a method for realizing segmented concurrent search and fast location on the IPv6 address is realized so as to be suitable for spatial storage and search of the IPv6 address. Additionally, according to the method, a discrete threshold is further set for aggregating the scattered partitions. The method provided by the invention has an obvious improvement on the aspect of storage and search of massive partition data in comparison with the prior art, and simultaneously, the method also has good compatibility to the 24-bit IPv4 address.

Description

technical field [0001] The invention relates to partition storage of IPv6 data and a corresponding fast search method, and belongs to the field of information technology. Background technique [0002] Massive data is usually stored using partitioning technology. The partitioning rule is to split a large table into multiple small tables according to certain rules, and store the data in different areas, so that the data logically on one table can be stored according to the rules. In multiple small tables, different physical locations can be stored, thereby realizing massive data storage. When searching for data, you can determine the partition where the data is located according to the partition rules, and directly locate the corresponding table, so that only specific small tables are involved when accessing data, so as to realize direct query using specific partitions. Since only a specific part of the data is involved in the query, the efficiency of data search can be great...

AI Technical Summary

Problems solved by technology

However, this method cannot be applied to the IPv6 address environment, because there are 2 IPv4 addresses 32 (4,294,967,295) IP addresses, if the IP is evenly distributed in 4096 partitions, each partition has a maximum of 2 20 (1,048,576) IP addresses, that is to say, in the case of IP as the partition basis, there are more than one million IPs in each partition, and the time to create a table storing network service information in a certain area is in the IPv4 environment It is less than 1 minute; and for IPv6 addresses, this method cannot be used for partitioning and searching, because IPv6 addresses contain a total of 2 128 (about 3.4*10 38 ) IP addresses, to create a table to store the network service information of a certain place or a certain operator, the required storage space is not feasible under the premise of existing resources, and the storage time is immeasurable. At the same time, for a large number of IPv6 addresses Data lookup will be a time disaster, so applying the IPv4 partition storage and lookup method to the IPv6 address environment is not feasible in terms of time or space

Images