WO2018161751A1

WO2018161751A1 - Method and device for storing physical data table

Info

Publication number: WO2018161751A1
Application number: PCT/CN2018/075284
Authority: WO
Inventors: 袁赛; 王小忠
Original assignee: 华为技术有限公司
Priority date: 2017-03-08
Filing date: 2018-02-05
Publication date: 2018-09-13
Also published as: CN108572962A; CN108572962B

Abstract

A method and device for storing a physical data table, related to the technical field of storage, capable of freeing up the physical storage space used to store a physical data table of a device, enhancing the utilization rate of the physical storage space of the device. The method comprises: acquiring a first data entry of a first item in a first logical data table (S101); storing the first data entry of the first item in the first logical data table to a first position in a physical data table (S102); acquiring a first data entry of a first item in a second logical data table (S103); and storing the first data entry of the first item in the second logical data table to a second position different from the first position in the physical data table (S104).

Description

Method and device for storing physical data table

The present application claims priority to Chinese Patent Application No. JP-A No. No. No. No. No. No. No. No. No. No. No. No. No. No. In this application.

Technical field

The present application relates to the field of storage technologies, and in particular, to a method and an apparatus for storing a physical data table.

Background technique

As the network continues to evolve, processors are increasingly demanding physical storage space for data tables when storing data tables (such as hash tables or linear tables).

Taking a hash table as an example, as shown in FIG. 1, the processor can logically divide a hash table with a large physical storage space into a plurality of logical sub-tables (such as A1, A2, and A3 in FIG. 1). A4) Perform storage and allocate physical storage space for each non-empty logical sub-table (for example, A1, A2, and A3 in FIG. 1) for storage. Wherein, the non-empty logical sub-table refers to the presence of at least one data item in the logical sub-table.

However, due to the randomness of the hash table, the distribution of data items in the hash table may be scattered. Even if a logical sub-table, such as A2 or A3 shown in Figure 1, has only one data item, it needs to be the entire logical sub-item. The table allocates physical storage space. This wastes physical storage space.

Summary of the invention

The present application provides a method and apparatus for storing a physical data table, which can save physical storage space of a device storing a physical data table, thereby improving the usage rate of the physical storage space of the device.

To achieve the above objectives, the present application adopts the following technical solutions:

A first aspect provides a method for storing a physical data table, the method comprising: acquiring a first data item of a first entry in a first logical data table, and using a first entry in the first logical data table The first data item is stored to the first location of the physical data table; and the first data item of the first entry in the second logical data table is obtained, and the first entry in the second logical data table is A data item is stored to a second location of the physical data table that is different from the first location.

The method for storing a physical data table provided by the present application may be a data item of an entry in a plurality of logical data tables (for example, the first logical data table and the second logical data table) (for example, in the first logical data table described above) The first data item of the first entry and the first data entry of the first entry in the second logical data table are stored in one physical data table, so that only the entries in the multiple logical data tables may be The data items existing in the data items (that is, the data items stored in the physical data table described above) allocate physical storage space without allocating physical storage space for the entire logical data table, thereby saving physical storage space of the device storing the physical data table, and further Increase the usage of the device's physical storage space.

In a first optional implementation manner of the first aspect, the method for storing a physical data table provided by the present application may further include: acquiring a first data item of a first entry in the third logical data table, and The first data item of the first entry in the third logical data table is stored to the third location of the physical data table. The third location is located in a first entry in the physical data table, and the third location is different from the first location. As such, data items of entries in different logical data tables (eg, the first logical data table and the third logical data table) can be stored to the same entry in the physical data table.

In a second optional implementation manner of the first aspect, the method for storing a physical data table provided by the present application may further include: acquiring a second data item of the first entry in the first logical data table, and The second data item of the first entry in the first logical data table is stored to the fourth location of the physical data table. The fourth location is located in the first entry in the physical data table, and the fourth location is different from the first location and the third location. In this way, different data items of the same entry in the same logical data table can be stored in the same entry in the physical data table, that is, one entry in the physical data table can be used to store the same entry in the same logical data table. Different data items.

With the second optional implementation of the first aspect, all data items of the same entry in each logical data table may be stored in an entry in the physical data table that is the same as the sequence number of the entry. When querying a data item, the data item may be queried according to the mechanism of the existing query data item. For example, the data item may be found in the physical data table according to the entry in the logical data table to which the data item belongs. The table entry in which it is located, and then look up the data item in the table entry. That is to say, the method for storing the physical data table provided by the embodiment of the present invention does not need to modify the existing mechanism for querying the data item in the data table.

As such, the method for storing the physical data table provided by the present application can save the physical storage space of the device storing the physical data table and improve the usage rate of the physical storage space of the device on the basis of the mechanism compatible with the existing query data item.

In a second aspect, an apparatus for storing a physical data table is provided, the apparatus comprising an acquisition unit and a storage unit. The obtaining unit is configured to acquire a first data item of the first entry in the first logical data table, where the storage unit is configured to use the first data item of the first entry in the first logical data table acquired by the obtaining unit Store to the first location of the physical data table. The obtaining unit is further configured to acquire a first data item of the first entry in the second logical data table, where the storage unit is further configured to use the first data item of the first entry in the second logical data table acquired by the obtaining unit Stored to a second location of the physical data table that is different from the first location.

In a first optional implementation manner of the second aspect, the acquiring unit is further configured to acquire a first data item of the first entry in the third logical data table, where the storage unit is further configured to acquire the obtained data by the acquiring unit. The first data item of the first entry in the third logical data table is stored to a third location of the physical data table. The third location is located in a first entry in the physical data table, the third location being different from the first location.

In a second optional implementation manner of the second aspect, the acquiring unit is further configured to acquire a second data item of the first entry in the first logical data table, where the storage unit is further configured to obtain the acquiring unit. The second data item of the first entry in the first logical data table is stored to the fourth location of the physical data table. The fourth location is located in a first entry in the physical data table, the fourth location being different from the first location and the third location.

Optionally, in the first aspect and the second aspect, the first location is located in a first entry in the physical data table, and the second location is located in a second entry in the physical data table. That is, the first location and the second location are located in different entries in the physical data table.

Optionally, in the foregoing first aspect and the second aspect, the first location further includes a first identifier for identifying the first logical data table, and the second location further stores a second logical data table for identifying the second logical data table. The second logo.

Optionally, in the foregoing first aspect and the second aspect, the foregoing first identifier for identifying the first logical data table and the second identifier for identifying the second logical data table are further stored in performing the storage provided by the present application. A device of a method of physical data tables (ie, a device that stores a physical data table). Optionally, the first identifier and the second identifier are stored in a memory, a central processing unit (CPU), or a network processor (NP) of the device.

In the present application, by storing the identifier of the first logical data table and the identifier of the second logical data table, different data items stored in the physical data table can be distinguished (the data items can be the same entry or different entries). The logical data table to which it belongs.

It is to be understood that, in the present application, the third location may further include a third identifier for identifying the third logical data table, where the fourth location may further store a first identifier for identifying the first logical data table. .

In the present application, if an entry in the physical data table is insufficient to store data items of the same number of entries in the plurality of logical data tables, the present application stores each data item in the plurality of logical data tables. A plurality of physical data tables may be set or created, and each of the plurality of logical data tables is sequentially stored in a storage order to a corresponding one of the plurality of physical data tables.

In a third aspect, an apparatus for storing a physical data table is provided, the apparatus comprising a processor and a memory coupled to the processor. The processor is configured to perform the method of storing a physical data table in the foregoing first aspect or any alternative implementation thereof, the memory being used to store the physical data table.

In a fourth aspect, a computer readable storage medium is provided, the computer readable storage medium comprising computer instructions that, when executed on a device storing a physical data table, cause the device to perform the first aspect or any one of the above A method of storing a physical data table in an alternative implementation.

For the second aspect, any optional implementation manner of the second aspect, the technical effects of the third aspect and the fourth aspect, and other contents, refer to the foregoing technology for the first aspect and any of the alternative implementation manners. The description of the effect and other content is not described here.

DRAWINGS

1 is a schematic structural diagram of a data table provided by the prior art;

2 is a schematic structural diagram of a communication system according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of hardware of a router according to an embodiment of the present disclosure;

4 is a first schematic diagram of a method for storing a physical data table according to an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a first logical data table or a physical data table according to an embodiment of the present disclosure;

FIG. 6 is a second schematic diagram of a method for storing a physical data table according to an embodiment of the present invention;

FIG. 7 is a third schematic diagram of a method for storing a physical data table according to an embodiment of the present disclosure;

FIG. 8 is a schematic diagram of a data item in a storage logical data table according to an embodiment of the present invention;

FIG. 9 is a schematic structural diagram 1 of an apparatus for storing a physical data table according to an embodiment of the present disclosure;

FIG. 10 is a schematic structural diagram 2 of an apparatus for storing a physical data table according to an embodiment of the present invention.

detailed description

The term "and/or" in this context is merely an association describing the associated object, indicating that there may be three relationships, for example, A and / or B, which may indicate that A exists separately, and both A and B exist, respectively. B these three situations.

The terms "first", "second", and "third" and the like in the specification and claims of the present application are used to distinguish different objects, and are not intended to describe a particular order of the objects. For example, the first data table, the second data table, the third data table, and the like are used to distinguish different data tables, rather than to describe a specific order of the data tables.

In the description of the embodiments of the present invention, the meaning of "a plurality" means two or more unless otherwise stated. For example, multiple logical data tables refer to two or more logical data tables; multiple local area networks refer to two or more local area networks.

In the embodiment of the present invention, the device for storing the physical data table may be a router, a switch, a workstation, or the like. The router can be a wired router, a wireless router, or a distributed router.

The method for storing a physical data table provided by the embodiment of the present invention can be applied to a router, a switch, or a workstation. It can be specifically applied to each processor in a router, switch or workstation. For example, a CPU in a router, switch, or workstation, a CPU in a main control board or interface board in a router, switch, or workstation, or an NP in a router, switch, or workstation.

FIG. 2 is a schematic structural diagram of a communication system applied to a method for storing a physical data table according to an embodiment of the present invention. In FIG. 2, the communication system includes a core router 10 located in a core network, an edge router located in a plurality of local area networks (FIG. 2 with two edge routers, respectively, an edge router 20 and an edge router 21) and a plurality of The terminal device (FIG. 2 takes four terminal devices, which are the terminal device 30, the terminal device 31, the terminal device 32, and the terminal device 33 as examples). The core router 10 is connected to the edge router 20 and the edge router 21, the edge router 20 is connected to the terminal device 30 and the terminal device 31, and the edge router 21 is connected to the terminal device 32 and the terminal device 33, respectively. Taking the data packet sent by the terminal device 30 to the terminal device 32 as an example, the terminal device 30 sends the data packet to the core router 10 via the edge router 20, and the core router 10 determines which port of the core router 10 is issued according to the data packet. The data message is then forwarded by the core router 10 from the determined port to the terminal device 32 via the edge router 21.

In the process in which the terminal device 30 sends a data message to the terminal device 32, the core router 10, the edge router 20, and the edge router 21 can generate, receive, or transmit entries in the data table, the data table, or the data table. The data items are forwarded to the respective next hop devices according to the entries in the data tables or the data items of the entries in the data table.

In the embodiment of the present invention, the devices shown in FIG. 2 can be connected by wireless. In FIG. 2, in order to visually indicate the connection relationship between the devices, the connection relationship between the devices is indicated by a solid line.

Optionally, the logical data table provided by the embodiment of the present invention may be a hash table, or may be a linear table, or may be any form of logical data table capable of using the method for storing a physical data table provided by the embodiment of the present invention. The embodiment of the invention is not limited.

The device that stores the physical data table is a router, and the logical data table is a hash table. The logical data table may be a media access control (MAC) table, a multicast routing table, or an address resolution protocol (address). Resolution protocol, ARP) table, etc. The device that stores the physical data table is a router, and the logical data table is a linear table. The logical data table can be a multi-protocol label switching (MPLS) table or a virtual local area network (VLAN) table. , sub-interface table or flow table.

In the embodiment of the present invention, the above linear table generally needs to allocate a physical storage space for it in advance. Take the VLAN table stored in the router or switch as an example. The port of the router or switch may not be used in the VLAN. Therefore, the VLAN table stored in the router or switch may not have an entry corresponding to the port. However, the physical storage space occupied by this entry usually needs to be allocated in advance.

The terminal device shown in FIG. 2 may be a mobile phone, a tablet computer, a notebook computer, an ultra-mobile personal computer (UMPC), a netbook, or a personal digital assistant (PDA). The embodiment of the present invention is not limited according to the actual application scenario.

In the embodiment of the present invention, the configurations of the core router 10, the edge router 20, and the edge router 21 shown in FIG. 2 may be the same or different. The following is an example of the structure of the core router 10, the edge router 20, and the edge router 21, and the hardware structure of the router provided by the embodiment of the present invention is introduced in conjunction with FIG. As shown in FIG. 3, the router provided by the embodiment of the present invention may include: a main control board 400, a switch fabric 401 connected to the main control board 400, and at least one interface board (FIG. 3 uses two interface boards, For example, the interface board 402a and the interface board 402b are respectively connected, and the switching network board 401 is connected to each interface board of at least one interface board. The main control board 400 may include a CPU 400a. The interface board 402a may include a CPU 403a, a memory 404a connected to the CPU 403a, an NP 405a, and a physical interface card 406a. The interface board 402b may include a CPU 403b, a memory 404b connected to the CPU 403b, an NP 405b, and a physical interface card 406b.

Among them, the main control board 400 is used for overall control on the router. For example, the main control board 400 can control the interface board 402a (or the interface board 402b) to receive data packets from a device connected to the router, and control the data packets received by the switching network board 401 to the interface board 402a (or the interface board 402b). The switching process is performed, and the control interface board 402b (or the interface board 402a) transmits the data message transmitted via the switching network board 401 to another device connected to the router. It can be understood that the data packet can be sent from the interface board 402a after entering the switching network board 401 from the interface board 402a.

The switching network board 400 is configured to exchange data packets received by the interface board 402a or the interface board 402b.

The interface board 402a or the interface board 402b is configured to receive a data packet sent by a device connected to the router, and send the data packet to the switching network board 401, and send the data packet received from the switching network board 401 to the data packet. Device or another device connected to the router.

The router described above is exemplified by the hardware structure of the router as shown in FIG. The router may also include more or less components, and the function of the router may also include more or less functions, which are determined by actual use, and are not described in detail in the embodiments of the present invention.

The execution body of the method for storing the physical data table provided by the embodiment of the present invention may be the above-mentioned router, switch, workstation, or the like. For example, in the router, the execution entity may also be a CPU in the router, a CPU in the main control board or the interface board of the router, or an NP in the router, such as a CPU in the router shown in FIG. 3. 400a, CPU 403a, NP 405a, CPU 403b, or NP 405b.

When the method for storing a physical data table provided by the embodiment of the present invention is applied to the router shown in FIG. 3, the memory 404a or the memory 404b shown in FIG. 3 can be used to store the physical data table. The memory 404a may also be integrated in the NP 405a, and the memory 404b may also be integrated in the NP 405b. The memory 404a and the memory 404b may be static random access memory (SRAM).

The method for storing a physical data table provided by an embodiment of the present invention is described below by taking an execution host as a router.

As shown in FIG. 4, an embodiment of the present invention provides a method for storing a physical data table, and the method may include S101-S104.

S101. The router acquires a first data item of the first entry in the first logical data table.

In the embodiment of the present invention, in the communication process, since the router can implement the routing function, the router can automatically select and set the transmission path according to the condition of the transmission channel, and then send the communication data in order according to the optimal transmission path. In order to improve the routing efficiency of the router, the router may need to store various data tables in the process of implementing routing. After the router stores the data table, the stored data table can be used directly in the subsequent communication process, such as a hash table or a linear table. Specifically, the router needs to store each data item in the hash table or the linear table.

The first item above may be composed of a plurality of data items in the first logical data table. Illustratively, FIG. 5 is a schematic structural diagram of a first logical data table according to an embodiment of the present invention. In FIG. 5, 00-03 (labeled as entry 1 in FIG. 5), 10-13 (in FIG. 5 Marked as entry 2) and 20-23 (labeled as entry 3 in Figure 5) are respectively an entry in the first logical data table. Take the entry 00-03 in the first logical data table as an example. 00, 01, 02, and 03 in the entry are the four data items of the entry.

In the embodiment of the present invention, the first data item of the first entry in the first logical data table may be generated by a router, or may be received by the router from another device, or may be received and calculated by the router from other devices. Generated. Specifically, it can be determined according to the actual use, and the embodiment of the present invention is not limited.

Optionally, in the embodiment of the present invention, the first data item of the first entry in the first logical data table may include an identifier of the first entry to which the first data item belongs. The identifier may be a key value of the first entry calculated by the router. Taking the first data item of the first entry in the first logical data table as a MAC address as an example, when the router obtains a new MAC address, the router can perform hash calculation on the MAC address to obtain a hash value. And determining, according to the hash value, which entry the MAC address corresponds to or specifically located in the logical data table, and then storing the hash value to the corresponding entry in the first logical data table according to the hash value to A location of an entry in the physical data table, such as S102 described below.

In the embodiment of the present invention, a logical data table can be understood as some data items that are logically stored, and these data items have a certain logical relationship. For example, in a router, the logical data table can be some data items stored in the router's CPU or memory. It can be understood that the above first logical data table can be stored in the CPU or the memory of the router.

S102. The router stores the first data item of the first entry in the first logical data table to the first location of the physical data table.

In the embodiment of the present invention, the physical data table can be understood as a data table physically stored. For example, in a router, the physical data table can be stored in a memory in the interface board of the router (which can be integrated in the NP in the interface board), such as an SRAM with higher performance and smaller capacity.

For example, in the embodiment of the present invention, it is assumed that the first logical data table includes the entry 1, the entry 2, and the entry 3. The physical data table includes the entry 1, the entry 2, and the entry 3. The method for storing the physical data table provided by the example may store each data item of the entry 1 in the first logical data table to each position of the entry 1 in the physical data table, and the entry 2 in the first logical data table The respective data items are stored to respective locations of the entry 2 in the physical data table, and the respective data items of the entry 3 in the first logical data table are stored to respective locations of the entry 3 in the physical data table.

Optionally, in the embodiment of the present invention, the entry 1, the entry 2, and the entry 3 in the first logical data table are sequentially arranged, for example, the entry 1, the entry 2, and the entry in the first logical data table. 3 is the first, second, and third entries in the first logical data table, respectively, and the

entries

1, 2, and 3 in the physical data table are also sequentially arranged, for example, physical data. Table 1, Table 2, and Table 3 in the table are the first, second, and third entries in the physical data table, respectively. In the embodiment of the present invention, the entry 1 in the logical data table and the entry 1 in the physical data table refer to two entries with the same sequence number, and the entry 2 and the physical data table in the logical data table. The entry 2 refers to two entries with the same sequence number. The entry 3 in the logical data table and the entry 3 in the physical data table refer to two entries with the same sequence number.

Optionally, in the foregoing description, the label of the entry (such as "1" in the entry 1 or "2" in the entry 2 or "3" in the entry 3) may be used to indicate the entry in the data table. The serial number in the middle. An entry with the same label in different data tables refers to an entry with the same sequence number in different data tables. For example, the entry in the first logical data table, the entry 1 in the second logical data table, and the entry 1 in the physical data table refer to the arrangement in the first logical data table, the second logical data table, and the physical data table. The same number of entries.

In the embodiment of the present invention, the description of the arrangement number of the entry in the logical data table and the entry in the physical data table also applies to the entries in the two logical data tables. For example, the entry 1 in the first logical data table and the entry 1 in the second logical data table refer to two entries having the same sequence number.

Optionally, the entry 1 in the second logical data table and the entry 1 in the physical data table also refer to two entries with the same sequence number. In the method for storing a physical data table provided by the embodiment of the present invention, the data items of the items with the same sequence number in the plurality of logical data tables may be stored in the physical data table in the physical data table and the same as the arrangement number of the entries. in. For example, each data item of the entry 1 in the first logical data table and each data item of the entry 1 in the second logical data table may be stored to respective locations of the entry 1 in the physical data table.

Optionally, in the embodiment of the present invention, the logical data table (including the first logical data table, the second logical data table and the third logical data table described below) and the physical data table have the same structure, and the logical data table The order of the items in the table and the order of the items in the physical data table are also the same. For example, the first logical data table, the second logical data table described below, the third logical data table and the physical data table described below may each have a structure as shown in FIG. 5.

S103. The router acquires a first data item of the first entry in the second logical data table.

The identifier of the first entry in the first logical data table and the identifier of the first entry in the second logical data table may be the same or different. For example, the identifier of the first entry in the first logical data table is key1, and the identifier of the first entry in the second logical data table may also be key1; or the first entry in the first logical data table The identifier is key1, and the identifier of the first entry in the second logical data table may be key2.

For the description of the first data item in the first entry in the second logical data table and the first data entry in the second logical data table, refer to the first entry in the first logical data table and the first in the foregoing S101. A related description of the first data item of the first entry in a logical data table is not described here.

S104. The router stores the first data item of the first entry in the second logical data table to the second location of the physical data table.

Wherein the second location is different from the first location. That is, the second location in the physical data table and the first location in the physical data table are two different locations in the physical data table.

Optionally, in the embodiment of the present invention, the first location may be located in a first entry in the physical data table, and the second location may be located in a second entry in the physical data table. Illustratively, FIG. 5 is a schematic structural diagram of a physical data table according to an embodiment of the present invention. The first location may be a location indicated by 00 in the physical data table as shown in FIG. 5, and the second location may be The position indicated by 10 in the physical data table shown in FIG.

In the embodiment of the present invention, if a certain item in the physical data table is insufficient to store the data items of the items having the same sequence number in the plurality of logical data tables, the embodiment of the present invention stores the plurality of logical data tables. For each data item, a plurality of physical data tables may be set or created, and each of the plurality of logical data tables is sequentially stored in a corresponding physical data table of the plurality of physical data tables in a storage order.

For example, it is assumed that the entry 1 in the physical data table (for example, the entry 1 shown in FIG. 5) is insufficient to store all the data items of the entry 1 in the first logical data table and the table in the second logical data table. For all data items of item 1, when the router stores each data item in the first logical data table and each data item in the second logical data table, the plurality of physical data tables may be set or created, and the first logical data is Each data item in the table and each data item in the second data table are sequentially stored in a storage order to a corresponding physical data table in the plurality of physical data tables.

Specifically, the embodiment of the present invention may store each data item in the multiple logical data tables by using the following two possible implementation manners.

A possible implementation manner is that, in the embodiment of the present invention, after all the entries in one physical data table store the data item, and the other physical data table is the same as the sequence number of the entry. And storing, in the plurality of logical data tables, the data items that are not stored in the table with the same sequence number as the table item.

For example, the router may store the data item after all the entries 1 in one physical data table, and then store the data that is not stored in the entry 1 of the first logical data table in the entry 1 of the other physical data table. The item and the data item not yet stored in the entry 1 in the second logical data table.

Another possible implementation manner is that, after the data item is stored in an item in a physical data table, the physical data table belongs to the same logical data table and is located in each table. All data items in the item are moved to respective items in another physical data table.

In the embodiment of the present invention, after the data item is stored in the physical data table, the data item in the physical data table is searched for, and the data item is searched in the plurality of physical data tables. In this way, the efficiency of finding data items in the physical data table can be improved.

The embodiment of the present invention may not limit the execution order between S102 and S103. For example, S103 may be executed first after S102, or S102 may be executed after S103, and S102 and S103 may be simultaneously executed.

Optionally, in conjunction with FIG. 4, as shown in FIG. 6, the method for storing a physical data table provided by the embodiment of the present invention may further include the following S105-S106:

S105. The router acquires a first data item of the first entry in the third logical data table.

S106. The router stores the first data item of the first entry in the third logical data table to a third location of the physical data table.

The third location is located in a first entry in the physical data table, and the third location is different from the first location. That is, the third location in the physical data table and the first location in the physical data table are two different locations in the same entry in the physical data table. Illustratively, FIG. 5 is a schematic structural diagram of a physical data table according to an embodiment of the present invention. As shown in FIG. 5, the first location may be a location indicated by 00 in the physical data table as shown in FIG. 5, where The third position may be a position indicated by 01 in the physical data table as shown in FIG.

In the embodiment of the present invention, the execution order between the steps S101, S102, S103, S104, S105, S106 only defines S101 before S102, S103 before S104, S105 before S106, and does not perform the execution sequence between the remaining steps. limited. For example, S105-S106 may be executed first and then S105-S106 may be executed, or S105-S106 may be executed first, then S103-S104 may be executed, and S103-S104 and S105-S106 may be simultaneously executed. Specifically, it may be determined according to the storage order of the first data item of the first entry in the second logical data table and the first data entry of the first entry in the third logical data table, which is not limited by the embodiment of the present invention. For example, S105 may be executed first after S104 is executed, or S104 may be executed after S105 is executed first, and S104 and S105 may be simultaneously executed. The above FIG. 6 is exemplified by S105-S106 being executed after S103-S104 as an example.

Optionally, in conjunction with FIG. 6, as shown in FIG. 7, the method for storing a physical data table provided by the embodiment of the present invention may further include the following S107-S108:

S107. The router acquires a second data item of the first entry in the first logical data table.

S108. The router stores the second data item of the first entry in the first logical data table to a fourth location of the physical data table.

The fourth location is located in the first entry in the physical data table. The fourth position is different from the first position and the third position described above. That is, the fourth location in the physical data table and the third location in the physical data table and the first location in the physical data table are three different locations in the same entry in the physical data table. Illustratively, FIG. 5 is a schematic structural diagram of a physical data table according to an embodiment of the present invention. As shown in FIG. 5, the first location may be a location indicated by 00 in the physical data table as shown in FIG. 5, where The third position may be a position indicated by 01 in the physical data table as shown in FIG. The fourth position may be a position indicated by 02 in the physical data table as shown in FIG.

In the embodiment of the present invention, the execution order between the steps S101, S102, S103, S104, S105, S106, S107 and S108 only defines S101 before S102, S103 before S104, S105 before S106, S107 before S108, The order of execution between the remaining steps is not limited. The embodiment of the present invention may not limit the execution order between S103-S104, S105-S106, and S107-S108. Specifically, the first data item of the first entry in the second logical data table, the first data item of the first entry in the third logical data table, and the first entry in the first logical data table may be The storage order of the second data item is determined, which is not limited in the embodiment of the present invention. The embodiment of the present invention may not limit the execution order between S106 and S107. For example, S107 may be executed first after S106, or S106 may be executed after S107, and S106 and S107 may be simultaneously executed. The above-described FIG. 7 is exemplified by S105-S106 being executed after S103-S104 and S107-S108 being executed after S105-S106.

The method for storing a physical data table provided by the embodiment of the present invention is further described below with reference to FIG. 8 .

It is assumed that each data item in the plurality of logical data tables to be stored is a respective address (for example, may be a MAC address or an Internet Protocol (IP) address, or may be a key value obtained by hashing each address, and the like). As shown in FIG. 8, the table A in FIG. 8 represents a first logical data table provided by an embodiment of the present invention, and the first logical data table includes some addresses. Table B in Figure 8 shows a second logical data table provided by an embodiment of the present invention, and the second logical data table includes other addresses. Table C in Figure 8 shows a third logical data table provided by an embodiment of the present invention, and the third logical data table includes further addresses. Table D in Fig. 8 shows a physical data table provided by an embodiment of the present invention. Exemplarily, as shown in FIG. 8, for Table A, each entry in Table A is represented by an abscissa 0-3 in FIG. 8 (for example, 0 indicates an entry 0 in Table A, and 1 indicates a table in

Table A. Item

1, 2 represents the entry 2 in the table A, 3 represents the entry 3) in the table A, and each of the entries in the table A is represented by each intersection of the abscissa 0-3 and the ordinate 0-3. data item. For Table B, each entry in Table B is represented by the abscissa 0-3 in FIG. 8 (for example, 0 represents the entry 0 in the table B, 1 represents the entry 1 in the table B, and 2 represents the table in the table B. The

item

2, 3 represents the entry 3) in the table B, and the respective data items of the respective entries in the table B are represented by respective intersections of the abscissas 0-3 and the ordinates 0-3. For Table C, each entry in Table C is represented by the abscissa 0-3 in FIG. 8 (for example, 0 indicates the entry 0 in the table C, 1 indicates the entry 1 in the table C, and 2 indicates the table in the table C. The

item

2, 3 represents the entry 3) in the table C, and the respective data items of the respective entries in the table C are represented by respective intersections of the abscissas 0-3 and the ordinates 0-3. For the table D, the individual entries in the table D are represented by the abscissas 0-3 in FIG. 8 (for example, 0 represents the table entry 0 in the table D, 1 represents the table entry 1 in the table D, and 2 represents the table in the table D. The

item

2, 3 represents the entry 3) in the table D, and the respective data items of the respective entries in the table D are represented by respective intersections of the abscissas 0-3 and the ordinates 0-3.

As shown in FIG. 8, it is assumed that the first entry in the first logical data table provided by the embodiment of the present invention is the entry 0 in the table A, and the first data entry in the first entry in the first logical data table is The first data item of the entry 0 in the table A, and the data item is the address 1; the second data item of the first entry in the first logical data table is the second of the entry 0 in the table A a data item, and the data item is address 2; the first entry in the second logical data table is the entry 1 in the table B, and the first data entry in the first entry in the second logical data table is the table B The first data item of the entry 1 in the table, and the data item is the address 3; the first entry in the third logical data table is the entry 0 in the table C, and the first table in the third logical data table The first data item of the entry is the first data entry of entry 0 in table C, and the data entry is address 4. Then, as shown in FIG. 8, when the method for storing the physical data table provided by the embodiment of the present invention is used, the router may first obtain the address 1 of the entry 0 in the table A (ie, the abscissa 0 and the ordinate 0 in the table A). The data item represented by the intersection 00 can be understood as the first data item of the first entry in the first logical data table provided by the embodiment of the present invention, and then the address 1 is stored in the entry 0 of the table D. The first position (for example, the position indicated by the intersection 00 of the abscissa 0 and the ordinate 0 in Table D). The router can continue to obtain the data item represented by the address 3 of the entry 1 in the table B (ie, the intersection of the abscissa 1 and the ordinate 0 in the table B, which can be understood as the second logical data table provided by the embodiment of the present invention. The first data item of the first entry), and then store the address 3 to the second position of the entry 1 in the table D (for example, the position indicated by the intersection 10 of the abscissa 1 and the ordinate 0 in the table D) . The router can continue to obtain the data item 4 of the entry 0 of the table C in the table C (ie, the data item represented by the intersection 00 of the abscissa 0 and the ordinate 0 in the table C, which can be understood as the third logical data table provided by the embodiment of the present invention. The first data item of the first entry), and then store the address 4 to the third position of the entry 0 in the table D (for example, the position indicated by the intersection 01 of the abscissa 0 and the ordinate 1 in the table D) . The router can continue to obtain the address 2 of the entry 0 of the table A in the table A (ie, the data item represented by the intersection 01 of the abscissa 0 and the ordinate 1 in the table A, which can be understood as the first logical data table provided by the embodiment of the present invention. The second data item of the first entry), and then store the address 2 to the fourth position of the entry 0 in the table D (for example, the position indicated by the intersection 02 of the abscissa 0 and the ordinate 2 in the table D) . By analogy, the router can store all the addresses in Table A, Table B, and Table C (that is, all the data items of all the entries in all the logical data tables that can be understood as the embodiments of the present invention) into Table D. .

Optionally, when the method for storing the physical data table provided by the embodiment of the present invention stores the data items in the plurality of logical data tables to be stored, an entry in the physical data table may be stored in different logical data tables. The data item (for example, the entry 0 in the table D shown in FIG. 8 stores the data item in the table A and the data item in the table C), so in order to distinguish which logical data belongs to a certain data item in the physical data table The embodiment of the present invention may also store an identifier of a logical data table to which the data item belongs.

Optionally, in the method for storing a physical data table, the first, second, third, and fourth locations further include a first identifier, a second identifier, a third identifier, and the first identifier, respectively. The first, second, and third identifiers may be used to identify the first logical data table, the second logical data table, and the third logical data table, respectively. For example, in the table D shown in FIG. 8, the intersection 00 of the abscissa 0 and the ordinate 0 in the entry 0 may store "1 address 1" (where the "1" of the 1st bit identifies "address 1" belongs to the table A. ), the intersection 01 of the abscissa 0 and the ordinate 1 in the entry 0 can store "2 address 4" (where the "2" flag of the 1st bit "address 4" belongs to the table C), and the abscissa 0 of the entry 0 And the intersection 02 of the ordinate 2 can store "1 address 2" (where the "1" of the 1st bit identifies "Address 2" belongs to the table A), and the intersection 10 of the abscissa 1 and the ordinate 0 in the entry 1 can be Store "3 address 3" (where the "3" of the 1st bit identifies "Address 3" belongs to Table B). In this way, by storing the identifier of the logical data table to which the corresponding data item belongs in the physical data table for storing the location of each data item in each logical data table, it is possible to distinguish which logic belongs to a certain data item stored in the physical data table. data sheet. Thus, when querying a data item, the efficiency of querying the data item can be improved.

Optionally, in the embodiment of the present invention, the identifier of the logical data table to which each data item of each entry in the physical data table belongs may also be stored in the CPU or NP of the router. In this way, during the execution of the method for storing the physical data table provided by the embodiment of the present invention, the logical data and/or software may record the logical data table to which the certain data item stored in the physical data table belongs. Thus, when a certain data item needs to be applied, the efficiency of querying the data item can be improved.

Optionally, in the embodiment of the present invention, the identifier of the logical data table to which each data item of each entry in the physical data table belongs may be stored in a CPU or an NP of the router (for example, the memory is integrated in the CPU or the NP) Case) can also be stored outside the CPU or NP of the router (for example, when the memory is set outside the CPU or NP).

Optionally, in the embodiment of the present invention, the first identifier may be any identifier that can uniquely identify the first logical data table. The first identifier may be a number, a sequence or a variable, and the like, which is not limited in the embodiment of the present invention. The second identifier may be any identifier that can uniquely identify the second logical data table, and the third identifier may be any identifier that can uniquely identify the third logical data table. For a specific implementation of the second identifier and the third identifier, refer to the related description of the specific implementation of the first identifier, and details are not described herein again.

Optionally, the data item in the plurality of logical data tables to be stored is used as an example, and the data items in the plurality of logical data tables are stored in the physical data table by using the method for storing the physical data table provided by the embodiment of the present invention. Then, in order to not modify the existing mechanism for querying the data item in the physical data table, when the data item in the plurality of logical data tables is stored by using the method for storing the physical data table provided by the embodiment of the present invention, The data items in the same table in the same logical data table are stored in the same table item in the physical data table (for example, the physical data table may be the same as the order number of the item in the logical data table) Table entry). When the data item is queried, the entry of the data item in the physical data table may be found according to the identifier of the entry in the logical data table to which the data item belongs, and then the data item is searched for in the entry. .

The method for storing a physical data table provided by the embodiment of the present invention, because a data item of an entry in a plurality of logical data tables (for example, the first logical data table and the second logical data table) may be used (for example, the first logical data described above) The first data item of the first entry in the table and the first data item of the first entry in the second logical data table are stored in one physical data table, and thus may be only in the plurality of logical data tables The data items existing in the entry (that is, the data items stored in the physical data table described above) allocate physical storage space without allocating physical storage space for the entire logical data table, thereby saving physical storage space of the device storing the physical data table. , thereby increasing the utilization rate of the physical storage space of the device.

The method for storing a physical data table provided by the embodiment of the present invention can save the physical storage space of the device storing the physical data table and improve the usage rate of the physical storage space of the device on the basis of the mechanism compatible with the existing query data item.

The foregoing embodiment mainly introduces the solution provided by the embodiment of the present invention from the perspective of a router that stores the physical data table. It is to be understood that the apparatus for storing physical data tables and the like provided by the embodiments of the present invention include hardware structures and/or software modules corresponding to the execution of the respective functions in order to implement the above functions. Those skilled in the art will readily appreciate that the embodiments of the present invention can be implemented in a combination of hardware or hardware and computer software in combination with the elements and algorithm steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can implement the described functions using different methods for each particular application, but such implementation should not be considered to be beyond the scope of the present application.

The embodiment of the present invention may perform the division of the function modules on the device or the like that stores the physical data table according to the above method. For example, each functional module can be divided for each function. It should be noted that the division of the module in the embodiment of the present invention is schematic, and is only a logical function division, and the actual implementation may have another division manner.

FIG. 9 is a schematic diagram showing a possible structure of an apparatus for storing a physical data table according to an embodiment of the present invention. As shown in FIG. 9, the apparatus may include an acquisition unit 50 and a storage unit 51. The obtaining unit 50 may be configured to support the apparatus to perform S101, S103, S105, and S107 performed by the router in the foregoing method embodiment; the storage unit 51 may be configured to support the apparatus to execute S102, S104, S106 performed by the router in the foregoing method embodiment. S108. All the related content of the steps involved in the foregoing method embodiments may be referred to the functional descriptions of the corresponding functional modules, and details are not described herein again.

FIG. 10 is a schematic diagram showing a possible structure of an apparatus for storing a physical data table according to an embodiment of the present invention. As shown in FIG. 10, the apparatus can include a processor 60 and a memory 61. Optionally, the device may also include a communication interface 62. Optionally, as shown in FIG. 10, the apparatus may further include a memory 63 (which may be a general memory commonly used in the apparatus, such as a synchronous dynamic random access memory (SDRAM), etc.). The processor 60 can be used to control and manage the actions of the device. For example, the processor 60 can be used to support the device to perform S101, S103, S105, and S107 performed by the router in the foregoing method embodiment, and/or used in this document. Other processes of the described technology. The memory 61 can be used to store a physical data table provided by an embodiment of the present invention, and the memory can be an SRAM memory. Communication interface 62 is used to support communication of the device with other network entities, for example, communication interface 62 can be used to support the device to interact with the terminal device. The memory 63 can be used to store program code for execution by the apparatus, for example, the memory 63 can be used to support the apparatus to perform S102, S104, S106, and S108 performed by the routers in the above method embodiments, and/or for the techniques described herein. Other processes.

The processor 60 can be a CPU, a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), or a field programmable gate array (FPGA). Or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the embodiments of the invention. The above processors may also be a combination of computing functions, such as one or more microprocessor combinations, a combination of a DSP and a microprocessor, and the like. Exemplarily, the processor 60 may be the CPU 400a, the CPU 403a, the NP 405a, the CPU 403b, or the NP 405b as shown in FIG. 3 described above or a combination of at least two of these. The memory 61 may be the memory 404a or the memory 404b in the router shown in FIG. 3 described above. The memory 63 may be a normal memory (not shown in FIG. 3) in the above-described router as shown in FIG. Communication interface 62 can be a physical interface card, a transceiver circuit, or a communication interface. Illustratively, the communication interface 62 can be the physical interface card 406a or the physical interface card 406b as described above in FIG.

The processor 60, the memory 61, the communication interface 62, and the memory 63 can be connected by a bus. The bus can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus can be divided into an address bus, a data bus, a control bus, and the like.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using a software program, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, the processes or functions in accordance with embodiments of the present invention are generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be wired from a website site, computer, server or data center (for example, coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (eg infrared, wireless, microwave, etc.) to another website, computer, server or data center. The computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media. The usable medium may be a magnetic medium (for example, a floppy disk, a magnetic disk, a magnetic tape), an optical medium (for example, a digital video disc (DVD)), or a semiconductor medium (such as a solid state drives (SSD)). .

Through the description of the above embodiments, those skilled in the art can clearly understand that for the convenience and brevity of the description, only the division of the above functional modules is illustrated. In practical applications, the above functions can be allocated according to needs. It is completed by different functional modules, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. For the specific working process of the system, the device and the unit described above, reference may be made to the corresponding process in the foregoing method embodiments, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed system, apparatus, and method may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the modules or units is only a logical function division. In actual implementation, there may be another division manner, for example, multiple units or components may be used. Combinations can be integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.

The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, i.e., may be located in one place, or may be distributed over multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

The foregoing is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present application should be covered by the scope of the present application. . Therefore, the scope of protection of the present application should be determined by the scope of the claims.

Claims

A method for storing a physical data table, comprising:

Obtaining a first data item of the first entry in the first logical data table;

And storing, by the first data item of the first entry in the first logical data table, a first location of the physical data table;

Obtaining a first data item of the first entry in the second logical data table;

And storing a first data item of the first entry in the second logical data table to a second location of the physical data table, the second location being different from the first location.
The method of claim 1 wherein

The first location is located in a first entry in the physical data table, and the second location is located in a second entry in the physical data table.
The method according to claim 1 or 2, wherein the method further comprises:

Obtaining a first data item of the first entry in the third logical data table;

And storing a first data item of the first entry in the third logical data table to a third location of the physical data table, where the third location is located in a first entry in the physical data table, where The third position is different from the first position.
The method of claim 3, wherein the method further comprises:

Obtaining a second data item of the first entry in the first logical data table;

And storing a second data item of the first entry in the first logical data table to a fourth location of the physical data table, where the fourth location is located in a first entry in the physical data table, where The fourth position is different from the first position and the third position.
A method according to any one of claims 1 to 4, characterized in that

The first location further stores a first identifier, where the first identifier is used to identify the first logical data table;

The second location further stores a second identifier, where the second identifier is used to identify the second logical data table.
An apparatus for storing a physical data table, comprising: an acquiring unit and a storage unit,

The obtaining unit is configured to acquire a first data item of the first entry in the first logical data table;

The storage unit is configured to store the first data item of the first entry in the first logical data table acquired by the acquiring unit to a first location of the physical data table;

The obtaining unit is further configured to acquire a first data item of the first entry in the second logical data table;

The storage unit is further configured to store the first data item of the first entry in the second logical data table acquired by the acquiring unit to a second location of the physical data table, where the second location Different from the first position.
The device of claim 6 wherein:

The first location is located in a first entry in the physical data table, and the second location is located in a second entry in the physical data table.
Device according to claim 6 or 7, characterized in that

The obtaining unit is further configured to acquire a first data item of the first entry in the third logical data table;

The storage unit is further configured to store, by the acquiring unit, a first data item of the first entry in the third logical data table to a third location of the physical data table, where the third location The first entry in the physical data table, the third location being different from the first location.
The device of claim 8 wherein:

The obtaining unit is further configured to acquire a second data item of the first entry in the first logical data table;

The storage unit is further configured to store, by the acquiring unit, a second data item of the first entry in the first logical data table to a fourth location of the physical data table, where the fourth location a first entry located in the physical data table, the fourth location being different from the first location and the third location.
Device according to any one of claims 6 to 9, characterized in that

The first location further stores a first identifier, where the first identifier is used to identify the first logical data table;

The second location further stores a second identifier, where the second identifier is used to identify the second logical data table.
An apparatus for storing a physical data table, comprising: a processor and a memory coupled to the processor;

The processor is configured to perform the method of storing a physical data table according to any one of claims 1 to 5, the memory being configured to store the physical data table.