CN116360710B - Data storage method applied to server cluster, electronic device and readable medium - Google Patents

Data storage method applied to server cluster, electronic device and readable medium Download PDF

Info

Publication number
CN116360710B
CN116360710B CN202310644399.6A CN202310644399A CN116360710B CN 116360710 B CN116360710 B CN 116360710B CN 202310644399 A CN202310644399 A CN 202310644399A CN 116360710 B CN116360710 B CN 116360710B
Authority
CN
China
Prior art keywords
data
server
path
user account
link
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
CN202310644399.6A
Other languages
Chinese (zh)
Other versions
CN116360710A (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.)
State Grid Siji Location Service Co ltd
State Grid Information and Telecommunication Co Ltd
Beijing Guodiantong Network Technology Co Ltd
Original Assignee
State Grid Information and Telecommunication Co Ltd
Beijing Guodiantong Network Technology Co Ltd
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 State Grid Information and Telecommunication Co Ltd, Beijing Guodiantong Network Technology Co Ltd filed Critical State Grid Information and Telecommunication Co Ltd
Priority to CN202310644399.6A priority Critical patent/CN116360710B/en
Publication of CN116360710A publication Critical patent/CN116360710A/en
Application granted granted Critical
Publication of CN116360710B publication Critical patent/CN116360710B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G06F3/0635—Configuration or reconfiguration of storage systems by changing the path, e.g. traffic rerouting, path reconfiguration
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614—Improving the reliability of storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket

Abstract

Embodiments of the present disclosure disclose a data storage method, an electronic device, and a readable medium applied to a server cluster. One embodiment of the method comprises the following steps: responding to the detection of login information of a user account to login a first server and a second server, and acquiring first data generated by the user account at the first server and second data generated by the user account at the second server; acquiring third data of the first data and the second data, and establishing a link path to enable the first data and the second data to be associated once through the third data; and performing secondary association on the first data and the second data which are subjected to primary association by acquiring a jump path of the user account between the first server and the second server, and controlling the first server and the second server to perform data storage. According to the embodiment, the repeated data are interacted among the servers in a link establishment mode, so that the waste of storage space caused by the repeated data storage of each server is avoided.

Description

Data storage method applied to server cluster, electronic device and readable medium
Technical Field
Embodiments of the present disclosure relate to the field of computer technology, and in particular, to a data storage method, an electronic device, and a readable medium applied to a server cluster.
Background
A server is a high-performance computer, which is used as a node of a network to store and process 80% of data and information on the network, and is therefore also called a soul of the network.
The server is basically similar to the PC in structure and comprises a processor, a hard disk, a memory, a system bus and the like, which are specially formulated for specific network applications, so that the server and a microcomputer have great differences in processing capacity, stability, reliability, safety, expandability, manageability and the like. Particularly, with the progress of information technology, the effect of the network is more and more obvious, and the requirements on the data processing capability, the security and the like of the server are also more and more high. The process by which a user jumps to other network applications through the current network application is typically as follows: in the data interaction process between the servers, in order to improve the use experience of the user, each server often needs to record the browsing track, the jump track, the identity information and the like of the user.
However, the following technical problems generally exist in the above manner:
Firstly, a large amount of repeated data is easy to generate, so that the data storage pressure of a server is caused;
secondly, when the number of times of user jump is excessive, it is difficult to accurately acquire the jump path through tracing the historical data.
The above information disclosed in this background section is only for enhancement of understanding of the background of the inventive concept and, therefore, may contain information that does not form the prior art that is already known to those of ordinary skill in the art in this country.
Disclosure of Invention
The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose a data storage method, an electronic device, and a computer readable medium applied to a server cluster to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a data storage method applied to a server cluster, the method comprising: responding to the detection of login information of a user account to login the first server and the second server, and acquiring first data generated by the user account at the first server and second data generated by the user account at the second server; acquiring third data of the first data and the second data, and establishing a link path so that the first data and the second data are associated once through the third data; and performing secondary association on the first data and the second data which are subjected to primary association by acquiring a jump path between the first server and the second server of the user account, and controlling the first server and the second server to perform data storage, wherein the user account acquires the jump path by selecting the first data or the second data which are subjected to secondary association.
In a second aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors causes the one or more processors to implement the method described in any of the implementations of the first aspect above.
In a third aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method described in any of the implementations of the first aspect above.
The above embodiments of the present disclosure have the following advantageous effects: according to the data storage method applied to the server cluster, which is disclosed by the embodiment of the invention, repeated data are interacted among the servers in a link establishment mode, so that the waste of storage space caused by repeated data storage by each server is avoided. Specifically, the data storage pressure of the server is caused by: a large amount of repetitive data is easily generated, resulting in data storage pressure of the server. Based on this, in some embodiments of the present disclosure, the data storage method applied to the server cluster first obtains, in response to detecting that the user account logs in to the login information of the first server and the second server, first data generated by the user account at the first server and second data generated by the second server. And then, acquiring third data of the first data and the second data, and establishing a link path so that the first data and the second data are associated once through the third data. Thus, the connection relationship can be established between the first data and the same data in the second data. Finally, the jump path between the first server and the second server of the user account is obtained, the first data and the second data which are subjected to primary association are subjected to secondary association, and the first server and the second server are controlled to store data. The user account acquires the jump path by selecting the first data or the second data after secondary association. Therefore, the modification of the data is tracked at the server side by establishing the link path and the jump path, the problem of data tracing is effectively solved, and the data security is ensured through the storage work of different data of a plurality of servers.
Drawings
The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
FIG. 1 is a flow chart of some embodiments of a data storage method applied to a server cluster according to the present disclosure;
fig. 2 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a flow chart of some embodiments of a data storage method applied to a server cluster according to the present disclosure. A flow 100 of some embodiments of a data storage method applied to a server cluster according to the present disclosure is shown. The data storage method applied to the server cluster comprises a first server and a second server for carrying out data interaction with the first server, and the method comprises the following steps:
Step 101, in response to detecting login information of a user account to login a first server and a second server, obtaining first data generated by the user account at the first server and second data generated by the user account at the second server.
In some embodiments, an execution body (e.g., a computing device) of a data storage method applied to a server cluster may obtain first data generated by a user account at a first server and second data generated by a second server in response to detecting login information of the user account to login the first server and the second server. The first server and the second server belong to two different servers. The user account may be an account of a user logging into the server. The first data may be browsing data of the user account on the first server (e.g., browsing data of a certain web page or browsing data of a certain item). The second data may be browsing data of the user account on the second server (e.g., browsing data of a certain web page or browsing data of a certain item).
Step 102, obtaining third data of the first data and the second data, and establishing a link path so that the first data and the second data are associated once through the third data.
In some embodiments, the execution body may acquire third data included in the first data and the second data, and establish a link path so that the first data and the second data are associated once by the third data. Here, the third data may refer to the same data as the first data. The link path may be an association path of the same data (third data) between the first data and the above-described second data. For example, the link path may be an absolute path, a root relative path, or a hyperlink path.
In practice, the executing body may delete the third data in the first server or the second server, and establish a link path at the deletion location, so that the first data and the second data are associated once by the third data.
The third data is reserved in the first server or the second server, so that the storage space for the third data is released, and in addition, it is conceivable that the first server and the second server may be server clusters, and the third data is stored in a server set in a scattered manner, so that the third data with small data size and/or late creation date can be selected for deletion according to the creation date of the third data in different server clusters or the data size correlated with the third data, and the data deletion work needs to be performed with the integrity of the third data as a target in consideration of the integrity of the third data in the data deletion.
And in the process that the user account logs in the first server or the second server, acquiring third data selected by the user account, and switching to a first position of the third data in the first data or a second position of the third data in the second data through a link path. According to the third data and the deleted position of the third data, selectable settings are performed, options are provided for a user, the user can see the condition of the third data of the server through the options, and the condition of the third data in other servers can also be switched back and forth between the server and the other servers through the options.
Step 103, performing secondary association on the first data and the second data which are subjected to primary association by acquiring a jump path between the first server and the second server of the user account, and controlling the first server and the second server to store the data.
In some embodiments, the executing entity may perform secondary association on the first data and the second data that are associated once by acquiring a jump path between the first server and the second server by the user account, and control the first server and the second server to perform data storage. The user account acquires the jump path by selecting the first data or the second data after secondary association. For example, the first server and the second server may be controlled to store the second data and the first data that are secondarily associated. Here, the jump path may be preset. The jump path is a path for switching between servers.
In practice, the execution subject may secondarily associate the first data with the second data, which are primarily associated, by:
in the first step, in response to detecting the login information of the user account to login to the first server or the second server, third data selected by the user account is acquired, and the first position of the third data in the first data or the second position of the third data in the second data is switched to through the link path. The selected third data may refer to third data in the selected first server or second server. The first location may refer to a location of the third data in a web page or database in the first server. The second location may refer to a location of the third data in a web page or database in the second server.
When the link path points to the first server, the link path is switched to the first position of the third data in the first data. When the link path points to the second server, the link path is switched to a second position in the second data of the third data.
And a second step of updating the first data by using the first location or updating the second data by using the second location through the link path in response to detecting the update operation of the user account on the third data. Here, the update operation may refer to modification of the above-described third data. For example, a label is added. Here, the third data on each server may be updated according to the updated third data. For example, the first data includes third data or the second data includes third data.
In the process of updating the third data, the updated third data is used for updating the first data according to the first position or updating the second data according to the second position through the link path. And for the updating behavior of the user on the third data, acquiring other servers with data interaction with the current server at the current server for updating the third data, judging whether the third data exists, if so, updating the third data, recording relevant updating information, and making data backup for later tracing, wherein the updating information is stored in other servers generally so as to avoid the pressure of data storage and calling at the current server, and meanwhile, the storage positions can be stored in a scattered manner or can be sequentially stored according to the data interaction frequency.
And thirdly, updating the link path through the first position and/or the second position according to the updated third data in response to the first server and/or the second server updating the third data. For example, after the third data included in the first data or the third data included in the second data is updated, the link path is updated. That is, the updated link path is guaranteed to be associated with the updated third data.
In the process of updating the third data by the first server and/or the second server, the invention updates the link path according to the updated third data through the first position and/or the second position. The server synchronously updates the link path according to the update of the third data by the user, meanwhile, the server also has an update behavior, and the update of the third data can also exist in the update, at this time, the server updates the link path, and when the user selects the third data, the server provides the latest link path for the user, wherein the update behavior of the server can also be backed up, and data support is provided for data tracing.
And a fourth step of acquiring a first end position for deleting the third data according to the link path and according to a first start position for deleting the third data in response to deleting the third data. For example, the first server or the second server may delete a part of the third data. The third data may be a discontinuous arrangement of a plurality of pieces of data. The first start position may be a position of the first piece of data deleted by the third data. The first end position may be a position of the last piece of data deleted by the third data.
In the process of deleting the third data, acquiring a first end position of deleting the third data according to a first starting position of deleting the third data and a link path; and updating the link path according to the first starting position or the first ending position. And if not, the new link path needs to be established according to the deleted content corresponding to the deleted position, and the un-deleted third data needs to be connected with the new link path, and the un-deleted third data can be acquired by selecting the link corresponding to the deleted third data, wherein if the un-deleted third data has the updating action, the un-deleted third data is provided for a user selecting the link corresponding to the deleted third data by the data updating tracing method before and after updating.
And fifthly, updating the link path according to the first starting position or the first end position. That is, the position information corresponding to the first start position or the first end position in the link path may be added or deleted.
And a sixth step of establishing a jump link according to the first data or the second data selected by the user in response to the user account accessing the first server or the second server through the jump path, and mapping the first data to the second server or the second data to the first server to secondarily associate the first data and the second data. Such as when the user account accesses the first server via the jump path, the first data is selected, i.e. a jump link is established from the first server to the second server. And mapping the first data to the second server. When the user account accesses the second server through the jump path, the second data is selected, namely, a jump link of the second server pointing to the first server is established. And mapping the second data to the first server.
In the process that a user accesses the first server or the second server through the jump path, a jump link is established according to the first data or the second data selected by the user, the first data is mapped to the second server, or the second data is mapped to the first server, and secondary association of the first data and the second data is realized. The user accesses the first server and enters the second server not through the link path but through other paths, and the first server and the second server are provided with the jump path, so that the user can conveniently carry out data preview and data comparison, and when the user carries out data mapping, the user can conveniently carry out data call among different servers by taking the association degree of the data into consideration, carrying out data mapping through semantics or user preview habit or carrying out data mapping through the mapping path appointed by the user.
Optionally, in response to updating the first data or the second data, the jump path is updated according to a third position of the updated first data or the second data.
In some embodiments, the pointing body may update the jump path according to a third location of the updated first data or the second data in response to updating the first data or the second data. Here, the first server may update the first data or the second server may update the second data. That is, the third location of the updated first data or the second data may refer to a new storage location of the updated first data or the second data in the server. That is, the position information related to the jump path may be updated according to the new storage position.
Optionally, in response to deleting the first data or the second data, the jump path is updated according to a second start position of the deletion of the first data or the second data and a second end position of the deletion of the first data or the second data.
In some embodiments, the execution body may update the jump path according to a second start position of the first data or the second data deletion and a second end position of the first data or the second data deletion in response to deleting the first data or the second data. That is, the first server or the second server may delete part of the first data or the second data. Here, taking the first data as an example, the second start position may be a position of the first piece of data deleted by the third data. The second end position may be a position of the last piece of data deleted by the third data.
Optionally, in response to tracing the data by the user account, a first tracing path which can be selected is generated according to the jump path and/or the link path.
In some embodiments, the executing entity may trace the data in response to the user account, and generate a first trace path that may be selected according to the jump path and/or the link path. That is, the operation of tracing the data by the user account may be detected, and the jump path and the link path may be combined into a first tracing path.
Optionally, the first data, the second data and the third data are acquired by selecting the first tracing path.
In some embodiments, the execution body may obtain the first data, the second data, and the third data by selecting the first trace path. That is, the first data, the second data, and the third data may be acquired by accessing the first trace-source path.
Optionally, the third data and the first update data of the third data are obtained in response to the server tracing the update data.
In some embodiments, the executing entity may trace the update data in response to the server to obtain the third data and the first update data of the third data. Here, the server may refer to a first server or a second server. For example, the first server may send request information that traces the update data. The update data may refer to update data of the third data. The first update data may refer to data that is first updated by the third data.
Optionally, the first data and the second data, and second update data of the first data and the second data are acquired.
In some embodiments, the execution body may acquire the first data and the second data, and second update data of the first data and the second data. The second update data may refer to the first data and the data updated by the second data.
Optionally, a second tracing path is constructed according to the jump path and the link path corresponding to the first update data and the second update data.
In some embodiments, the execution body may construct a second trace-source path according to the jump path and the link path corresponding to the first update data and the second update data. Here, the skip path and the link path corresponding to the first update data and the second update data may refer to the skip path and the link path after the update. That is, the updated hop path and link path may be merged into a second trace-source path.
Optionally, the first data, the second data, the third data, and the first update data and the second update data are acquired by selecting a second trace path.
In some embodiments, the execution body may obtain the first data, the second data, the third data, and the first update data and the second update data by selecting a second trace path. That is, the first data, the second data, the third data, and the first update data and the second update data may be acquired by accessing a second trace-source path.
Optionally, in response to tracing the deleted data by the server, the third data and the first deleted data of the third data are obtained.
In some embodiments, the executing entity may trace the deleted data in response to the server to obtain the third data and the first deleted data of the third data. Here, the server may be a first server or a second server. The deleted data may refer to data deleted from the third data.
Optionally, the first data and the second data, and the second deletion data of the first data and the second data are acquired.
In some embodiments, the execution body may acquire the first data and the second data, and second deletion data of the first data and the second data. The second deletion data may refer to data deleted from the first data and the second data.
Optionally, according to the link path corresponding to the first deletion data and the skip path corresponding to the second deletion data, a start position and an end position of the first deletion data and the second deletion data are obtained, and a third tracing path is generated through the link path and the skip path.
In some embodiments, the execution body may acquire a start position and an end position of the first deletion data and the second deletion data according to the link path corresponding to the first deletion data and the skip path corresponding to the second deletion data, and generate a third trace path through the link path and the skip path. Here, the start position may refer to a start position of the deletion data among the first deletion data and the second deletion data. The end position may be an end position of the deleted data out of the first deleted data and the second deleted data.
Optionally, the first data, the second data, the third data, the first deleted data and the second deleted data are acquired by selecting the third trace path.
In some embodiments, the execution body may obtain the first data, the second data, the third data, and the first deletion data and the second deletion data by selecting the third trace path. That is, a third trace-source path may be accessed to obtain the first data, the second data, the third data, and the first deletion data and the second deletion data.
Optionally, in response to tracing the update data by the user account, the first update data or the second update data is selected, and updated first data, second data and third data are obtained.
In some embodiments, the executing body may trace the update data in response to the user account, select the first update data or the second update data, and obtain the updated first data, the updated second data, and the updated third data. That is, the information of tracing the update data sent by the user account may be detected. The update data may refer to the first update data or the second update data described above.
Optionally, in response to tracing the update data by the user account, the updated first data, the updated second data or the updated third data are selected, and the first update data and the updated second update data are obtained.
In some embodiments, the executing body may trace the update data in response to the user account, select the updated first data, the second data, or the third data, and obtain the first update data and the second update data.
Optionally, in response to tracing the deleted data by the user account, selecting the first data, the second data or the third data after being deleted, and obtaining the first deleted data or the second deleted data.
In some embodiments, the executing body may trace the deleted data in response to the user account, select the first data, the second data, or the third data after being deleted, and obtain the first deleted data or the second deleted data.
Optionally, tracing the deleted data in response to the user account, and acquiring the first deleted data and/or the second deleted data, and the first data, the second data and the third data before being deleted according to the link path corresponding to the first deleted data and/or the skip path corresponding to the second deleted data.
In some embodiments, the executing body may trace the deleted data in response to the user account, and obtain the first deleted data and/or the second deleted data, and the first data, the second data, and the third data before being deleted according to the link path corresponding to the first deleted data and/or the skip path corresponding to the second deleted data. The deletion data may refer to the first deletion data or the second deletion data.
Optionally, in response to the fact that the link path corresponding to the first deletion data cannot be obtained when the user account performs tracing on the deletion data, a tracing request is sent to a server where the first deletion data is located, so that the server sends the first deletion data to the user account according to the third tracing path.
In some embodiments, the executing body may respond to the fact that the link path corresponding to the first deletion data cannot be obtained when the user account performs tracing on the deletion data, and send a tracing request to a server where the first deletion data is located, so that the server sends the first deletion data to the user account according to the third tracing path. That is, the user account does not acquire the link path corresponding to the first deletion data. The server where the first deletion data is located may refer to a first server.
Optionally, in response to the fact that the skip path corresponding to the second deletion data cannot be obtained when the user account performs tracing on the deletion data, a tracing request is sent to a server where the second deletion data is located, so that the server sends the second deletion data to the user account according to the third tracing path.
In some embodiments, the executing body may respond to the fact that the skip path corresponding to the second deletion data cannot be obtained when the user account performs tracing on the deletion data, and send a tracing request to a server where the second deletion data is located, so that the server sends the second deletion data to the user account according to the third tracing path. The server on which the second deletion data is located may be a second server.
The above-mentioned related matters serve as an invention point of the present disclosure, and solve the second technical problem that the jump path is difficult to accurately obtain. ". Factors that make it difficult to accurately acquire the jump path are often as follows: when the number of times of user jump is excessive, tracing the historical data. If the above factors are solved, the effect of rapidly and accurately acquiring the jump path can be achieved. To achieve this, first, in response to tracing the data by the user account, a first tracing path that can be selected is generated according to the jump path and/or the link path. And secondly, acquiring the first data, the second data and the third data by selecting the first tracing path. And then, in response to the server tracing the update data, acquiring the third data and the first update data of the third data. And then, acquiring the first data and the second data, and second updated data of the first data and the second data. And then, constructing a second tracing path according to the jump path and the link path corresponding to the first updating data and the second updating data. And then, the first data, the second data, the third data, the first update data and the second update data are acquired by selecting a second tracing path. Finally, tracing the deleted data in response to the server to obtain the third data and the first deleted data of the third data; acquiring the first data and the second data, and second deletion data of the first data and the second data; acquiring a starting position and an ending position of the first deleting data and the second deleting data according to the link path corresponding to the first deleting data and the jump path corresponding to the second deleting data, and generating a third tracing path through the link path and the jump path; and acquiring the first data, the second data, the third data, the first deletion data and the second deletion data by selecting the third tracing path. When tracing data, the trace of the data is mainly traced according to the storage, updating, deleting and the like of the data by establishing corresponding links, and trace of the related data is stored in different servers, tracing can be completed according to the link paths, so that the data can be traced without being concentrated in the same server, the safety of the data is ensured, and the management and the calling of the data are facilitated.
In addition, the server cluster can represent multiple servers formed among single servers, multiple servers formed among server clusters formed by multiple servers, and multiple servers formed among single servers and server clusters.
Referring now to FIG. 2, a schematic diagram of an electronic device (e.g., computing device) 200 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic devices in some embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), car terminals (e.g., car navigation terminals), and the like, as well as stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 2 is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.
As shown in fig. 2, the electronic device 200 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 201, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 202 or a program loaded from a storage means 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data necessary for the operation of the electronic apparatus 200 are also stored. The processing device 201, ROM202, and RAM203 are connected to each other through a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
In general, the following devices may be connected to the I/O interface 205: input devices 206 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 207 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 208 including, for example, magnetic tape, hard disk, etc.; and a communication device 209. The communication means 209 may allow the electronic device 200 to communicate with other devices wirelessly or by wire to exchange data. While fig. 2 shows the electronic device 20 with various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 2 may represent one device or a plurality of devices as needed.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via the communication device 209, or from the storage device 208, or from the ROM 202. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing device 201.
It should be noted that, the computer readable medium described in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: responding to the detection of login information of a user account to login the first server and the second server, and acquiring first data generated by the user account at the first server and second data generated by the user account at the second server; acquiring third data of the first data and the second data, and establishing a link path so that the first data and the second data are associated once through the third data; and performing secondary association on the first data and the second data which are subjected to primary association by acquiring a jump path between the first server and the second server of the user account, and controlling the first server and the second server to perform data storage, wherein the user account acquires the jump path by selecting the first data or the second data which are subjected to secondary association.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.

Claims (5)

1. A data storage method applied to a server cluster, wherein the server cluster comprises a first server and a second server for data interaction with the first server, and the method comprises the following steps:
Responding to the detection of login information of a user account to login the first server and the second server, and acquiring first data generated by the user account at the first server and second data generated by the user account at the second server;
acquiring third data of the first data and the second data, and establishing a link path to enable the first data and the second data to be associated once through the third data, wherein the third data is the same data as the first data and the second data;
the method comprises the steps of performing secondary association on first data and second data which are subjected to primary association through obtaining a jump path of a user account between a first server and a second server, and controlling the first server and the second server to perform data storage, wherein the user account obtains the jump path through selecting the first data or the second data which are subjected to secondary association;
wherein, the establishing a link path includes:
deleting third data in the first server or the second server, and establishing a link path at a deleting position so that the first data and the second data are associated once through the third data;
Wherein, the performing secondary association on the first data and the second data which are subjected to primary association comprises:
responding to the detection of login information of the user account to login the first server or the second server, acquiring third data selected by the user account, and switching to a first position of the third data in the first data or a second position of the third data in the second data through the link path;
in response to detecting the update operation of the user account to the third data, updating the updated third data by using the first position or the second position through the link path;
responding to the first server and/or the second server to update the third data, and updating the link path through the first position and/or the second position according to the updated third data;
responding to the deletion of the third data, and acquiring a first end position for deleting the third data according to the first start position for deleting the third data and the link path;
Updating the link path according to the first starting position or the first end position;
and responding to the user account to access the first server or the second server through the jump path, establishing a jump link according to the first data or the second data selected by a user, mapping the first data to the second server or mapping the second data to the first server, and carrying out secondary association on the first data and the second data.
2. The method of claim 1, wherein the method further comprises:
and in response to updating the first data or the second data, updating the jump path according to a third position of the updated first data or the second data.
3. The method of claim 2, wherein the method further comprises:
and in response to deleting the first data or the second data, updating the jump path according to a second starting position of the first data or the second data and a second ending position of the first data or the second data.
4. An electronic device, comprising:
One or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-3.
5. A computer readable medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the method of any of claims 1-3.
CN202310644399.6A 2023-06-02 2023-06-02 Data storage method applied to server cluster, electronic device and readable medium Active CN116360710B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310644399.6A CN116360710B (en) 2023-06-02 2023-06-02 Data storage method applied to server cluster, electronic device and readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310644399.6A CN116360710B (en) 2023-06-02 2023-06-02 Data storage method applied to server cluster, electronic device and readable medium

Publications (2)

Publication Number Publication Date
CN116360710A CN116360710A (en) 2023-06-30
CN116360710B true CN116360710B (en) 2023-08-04

Family

ID=86910974

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310644399.6A Active CN116360710B (en) 2023-06-02 2023-06-02 Data storage method applied to server cluster, electronic device and readable medium

Country Status (1)

Country Link
CN (1) CN116360710B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104486374A (en) * 2014-11-24 2015-04-01 北京奇虎科技有限公司 Method, device and browser client for processing web page access data
CN107357489A (en) * 2017-06-05 2017-11-17 深圳市金立通信设备有限公司 A kind of synchronous method for browsing information, terminal and server
CN111240896A (en) * 2020-01-06 2020-06-05 深圳市随手科技有限公司 Terminal data synchronization method, device, server and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB202110259D0 (en) * 2021-07-16 2021-09-01 Checkoutsmart Ltd Mobile app system and architecture

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104486374A (en) * 2014-11-24 2015-04-01 北京奇虎科技有限公司 Method, device and browser client for processing web page access data
CN107357489A (en) * 2017-06-05 2017-11-17 深圳市金立通信设备有限公司 A kind of synchronous method for browsing information, terminal and server
CN111240896A (en) * 2020-01-06 2020-06-05 深圳市随手科技有限公司 Terminal data synchronization method, device, server and storage medium

Also Published As

Publication number Publication date
CN116360710A (en) 2023-06-30

Similar Documents

Publication Publication Date Title
CN110609872B (en) Method and apparatus for synchronizing node data
WO2020119485A1 (en) Page display method and device, apparatus, and storage medium
CN111857720B (en) User interface state information generation method and device, electronic equipment and medium
CN111400625B (en) Page processing method and device, electronic equipment and computer readable storage medium
CN110619100A (en) Method and apparatus for acquiring data
CN109697034B (en) Data writing method and device, electronic equipment and storage medium
CN112256372B (en) Information processing method and device and electronic equipment
CN111723309A (en) Method and device for searching web page
CN113239673A (en) Chart switching method and device, storage medium and electronic equipment
CN112905281A (en) View display method and device, electronic equipment and storage medium
CN116360710B (en) Data storage method applied to server cluster, electronic device and readable medium
CN114327453B (en) Page display method, device, equipment and storage medium
CN113886353B (en) Data configuration recommendation method and device for hierarchical storage management software and storage medium
CN115344688A (en) Business data display method and device, electronic equipment and computer readable medium
CN110113416B (en) Method and device for displaying information
CN114428925A (en) Page rendering method and device, electronic equipment and computer readable medium
CN109933380B (en) Online table block loading method and device
CN112311842A (en) Method and device for information interaction
CN111787043A (en) Data request method and device
CN110851192A (en) Method and device for responding to configuration of degraded switch
CN110647331A (en) Development tool acquisition method and device, storage medium and electronic equipment
CN116820354B (en) Data storage method, data storage device and data storage system
CN116467178B (en) Database detection method, apparatus, electronic device and computer readable medium
CN115221178B (en) Data table binding method, device, electronic equipment and computer readable medium
CN110086880B (en) Method and apparatus for creating instances of network requests

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20231121

Address after: 100085 32-3-4108-4109, building 32, Chuangye Middle Road, Haidian District, Beijing

Patentee after: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd.

Patentee after: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd.

Patentee after: State Grid Siji Location Service Co.,Ltd.

Address before: 100085 32-3-4108-4109, building 32, Chuangye Middle Road, Haidian District, Beijing

Patentee before: BEIJING GUODIANTONG NETWORK TECHNOLOGY Co.,Ltd.

Patentee before: STATE GRID INFORMATION & TELECOMMUNICATION GROUP Co.,Ltd.