CN108762675B - Data storage method and system - Google Patents

Data storage method and system Download PDF

Info

Publication number
CN108762675B
CN108762675B CN201810510087.5A CN201810510087A CN108762675B CN 108762675 B CN108762675 B CN 108762675B CN 201810510087 A CN201810510087 A CN 201810510087A CN 108762675 B CN108762675 B CN 108762675B
Authority
CN
China
Prior art keywords
routing information
data
address
local
far
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.)
Active
Application number
CN201810510087.5A
Other languages
Chinese (zh)
Other versions
CN108762675A (en
Inventor
陶赫
高翔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Radio Measurement
Original Assignee
Beijing Institute of Radio Measurement
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Radio Measurement filed Critical Beijing Institute of Radio Measurement
Priority to CN201810510087.5A priority Critical patent/CN108762675B/en
Publication of CN108762675A publication Critical patent/CN108762675A/en
Application granted granted Critical
Publication of CN108762675B publication Critical patent/CN108762675B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a data storage method and a data storage system, and relates to the technical field of communication. The method comprises the following steps: acquiring a plurality of data to be stored; processing each data to obtain the routing information of each data; comparing the size of the routing information of each data according to a preset comparison rule; and storing all data in the corresponding files according to the comparison result. The invention stores all communication data separately according to the routing information, can classify while obtaining the data, has small resource occupation of the system, has the advantages of high storage speed and high efficiency, and the stored data do not influence each other, thereby being convenient for distinguishing, managing and maintaining the data and improving the speed and efficiency of checking and analyzing the data.

Description

Data storage method and system
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a data storage method and system based on routing information.
Background
At present, in a communication system based on ethernet, a computer is generally set up to exchange information between the inside and the outside of the system, and this computer is called a communication computer, and the communication computer records its communication data with the outside system.
The traditional data recording mode is as follows: the communication computer creates a file to record all data, and as a result, all data are in the same file, and if the communication computer has a plurality of communications to the outside, the data of a plurality of communication entities are all together, which causes difficulty in later differentiation and inconvenience in data management and maintenance.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a data storage method, a data storage system, a terminal, and two storage media, aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
a method of data storage, comprising:
acquiring a plurality of data to be stored;
processing each data to obtain the routing information of each data;
comparing the size of the routing information of each data according to a preset comparison rule;
and storing all the data in corresponding files according to the comparison result.
The invention has the beneficial effects that: the data storage method provided by the invention stores all communication data separately according to the routing information, can classify the communication data while acquiring the data, has the advantages of small resource occupation of the system, high storage speed and high efficiency, and the stored data are not mutually influenced, thereby being convenient for distinguishing, managing and maintaining the data and improving the speed and efficiency of checking and analyzing the data.
On the basis of the technical scheme, the invention can be further improved as follows:
further, when new data to be stored is acquired, the data is stored according to the following method:
acquiring new data to be stored;
processing the new data to obtain the routing information of the new data;
comparing the size of the routing information of the new data with the size of the routing information of the stored data according to a preset comparison rule;
and storing the new data in a corresponding file according to the comparison result.
Another technical solution of the present invention for solving the above technical problems is as follows:
a data storage system, comprising:
an acquisition unit configured to acquire a plurality of data to be stored;
the processing unit is used for processing each data to obtain the routing information of each data;
the judging unit is used for comparing the size of the routing information of each data according to a preset comparison rule;
and the control unit is used for storing all the data in the corresponding files according to the comparison result.
Another technical solution of the present invention for solving the above technical problems is as follows:
a terminal, comprising: the processor is used for acquiring a plurality of data to be stored, processing each data to obtain routing information of each data, comparing the routing information of each data according to a preset comparison rule, and storing all the data in the memory according to a comparison result.
Another technical solution of the present invention for solving the above technical problems is as follows:
a storage medium is provided, wherein a plurality of data are stored in the storage medium, each data is stored according to a comparison result, and the comparison result is obtained by comparing the size of routing information of each data according to a preset comparison rule.
Another technical solution of the present invention for solving the above technical problems is as follows:
a storage medium having instructions stored therein, which when read by a computer, cause the computer to execute the data storage method according to any one of the above-mentioned embodiments.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a flow chart illustrating a data storage method according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating a data storage method according to another embodiment of the present invention;
FIG. 3 is a flow chart illustrating a data storage method according to another embodiment of the present invention;
FIG. 4 is a flow chart illustrating a data storage method according to another embodiment of the present invention;
FIG. 5 is a flow chart illustrating a data storage method according to another embodiment of the present invention;
FIG. 6 is a block diagram of a structural framework provided by one embodiment of a data storage system of the present invention;
fig. 7 is a schematic structural diagram provided in an embodiment of a terminal according to the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth to illustrate, but are not to be construed to limit the scope of the invention.
As shown in fig. 1, a schematic flow chart provided for an embodiment of a data storage method according to the present invention may be used to record communication data of a communication computer during communication with external systems, and may store the communication data communicated with multiple external systems separately, so as to overcome a defect that all data are currently recorded in one file in a unified manner. The data storage method comprises the following steps:
s1, acquiring a plurality of data to be stored.
It should be noted that the data to be stored comes from an external system, may come from one external system, or may come from a different external system.
It should be appreciated that to implement the present invention, the data to be stored contains routing information.
S2, processes each data to obtain the routing information of each data.
It should be understood that each data is processed, and may be processed by a conventional data processing method, such as decapsulating the data, so as to obtain the routing information of the data.
The routing information is information such as an IP and a port of data.
And S3, comparing the size of the routing information of each data according to a preset comparison rule.
It should be noted that the preset comparison rule may be set according to actual requirements, and as long as the value information in the routing information is the value information in the routing information, the size of the value information may be compared.
For example, the comparison rule may be to take the size of the local IP address of the routing information as the size of the routing information, and then compare the sizes of the local IP addresses of the respective data; for another example, the comparison rule may also be that the size of the far-end IP address of the routing information is used as the size of the routing information, and then the sizes of the far-end IP addresses of the data are compared; for another example, the comparison rule may be that the size of the local receiving port of the routing information is used as the size of the routing information, and then the sizes of the local receiving ports of the respective data are compared.
It should be noted that, for comparison of the size of the routing information of each data, each data may be compared two by two, or a plurality of reference values may be provided to compare each data with the reference value.
For example, A, B, C data are needed to be stored, and if the remote IP addresses in the routing information of the 3 data are compared, where the remote IP address of a is 200.10.10.300, the remote IP address of B is 200.10.10.500, and the remote IP address of C is 200.10.10.300, then a and B may be compared first to obtain that the routing information of a is smaller than B, then a and C are compared to obtain that the routing information of a is equal to C, then B and C are compared to obtain that the routing information of B is larger than C, and thus, the comparison of all data is completed.
For another example, assuming that the above example is assumed to have a reference value, and assuming that the reference value is 200.10.10.400, which is only 1, the data A, B, C is compared with the reference value, and the data A, C is found to be smaller than the reference value, and the data B is found to be larger than the reference value, so that the comparison of all data is completed.
And S4, storing all data in the corresponding files according to the comparison result.
It should be noted that, according to the comparison result, data with different sizes may be stored in different folders, data with the same size may be stored in the same file, and data with a data size range within a certain preset interval may also be stored in the same file according to the comparison result.
For example, continuing with the example in step S3, according to the comparison result of the first example, the routing information of a is smaller than B, data a may be stored in folder a, data B may be stored in folder B, and the routing information of a is equal to C, data C may also be stored in folder a, and thus, the sorted storage of data is completed.
According to the comparison result of the second example, if the data A, C is smaller than the reference value and the data B is larger than the reference value, that is, if the data A, C is within one data section, the data A, C may be stored in the folder c and the data B is within one data section, the data B may be stored in the folder d.
It should be understood that there are other embodiments for storing data according to the comparison result, and the details are not repeated herein.
It should be further noted that the files are all stored in the routing table, the routing table is a collection of nodes, each node is composed of two elements, namely a key and a value, the routing information is a primary key, and the files are values, so that the nodes can be organized to be stored according to a certain sequence.
The data storage method provided by the embodiment stores all communication data separately according to the routing information, can classify the communication data while acquiring the data, occupies less resources of the system, has the advantages of high storage speed and high efficiency, and the stored data do not influence each other, thereby facilitating the distinguishing, management and maintenance of the data and improving the speed and efficiency of the inspection and analysis of the data.
Optionally, in some embodiments, as shown in fig. 2, in step S4, storing all data in corresponding files according to the comparison result may specifically include:
s4', storing the data with the same size of the routing information in the same file.
For example, assuming that the routing information size of data A, B is the same, the routing information of data a is larger than the routing information of data C, the routing information of data C is larger than the routing information of data D, E, and the routing information size of data D, E is the same, 3 folders may be set, where folder a stores data A, B, folder b stores data C, and folder C stores data D, E.
Optionally, in some embodiments, as shown in fig. 3, in step S4', the storing the data with the same size of the routing information in the same file may specifically include:
and S4', arranging all the data according to the ascending order or descending order of the size of the routing information, and storing the data with the same size of the routing information in the same file.
For example, assuming that the routing information size of data A, B is the same, the routing information for data A is larger than that of data C, the routing information for data C is larger than that of data D, E, the routing information size of data D, E is the same, and the routing information for data F is smaller than that of data C and larger than that of data D, E, assuming that the routing information is arranged from large to small, then the order of storage is A, B > C > F > D, E, 4 folders may be set, where folder a stores data A, B, folder b stores data C, folder C stores data F, and folder d stores data D, E.
Optionally, in some embodiments, the routing information may include: a local IP address, a local receive port, a remote IP address, and a remote transmit port.
Optionally, in some embodiments, the preset comparison rule may be:
if the local IP address of the first routing information is smaller than the local IP address of the second routing information, the first routing information is smaller than the second routing information;
if the local IP address of the first routing information is equal to the local IP address of the second routing information, and the local receiving port of the first routing information is smaller than the local receiving port of the second routing information, the first routing information is smaller than the second routing information;
if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, and the far-end IP address of the first routing information is smaller than the far-end IP address of the second routing information, the first routing information is smaller than the second routing information;
if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, the far-end IP address of the first routing information is equal to the far-end IP address of the second routing information, and the far-end sending port of the first routing information is smaller than the far-end sending port of the second routing information, the first routing information is smaller than the second routing information;
if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, the far-end IP address of the first routing information is equal to the far-end IP address of the second routing information, and the far-end sending port of the first routing information is equal to the far-end sending port of the second routing information, the first routing information is equal to the second routing information;
otherwise, the first routing information is larger than the second routing information.
It should be noted that the first routing information and the second routing information in this embodiment may be from data input by an external system, or may be from a preset reference value.
Optionally, in some embodiments, as shown in fig. 4, when it is necessary to search the stored data, the method may further include:
and S5, acquiring the routing information of the data to be searched.
And S6, searching data with the same size of the routing information as the routing information of the data to be searched according to a binary search method.
It should be noted that, by using the preset comparison rule, the routing information of the data to be searched and the routing information of the stored data may be compared according to a binary search method.
And S7, if the search is successful, returning the searched data.
Optionally, in some embodiments, as shown in fig. 5, when new data to be stored is acquired, the storage may be performed according to the following method:
and S8, acquiring new data to be stored.
And S9, processing the new data to obtain the routing information of the new data.
S10, comparing the size of the routing information of the new data with the size of the routing information of the stored data according to a preset comparison rule.
And S11, storing the new data in the corresponding file according to the comparison result.
It should be noted that when the size of the routing information of the new data is compared with the size of the routing information of the stored data according to the preset comparison rule, two situations may occur: firstly, if the stored data has a file with the same size of the routing information as the routing information of the new data, the new data can be directly stored in the file; and secondly, if the stored data has no file with the same size of the routing information as the routing information of the new data, a new node can be created in the following manner, and the new data is stored in the file of the node.
Assuming that when stored data is stored in ascending order of the size of the routing information, it is possible to start the search from the start node of the routing table and compare with the routing information of each node, and when a node larger than the routing information of new data is found, a new node is created in front of the node and the new data is stored in the new node, and then the routing information of the new data is assigned to the new node.
For example, if the node is a < b < c < d, and the routing information of the new data is R, then comparison shows that R is larger than c and smaller than d, a new node f can be applied, the new data is stored in the file of the node f, the node becomes a < b < c < f < d, and the primary key of the node f is the routing information R of the new data.
It is to be understood that some or all of the steps described in the embodiments above may alternatively be included in some embodiments.
As shown in fig. 6, a structural framework diagram is provided for an embodiment of a data storage system of the present invention, the data storage system including:
an obtaining unit 1 is used for obtaining a plurality of data to be stored.
And the processing unit 2 is used for processing each data to obtain the routing information of each data.
And the judging unit 3 is used for comparing the size of the routing information of each data according to a preset comparison rule.
And the control unit 4 is used for storing all data in corresponding files according to the comparison result.
It should be noted that this embodiment is a product embodiment corresponding to each of the above method embodiments, and for the description and the optional implementation of each structural device in this embodiment, reference may be made to the corresponding description and the optional implementation in each of the above method embodiments, and details are not repeated here.
As shown in fig. 7, a schematic structural diagram provided for an embodiment of a terminal according to the present invention includes: the device comprises a processor 10 and a memory 20, wherein the processor 10 is used for acquiring a plurality of data to be stored, processing each data to obtain routing information of each data, comparing the routing information of each data according to a preset comparison rule, and storing all data in the memory 20 according to the comparison result.
It should be noted that this embodiment is a product embodiment corresponding to each of the above method embodiments, and for the description and the optional implementation of each structural device in this embodiment, reference may be made to the corresponding description and the optional implementation in each of the above method embodiments, and details are not repeated here.
In another embodiment of the present invention, a storage medium is further provided, where the storage medium stores a plurality of data, each data is stored according to a comparison result, and the comparison result is obtained by comparing the size of the routing information of each data according to a preset comparison rule.
In other embodiments of the present invention, there is provided another storage medium having instructions stored therein, which when read by a computer, cause the computer to execute the data storage method according to any one of the above embodiments.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (8)

1. A method of storing data, comprising:
acquiring a plurality of data to be stored;
processing each data to obtain the routing information of each data;
comparing the size of the routing information of each data according to a preset comparison rule;
storing all the data in corresponding files according to the comparison result;
wherein the routing information comprises: the system comprises a local IP address, a local receiving port, a far-end IP address and a far-end sending port;
the preset comparison rule is as follows:
(1) comparing local IP addresses, if the local IP address of the first routing information is smaller than the local IP address of the second routing information, the first routing information is smaller than the second routing information;
(2) if the local IP address of the first routing information is equal to the local IP address of the second routing information, comparing local receiving ports, wherein the local receiving port of the first routing information is smaller than the local receiving port of the second routing information, and the first routing information is smaller than the second routing information;
(3) if the local IP address of the first routing information is equal to the local IP address of the second routing information, and the local receiving port of the first routing information is equal to the local receiving port of the second routing information, comparing the far-end IP addresses, and if the far-end IP address of the first routing information is smaller than the far-end IP address of the second routing information, the first routing information is smaller than the second routing information;
(4) if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, and the far-end IP address of the first routing information is equal to the far-end IP address of the second routing information, comparing far-end sending ports, wherein the far-end sending port of the first routing information is smaller than the far-end sending port of the second routing information, and the first routing information is smaller than the second routing information;
(5) if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, the far-end IP address of the first routing information is equal to the far-end IP address of the second routing information, and the far-end sending port of the first routing information is equal to the far-end sending port of the second routing information, the first routing information is equal to the second routing information;
otherwise, the first routing information is larger than the second routing information.
2. The data storage method according to claim 1, wherein the storing all the data in the corresponding file according to the comparison result specifically includes:
and storing the data with the same routing information size in the same file.
3. The data storage method according to claim 2, wherein the storing the data with the same size of the routing information in the same file specifically comprises:
and arranging all the data according to the ascending order or the descending order of the sizes of the routing information, and storing the data with the same size of the routing information in the same file.
4. The data storage method of claim 1, further comprising:
acquiring routing information of data to be searched;
searching data with the same size of routing information as that of the data to be searched according to a binary search method;
and if the search is successful, returning the searched data.
5. A data storage system, comprising:
an acquisition unit configured to acquire a plurality of data to be stored;
the processing unit is used for processing each data to obtain the routing information of each data;
the judging unit is used for comparing the size of the routing information of each data according to a preset comparison rule;
the control unit is used for storing all the data in corresponding files according to the comparison result;
wherein the routing information comprises: the system comprises a local IP address, a local receiving port, a far-end IP address and a far-end sending port;
the preset comparison rule is as follows:
(1) comparing local IP addresses, if the local IP address of the first routing information is smaller than the local IP address of the second routing information, the first routing information is smaller than the second routing information;
(2) if the local IP address of the first routing information is equal to the local IP address of the second routing information, comparing local receiving ports, wherein the local receiving port of the first routing information is smaller than the local receiving port of the second routing information, and the first routing information is smaller than the second routing information;
(3) if the local IP address of the first routing information is equal to the local IP address of the second routing information, and the local receiving port of the first routing information is equal to the local receiving port of the second routing information, comparing the far-end IP addresses, and if the far-end IP address of the first routing information is smaller than the far-end IP address of the second routing information, the first routing information is smaller than the second routing information;
(4) if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, and the far-end IP address of the first routing information is equal to the far-end IP address of the second routing information, comparing far-end sending ports, wherein the far-end sending port of the first routing information is smaller than the far-end sending port of the second routing information, and the first routing information is smaller than the second routing information;
(5) if the local IP address of the first routing information is equal to the local IP address of the second routing information, the local receiving port of the first routing information is equal to the local receiving port of the second routing information, the far-end IP address of the first routing information is equal to the far-end IP address of the second routing information, and the far-end sending port of the first routing information is equal to the far-end sending port of the second routing information, the first routing information is equal to the second routing information;
otherwise, the first routing information is larger than the second routing information.
6. A terminal, comprising: the processor is used for acquiring a plurality of data to be stored, processing each data to obtain routing information of each data, comparing the routing information of each data according to a preset comparison rule, and storing all the data in the memory according to a comparison result;
wherein the routing information comprises: the system comprises a local IP address, a local receiving port, a far-end IP address and a far-end sending port;
the preset comparison rule is the preset comparison rule in the data storage method of claim 1.
7. A storage medium is characterized in that a plurality of data are stored in the storage medium, each data is stored according to a comparison result, and the comparison result is obtained by comparing the size of routing information of each data according to a preset comparison rule;
wherein the routing information comprises: the system comprises a local IP address, a local receiving port, a far-end IP address and a far-end sending port;
the preset comparison rule is the preset comparison rule in the data storage method of claim 1.
8. A storage medium having stored therein instructions which, when read by a computer, cause the computer to execute a data storage method according to any one of claims 1 to 4.
CN201810510087.5A 2018-05-24 2018-05-24 Data storage method and system Active CN108762675B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810510087.5A CN108762675B (en) 2018-05-24 2018-05-24 Data storage method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810510087.5A CN108762675B (en) 2018-05-24 2018-05-24 Data storage method and system

Publications (2)

Publication Number Publication Date
CN108762675A CN108762675A (en) 2018-11-06
CN108762675B true CN108762675B (en) 2021-04-16

Family

ID=64005910

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810510087.5A Active CN108762675B (en) 2018-05-24 2018-05-24 Data storage method and system

Country Status (1)

Country Link
CN (1) CN108762675B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101504594A (en) * 2009-03-13 2009-08-12 杭州华三通信技术有限公司 Data storage method and apparatus
CN203025686U (en) * 2012-11-30 2013-06-26 中国船舶重工集团公司第七一○研究所 Multi-source data storage device
CN105072196A (en) * 2015-08-27 2015-11-18 携程计算机技术(上海)有限公司 Distributed data package storage, recall method and system
CN106155566A (en) * 2015-03-31 2016-11-23 西门子公司 For storing method, the Apparatus and system of data
CN107070801A (en) * 2017-04-27 2017-08-18 上海斐讯数据通信技术有限公司 It is a kind of to store shifting method in router and data storage based on router

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2652590A1 (en) * 2011-06-30 2013-10-23 Hitachi, Ltd. Computer system and access restriction method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101504594A (en) * 2009-03-13 2009-08-12 杭州华三通信技术有限公司 Data storage method and apparatus
CN203025686U (en) * 2012-11-30 2013-06-26 中国船舶重工集团公司第七一○研究所 Multi-source data storage device
CN106155566A (en) * 2015-03-31 2016-11-23 西门子公司 For storing method, the Apparatus and system of data
CN105072196A (en) * 2015-08-27 2015-11-18 携程计算机技术(上海)有限公司 Distributed data package storage, recall method and system
CN107070801A (en) * 2017-04-27 2017-08-18 上海斐讯数据通信技术有限公司 It is a kind of to store shifting method in router and data storage based on router

Also Published As

Publication number Publication date
CN108762675A (en) 2018-11-06

Similar Documents

Publication Publication Date Title
US8397051B2 (en) Hybrid hash tables
US10977256B2 (en) System for aggregation and prioritization of IT asset field values from real-time event logs and method thereof
CN102932415B (en) Method and device for storing mirror image document
US20120323847A1 (en) Apparatus, and associated method, for synchronizing directory services
US20160092596A1 (en) Database migration method and apparatus
CN108566296B (en) Network device layering method, network management device and computer readable storage medium
CN105701096A (en) Index generation method, data inquiry method, index generation device, data inquiry device and system
EP3657740A1 (en) Message forwarding
CN110888837B (en) Object storage small file merging method and device
CN109240607B (en) File reading method and device
CN111026709B (en) Data processing method and device based on cluster access
CN109726340A (en) The querying method and device of uniform resource locator classification
CN112543122A (en) Automatic discovery and comparison method and device for IPRAN (internet protocol radio Access network) government and enterprise private line business
CN107391769B (en) Index query method and device
CN107423321B (en) Method and device suitable for cloud storage of large-batch small files
CN114138181A (en) Method, device, equipment and readable medium for placing, grouping and selecting owners in binding pool
US11531666B1 (en) Indexing partitions using distributed bloom filters
CN105939402A (en) MAC table entry obtaining method and device
CN108762675B (en) Data storage method and system
CN111541617B (en) Data flow table processing method and device for high-speed large-scale concurrent data flow
CN105718539B (en) A kind of database application method and device
CN107451229B (en) Database query method and device
CN110110081B (en) Hierarchical classification processing method and system for mobile internet mass monitoring data
CN113992364A (en) Network data packet blocking optimization method and system
CN111143469B (en) Data reconciliation method, device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant