CN114817146A - Method and device for processing data - Google Patents
Method and device for processing data Download PDFInfo
- Publication number
- CN114817146A CN114817146A CN202210393316.6A CN202210393316A CN114817146A CN 114817146 A CN114817146 A CN 114817146A CN 202210393316 A CN202210393316 A CN 202210393316A CN 114817146 A CN114817146 A CN 114817146A
- Authority
- CN
- China
- Prior art keywords
- data
- processed
- storage
- index
- linked list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/137—Hash-based
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/14—Details of searching files based on file metadata
- G06F16/148—File search processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
- G06F16/162—Delete operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Abstract
The invention discloses a method and a device for processing data, and relates to the technical field of information security. One embodiment of the method comprises: searching the index position of the data position identification from an index array included in a preset index object based on the data position identification of the data to be processed, reading the storage address of the data to be processed according to the index position, and executing the processing operation on the data to be processed. The local data to be processed is managed through the index object, so that the efficiency of determining the data position and processing the data is improved, and the consumption of computing resources is reduced.
Description
Technical Field
The present invention relates to the field of information security, and in particular, to a method and an apparatus for processing data.
Background
In software development, processing read-write operation of local files is an essential part; the current development tools (such as JAVA development tools) usually adopt a method of character stream or byte stream to perform read-write operation on the local file.
However, the methods using byte streams or character streams locate the files to be processed by using a traversal method, which has the problems of large consumption of computing resources and low efficiency.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for processing data, which are capable of searching an index position of a data position identifier from an index array included in a preset index object based on the data position identifier of the data to be processed, reading a storage address of the data to be processed according to the index position, and performing the processing operation on the data to be processed. Managing local data (e.g., files) to be processed by the index object improves the efficiency of determining the location of the data and processing the data, reducing the consumption of computing resources.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of processing data, including: responding to the processing operation of the data to be processed, and acquiring a data position identifier of the data to be processed; searching a target array element to which the data position identification belongs in an index array included in a preset index object, and searching an index position of the data to be processed under the target array element, wherein the index object manages and stores data in a classified manner through a plurality of array elements of the index array; reading the storage address of the data to be processed from the index position; and acquiring the data to be processed according to the storage address, and executing the processing operation on the data to be processed.
Optionally, in the method for processing data, each array element has an associated index linked list; the index linked list comprises a plurality of linked list nodes, and the linked list nodes store a storage address for storing data.
Optionally, after the acquiring the data location identifier of the data to be processed, the method for processing data further includes: calculating a hash value of the data position identification; the searching the target array element to which the data position identifier belongs in the index array included in the preset index object includes: and determining the matched target array elements of the data to be processed in the index array by using the length of the index array and the hash value.
Optionally, the method for processing data, where searching for an index position of the data to be processed under the target array element includes: and based on the data position identification, determining a target linked list node matched in the index linked list associated with the target array element, and reading a storage address stored in the target linked list node.
Optionally, in the method for processing data, each array element is provided with an array subscript, and the array subscripts are increased from a set value; the determining the target array element matched with the file to be processed in the index array comprises: performing a remainder operation between the hash value and the length of the index array; determining subscript values of array elements to which the data to be processed belong according to operation results of the remainder operation, the set values and the increasing mode of the array subscripts; and searching a target array element corresponding to the subscript value.
Optionally, the determining a target linked list node matched in an index linked list associated with the target array element, and reading a storage address stored by the target linked list node includes: acquiring an index linked list associated with the target array element;
the following steps N1 to N4 are executed in a loop:
n1: selecting a current linked list node and a data position identifier of the current linked list node from the index linked list;
n2: matching the file identification of the current linked list node with the data position of the data to be processed; executing step N3 when the matching result indicates that the data position identification of the current linked list node is consistent with the data position identification of the data to be processed; executing step N4 when the matching result indicates that the data position identification of the linked list node is inconsistent with the data position identification of the data to be processed;
n3, reading the stored storage address from the read current linked list node, and ending the current flow;
n4: the unselected neighbor linked list nodes of the current linked list node are taken as current linked list node N1.
Optionally, the method for processing data, which acquires the data to be processed from the storage address, includes: and under the condition that the data to be processed in the storage address is obtained by a plurality of threads, the read-write lock of the threads is utilized to control the read-write permission of the threads to the data to be processed, so that the data to be processed is only provided for one thread at the same time.
Optionally, the controlling the read-write permission of the multiple threads to the data to be processed includes: the processing operation indicates reading; under the condition that the storage address does not have a read lock, judging whether the storage address has a write lock or not, and if so, determining that the thread does not have a read right; otherwise, determining that the thread has the reading authority, and setting a reading lock for the storage address.
Optionally, the controlling the read-write permission of the multiple threads to the data to be processed includes: the processing operation indicates a write; and acquiring a current version identifier corresponding to the storage address, comparing the version identifier contained in the processing operation with the current version identifier, and determining that the thread has write-in permission under the condition that the version identifier is greater than the current version identifier.
Optionally, the method for processing data, the storage data being attributed to one or more file storage objects, the storage data corresponding to one or more storage addresses, each of the storage addresses corresponding to a file management object, the file management object being configured to manage a correspondence between the file storage object and a storage address of the storage data attributed to the file storage object; the acquiring the data to be processed includes: and the file management object searches a file storage object corresponding to the storage address according to the managed corresponding relation, and acquires the data to be processed from the file storage object corresponding to the storage address.
Optionally, the method for processing data further includes: under the condition that processing operation indicates to write in new data, constructing a corresponding new file management object for the new data; determining a target file storage object for the newly added data according to the required space of the newly added data, storing the newly added data into the target file storage object, and determining a storage address of the newly added data; and managing the corresponding relation between the target file storage object and the storage address of the newly added data through the newly added file management object.
Optionally, after the creating a corresponding new file management object for the new data, the method for processing data further includes: determining a storage space of the newly added data through the newly added file management object, wherein the storage space of the newly added data is the demand space of a set multiple to accommodate the updated data of the newly added data; the determining a target file storage object for the newly added data includes: and determining a target file storage object of which the residual storage space meets the storage space of the newly added data.
Optionally, the determining a target file storage object for the newly added data includes: searching an available file storage object with the demand space from a plurality of file storage objects according to the demand space of the newly added data; under the condition of finding, determining any available file storage object as the target file storage object; otherwise, constructing a newly added file storage object, and determining the newly added file storage object as the target file storage object.
Optionally, in the method for processing data, when processing operation indicates update data, according to a required space of the update data, a file management object to which the update data belongs is used to determine whether a remaining space of a file storage object managed by the file management object meets a storage requirement of the update data, and if yes, the update data is written into a storage address corresponding to the update data; and if not, taking the updated data as new data, and executing the step of constructing a corresponding new file management object for the new data.
To achieve the above object, according to a second aspect of an embodiment of the present invention, there is provided an apparatus for processing data, including: the system comprises an acquisition position module, an address determining module and a data processing module; wherein the content of the first and second substances,
the position acquiring module is used for responding to the processing operation of the data to be processed and acquiring the data position identification of the data to be processed; searching a target array element to which the data position identification belongs in an index array included in a preset index object, and searching an index position of the file to be processed under the target array element, wherein the index object manages and stores data in a classified manner through a plurality of array elements of the index array;
the address determining module is used for reading the storage address of the data to be processed from the index position;
and the data processing module is used for acquiring the data to be processed according to the storage address and executing the processing operation on the data to be processed.
Optionally, the apparatus for processing data includes: each of the array elements has an associated index linked list; the index linked list comprises a plurality of linked list nodes, and the linked list nodes store a storage address for storing data.
Optionally, the apparatus for processing data is further configured to, after the obtaining of the data location identifier of the data to be processed: calculating a hash value of the data position identification; the searching the target array element to which the data position identifier belongs in the index array included in the preset index object includes: and determining the matched target array elements of the data to be processed in the index array by using the length of the index array and the hash value.
Optionally, the apparatus for processing data, where searching for the index position of the data to be processed under the target array element includes: and based on the data position identification, determining a target linked list node matched in the index linked list associated with the target array element, and reading a storage address stored in the target linked list node.
Optionally, the apparatus for processing data is configured to set an array index for each array element, where a plurality of array indexes are incremented from a set value; the determining the target array elements matched with the file to be processed in the index array comprises: performing a remainder operation between the hash value and the length of the index array; determining subscript values of array elements to which the data to be processed belong according to operation results of the remainder operation, the set values and the increasing mode of the array subscripts; and searching a target array element corresponding to the subscript value.
Optionally, the apparatus for processing data determines a target linked list node matched in the index linked list associated with the target array element, reads a storage address stored in the target linked list node, and is configured to obtain the index linked list associated with the target array element;
the following steps N1 to N4 are executed in a loop:
n1: selecting a current linked list node and a data position identifier of the current linked list node from the index linked list;
n2: matching the file identification of the current linked list node with the data position of the data to be processed; executing step N3 when the matching result indicates that the data position identification of the current linked list node is consistent with the data position identification of the data to be processed; executing step N4 when the matching result indicates that the data position identification of the linked list node is inconsistent with the data position identification of the data to be processed;
n3, reading the stored storage address from the read current linked list node, and ending the current flow;
n4: the unselected neighbor linked list nodes of the current linked list node are taken as current linked list node N1.
Optionally, the apparatus for processing data, configured to obtain the data to be processed from the storage address, includes: and under the condition that the data to be processed in the storage address is obtained by a plurality of threads, the read-write lock of the threads is utilized to control the read-write permission of the threads to the data to be processed, so that the data to be processed is only provided for one thread at the same time.
Optionally, the apparatus for processing data, where controlling the read-write permission of the multiple threads to the data to be processed includes: the processing operation indicates reading; under the condition that the storage address does not have a read lock, judging whether the storage address has a write lock or not, and if so, determining that the thread does not have a read right; otherwise, determining that the thread has the reading authority, and setting a reading lock for the storage address.
Optionally, the apparatus for processing data, where controlling the read-write permission of the multiple threads to the data to be processed includes: the processing operation indicates a write; and acquiring a current version identifier corresponding to the storage address, comparing the version identifier contained in the processing operation with the current version identifier, and determining that the thread has write-in permission under the condition that the version identifier is greater than the current version identifier.
Optionally, the apparatus for processing data, the storage data being attributed to one or more file storage objects, the storage data corresponding to one or more storage addresses, each of the storage addresses corresponding to a file management object, the file management object being configured to manage a correspondence between the file storage object and a storage address of the storage data attributed to the file storage object; the acquiring the data to be processed includes: and the file management object searches a file storage object corresponding to the storage address according to the managed corresponding relation, and acquires the data to be processed from the file storage object corresponding to the storage address.
Optionally, the apparatus for processing data is further configured to: under the condition that processing operation indicates to write in new data, constructing a corresponding new file management object for the new data; determining a target file storage object for the newly added data according to the required space of the newly added data, storing the newly added data into the target file storage object, and determining a storage address of the newly added data; and managing the corresponding relation between the target file storage object and the storage address of the newly added data through the newly added file management object.
Optionally, after the device for processing data constructs the corresponding new file management object for the new data, the device is further configured to: determining a storage space of the newly added data through the newly added file management object, wherein the storage space of the newly added data is the demand space of a set multiple to accommodate the updated data of the newly added data; the determining a target file storage object for the newly added data includes: and determining a target file storage object of which the residual storage space meets the storage space of the newly added data.
Optionally, the apparatus for processing data, where determining a target file storage object for the newly added data includes: searching an available file storage object with the demand space from a plurality of file storage objects according to the demand space of the newly added data; under the condition of finding, determining any available file storage object as the target file storage object; otherwise, constructing a newly added file storage object, and determining the newly added file storage object as the target file storage object.
Optionally, the device for processing data is configured to, when processing operation indicates update data, determine, by using a file management object to which the update data belongs, whether a remaining space of a file storage object managed by the file management object meets a storage requirement of the update data according to a required space of the update data, and if so, write the update data into a storage address corresponding to the update data; and if not, taking the updated data as new data, and executing the step of constructing a corresponding new file management object for the new data.
To achieve the above object, according to a third aspect of embodiments of the present invention, there is provided an electronic device for processing data, comprising: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out a method as claimed in any one of the above described methods of processing data.
To achieve the above object, according to a fourth aspect of embodiments of the present invention, there is provided a computer-readable medium having a computer program stored thereon, characterized in that the program, when executed by a processor, implements the method as set forth in any one of the methods of processing data described above.
One embodiment of the above invention has the following advantages or benefits: the index position of the data position identification can be searched from an index array included in a preset index object based on the data position identification of the data to be processed, the storage address of the data to be processed is read from the index position, and the processing operation is executed on the data to be processed. Managing local data (e.g., files) to be processed by the index object improves the efficiency of determining the location of the data and processing the data, reducing the consumption of computing resources.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a flow chart illustrating a method for processing data according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating an index object according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a method for processing data according to another embodiment of the present invention;
FIG. 4 is a schematic diagram of an apparatus for processing data according to an embodiment of the present invention;
FIG. 5 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 6 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Currently, there are two methods for processing files using JAVA tools: a character stream and a byte stream; regarding the character stream, the method for writing the file mainly originates from subclasses of the character stream Writer and the output byte stream OutputStream, and a FileWriter object can be constructed to call a write method so as to write related data into the file; or writing the file by using a buffer write with a buffer area; or performing a file write operation using a PrintWriter; but either PrintWriter or BufferedWriter relies on the FileWriter class to complete the call. Regarding the byte stream, the method of writing the byte stream is classified into direct writing or writing with a buffer.
On the other hand, for the reading operation of file data, input streams are usually used, for example, InputStream uses the content of read file, buffer-read InputStream with buffer area read file, and random access file, MappedByteBuffer read file through disk mapping, etc.
Therefore, the existing method for processing the file cannot accurately position the data, and the problem of low efficiency of positioning the file is caused by traversing operation.
In view of this, as shown in fig. 1, an embodiment of the present invention provides a method for processing data, which may include the following steps:
step S101: responding to the processing operation of the data to be processed, and acquiring a data position identifier of the data to be processed; searching a target array element to which the data position identification belongs in an index array included in a preset index object, and searching the index position of the data to be processed under the target array element, wherein the index object manages and stores the data in a classified mode through a plurality of array elements of the index array.
Specifically, the data to be processed is locally stored data, wherein the data to be processed may exist in one or more files; the processing operation may be operations such as reading and writing of data to be processed; further, responding to the processing operation of the data to be processed, and acquiring a data position identifier of the data to be processed; the data location identifier is a unique identifier for locating or determining the data to be processed, for example: when the data to be processed belongs to the file identification; or a unique identifier determined for the data to be processed by using a set rule.
Further, searching a target array element to which the data position identification belongs in an index array included in a preset index object; taking the schematic diagram of fig. 2 as an example, the index array 201 includes an array element N of data element 0, data element 1, and array element 2 …; managing storage data as a result of the index object being sorted by a plurality of array elements of the index array; therefore, a target array element matched with the data position identification is searched based on a plurality of array elements of the index array, and the index position of the data to be processed is searched under the target array element, so that the storage address of the data to be processed is read through the index position.
Further, the index object manages the storage data by classifying a plurality of array elements of the index array; the storage data includes a storage address, a data unique identifier (data location identifier), data version information, and the like of each local data.
Specifically, there are two methods for classifying and managing storage data:
the first method comprises the following steps: the respective array elements of the index array are used to manage (i.e., sort) the corresponding stored data.
The second method comprises the following steps: carrying out classification management by using linked lists associated with the array elements, for example, carrying out classification management on corresponding linked lists by using different elements in the array; as shown in FIG. 2, array element 0 is associated with a linked list 202; the linked list 202 comprises linked list node 0, linked list node 1 … linked list node N; each linked list node is used for managing and storing data; that is, each of the array elements has an associated index linked list; the index linked list comprises a plurality of linked list nodes, and the linked list nodes store a storage address for storing data.
Further, the index object may be an index file having a MAP data structure, such as meta.db.map; when the index file corresponding to the index object does not exist, the storage data managed by the index object is constructed by traversing the locally stored data (file). In the subsequent data processing process, the index file corresponding to the index object can be loaded into the memory, and the problem of low efficiency caused by traversing the file positioning file in the prior art is solved, so that the efficiency of positioning the data to be processed is improved to a greater extent.
Further, the method for determining the target array element in the index array to which the data position identifier of the data to be processed belongs is as follows: calculating a hash value of the data position identification; determining a target array element matched with the data to be processed in the index array by using the length of the index array and the hash value; namely, after the acquiring the data position identifier of the data to be processed, the method further includes: calculating a hash value of the data position identification; the searching the target array element to which the data position identifier belongs in the index array included in the preset index object includes: and determining the matched target array elements of the data to be processed in the index array by using the length of the index array and the hash value.
Further, the method for determining the target array element matched with the data to be processed in the index array by using the length of the index array and the hash value comprises the following steps: each array element is provided with an array subscript, and the array subscripts are increased progressively from a set value; the determining the target array element matched with the file to be processed in the index array comprises: performing a remainder operation between the hash value and the length of the index array; determining subscript values of array elements to which the data to be processed belong according to operation results of the remainder operation, the set values and the increasing mode of the array subscripts; and searching a target array element corresponding to the subscript value. Wherein, still taking the schematic diagram of fig. 2 as an example, the array elements are provided with array subscripts, for example: the array subscript of the array element 0 is 0, the array subscript of the array element 1 is 1, the array subscript of the array element 2 is 2 …, and the array subscripts are increased from a set value; in the example of FIG. 2, the array index is incremented starting from a set value of 0; it is understood that the set value of the array subscript may be any integer other than 0.
Illustratively, the data location of the data to be processed is identified as abc; calculating the hash value of "abc" to obtain a hash value 1, and obtaining the length (for example, 256) of an index array A, wherein the index array A is represented as A [255], and comprises A [0], A [1], and … A [255 ]; wherein A [0] is an array element, 0 represents the subscript value of the array element; further, taking the hash value 1 as a dividend and the length of the index array as a divisor, and performing a remainder operation, namely performing the remainder operation between the hash value and the length of the index array; assuming that the operation result of the remainder operation is 1, under the condition that the set value is 0, determining that the subscript value of an array element associated with the data position identifier "abc" is 1, and searching a target array element corresponding to the subscript value as A [1 ]; it is understood that, if the set value is not 0, the offset calculation may be performed on the subscript value based on the set value to obtain the target array element to which the data to be processed belongs.
Further, after a target array element is determined, searching an index position of the data to be processed under the target array element; specifically, based on the data position identifier, a target linked list node matched in an index linked list associated with the target array element is determined, and a storage address stored in the target linked list node is read. Specifically, taking the schematic diagram of fig. 2 as an example, if the target array element determined for the data to be processed is data element 0, a target linked list node matched with the data location identifier "abc" is further determined from the linked list nodes in the index linked list 202 associated with the data element 0, so as to read the storage address of the data to be processed from the target linked list node.
Further, the determining a target linked list node matched in the index linked list associated with the target array element, and reading a storage address stored by the target linked list node, includes:
acquiring an index linked list associated with the target array element; the following steps N1 to N4 are executed in a loop:
n1: selecting a current linked list node and a data position identifier of the current linked list node from the index linked list;
n2: matching the file identification of the current linked list node with the data position of the data to be processed; executing step N3 when the matching result indicates that the data position identification of the current linked list node is consistent with the data position identification of the data to be processed; executing step N4 when the matching result indicates that the data position identification of the linked list node is inconsistent with the data position identification of the data to be processed;
n3, reading the stored storage address from the read current link list node and ending the current flow;
n4: the unselected neighbor linked list nodes of the current linked list node are taken as current linked list node N1.
The method of steps N1-N4 may start sequential matching from an initial linked list node (e.g., linked list node 0 shown in fig. 2) in the index linked list associated with the target array element, and end the loop when the matching result indicates that the data location identifier of the current linked list node is consistent with the data location identifier of the data to be processed, that is, the matched storage address is found for the data to be processed.
Preferably, in the case of building the index object for the first time, one or more index arrays included in the index object may be determined first, including determining the length of the index array and the index values of the respective array elements; taking each data to be managed as newly added data, and executing the following operations: calculating a corresponding hash value for the data position identification of the newly added data; performing remainder operation on the lengths of the index arrays for the hash value of the newly added data; determining subscript values of array elements to which the data to be processed belong according to the operation results of the remainder operation, a set value and the increasing mode of the array subscripts; searching a target array element corresponding to the subscript value; after determining the target array element, storing storage data (including a storage address, a data position identifier, version information and the like) of the newly added data into the tail end of an index linked list associated with the target array element; after the cost operation is completed for each new data, the operation of building the index object is completed.
Step S102: and reading the storage address of the data to be processed from the index position.
Specifically, the description about determining the index position of the data to be processed is consistent with the description of step S101, and is not repeated here. The storage address indicates the position information that can be located to the data to be processed, and the storage address may indicate the position of the first data (e.g. character) of the data to be processed, so as to be located to the storage position of the data to be processed, so as to further perform the read-write operation on the file to be processed.
Step S103: and acquiring the data to be processed according to the storage address, and executing the processing operation on the data to be processed.
Specifically, when the to-be-processed data is obtained according to the storage address, the read-write permission of the to-be-processed data can be obtained by using thread read-write lock management. Namely, acquiring the data to be processed from the storage address comprises the following steps: and under the condition that the data to be processed in the storage address is obtained by a plurality of threads, the read-write lock of the threads is utilized to control the read-write permission of the threads to the data to be processed, so that the data to be processed is only provided for one thread at the same time.
Further, the controlling the read-write permission of the plurality of threads to the data to be processed includes: the processing operation indicates reading; under the condition that the storage address does not have a read lock, judging whether the storage address has a write lock or not, and if so, determining that the thread does not have a read right; otherwise, determining that the thread has the reading authority, and setting a reading lock for the storage address. Specifically, the read-write permission may be controlled by using a read-write lock renentrretreadwritelock provided by a JAVA concurrency toolkit, and in a case that a read operation indicates reading, it is determined whether the storage address has a write-lock, where an operator of the write-lock may be a thread other than a thread that handles a read operation, and if there is a write-lock, it is determined that the thread does not have the read permission, otherwise, it is determined whether the thread obtains a read lock (i.e., a shared lock), so as to further determine that the thread has the read permission.
Further, the controlling the read-write permission of the plurality of threads to the data to be processed includes: the processing operation indicates a write; and acquiring a current version identifier corresponding to the storage address, comparing the version identifier contained in the processing operation with the current version identifier, and determining that the thread has write-in permission under the condition that the version identifier is greater than the current version identifier. Specifically, the read-write lock reentrantreadwriteLock includes a write lock (i.e., an exclusive lock), and when the processing operation of the data to be processed indicates writing, it is determined whether the processing thread has the right to acquire writing (i.e., it is determined whether the write lock is acquired), the determining method is as follows: acquiring a current version identifier corresponding to the storage address, comparing the version identifier contained in the processing operation with the current version identifier, and determining that a thread has write-in permission under the condition that the version identifier is greater than the current version identifier; when the original to-be-processed data is first stored in the storage address, the version identifier may be set to 0, for example, expressed as version number: 0, when various types of updating are carried out on the data to be processed subsequently, the value of the version identification is subjected to incremental processing; for example: the version identification contained in the current processing operation as a write (i.e., update) is 1, 6; the current version identifier corresponding to the acquired storage address is 15, that is, when the version identifier is larger than the current version identifier, it is determined that the thread has the write permission. Therefore, by controlling the read-write lock of the operation of accessing the memory address by the thread, the safety and the accuracy of the data operation are improved, and the problems of low concurrency and low efficiency caused by locking the data (such as files) to be processed are solved.
As shown in fig. 3, another method for processing data according to an embodiment of the present invention may include the following steps:
step S301: the storage data belongs to one or more file storage objects, the storage data corresponds to one or more storage addresses, each storage address corresponds to a file management object, and the file management objects are used for managing the corresponding relation between the file storage objects and the storage addresses of the storage data belonging to the file storage objects.
Specifically, the method of the present invention is implemented using a plurality of management objects, and the storage data is saved using a file storage object (slave datastoree file); managing storage data corresponding to one or more storage addresses by using a file management object (FileBasentStoreSlave), wherein the file management object is used for managing the corresponding relation between the file storage object and the storage addresses of the storage data belonging to the file storage object; the method for determining the storage address of the data to be processed is consistent with the description of step S101, and is not described herein again.
Step S302: the acquiring the data to be processed includes: and the file management object searches a file storage object corresponding to the storage address according to the managed corresponding relation, and acquires the data to be processed from the file storage object corresponding to the storage address.
Step S303: and acquiring the data to be processed according to the storage address, and executing the processing operation on the data to be processed.
Specifically, the method of the present invention may be utilized to encapsulate as a FileStore interface, where the FileStore includes a BinaryFileStore list, and the BinaryFileStore indicates an index file and storage data associated with the index file, and includes: FileBasentStoreSlave, SlaveDataStoreFile, etc. Determining a file storage object slave data storage file associated with a storage address by using a file management object filebasecontentstochasslave, and further processing the object according to a processing operation, wherein the index object can have a corresponding index file, such as meta.db.map, and a management file, such as slave.management, corresponding to the filebasecontentstochasslave; a slave data store file corresponds to each file, e.g., slave.
Under the condition that processing operation indicates to write in new data, constructing a corresponding new file management object for the new data; determining a target file storage object for the newly added data according to the required space of the newly added data, storing the newly added data into the target file storage object, and determining a storage address of the newly added data; and managing the corresponding relation between the target file storage object and the storage address of the newly added data through the newly added file management object. Specifically, in the case of adding new data, a corresponding new file management object, such as FileBaseContentStoreSlave1, is constructed for the new object, and a demand space of the new data is further determined, for example: 10M, determining a target file storage object SlaveDataStoreFile1 matched with the demand space of newly added data from a plurality of SlaveDataStorefiles, and determining the storage address of the newly added data after the newly added data is stored in the target file storage object; storing the storage address of the newly added data to the corresponding index position in the index object; specifically, the method for determining the index position may be: performing remainder operation on the lengths of the index arrays for the hash value of the newly added data; determining the subscript value of the array element to which the newly added data belongs according to the operation result of the remainder operation, the set value and the increasing mode of the array subscript; searching a target array element corresponding to the subscript value; after the target array element is determined, storing storage data (including a storage address, a data position identifier, version information and the like) of the newly added data into the tail end of the index linked list associated with the target array element. And further managing the corresponding relation between the target file storage object (SlaveDataStoreFile1) and the storage address of the new added data through the new added file management object.
Further, after the creating a corresponding new file management object for the new data, the method further includes: determining a storage space of the newly added data through the newly added file management object, wherein the storage space of the newly added data is the demand space of a set multiple to accommodate the updated data of the newly added data; the determining a target file storage object for the newly added data includes: and determining a target file storage object of which the residual storage space meets the storage space of the newly added data. Specifically, a storage space may be applied for the newly added data by a newly added file management object (e.g., filebaseontentstoreslave 1), for example, a required space of the newly added data is 10M, and the newly added file management object may apply for 20M, that is, the storage space of the newly added data is the required space of a set multiple; in this example, the setting multiple is set to 2; to accommodate update data of the newly added data; by applying for the additional storage space for the newly added data, the newly added data can be directly updated without applying for a new storage space under the condition of increasing the data size in the subsequent updating, so that the data processing efficiency is improved, and the computing resources are saved.
Further, specifically, the determining a target file storage object for the newly added data includes: searching an available file storage object with the demand space from a plurality of file storage objects according to the demand space of the newly added data, and determining any available file storage object as the target file storage object under the condition of searching; otherwise, constructing a newly added file storage object, and determining the newly added file storage object as the target file storage object. For example: searching available file storage objects with the demand space from a plurality of SlaveDataStoreFile aggregates; the required space can be the size of the newly added data or the size of a set multiple of the newly added data; if an available file storage object such as the slave datastorefile2 is found, the slave datastorefile2 is used to store the new data, and the slave datastorefile2 is the target file storage object, otherwise, the new file storage object is constructed such as: the SlaveDataStoreFileX determines the newly added file storage object as the target file storage object so as to store newly added data; in particular, the file storage object may have a storage capacity of a set size, such as: the set size may be set to 32M, 64M, 128M, etc.
Preferably, the filebasecontentstochasmaster object can be used for managing each filebasecontentstochasslave through the number of the filebasecontentstochasslave object, the filebasecontentstochasmaster can recover the storage space, the filebasecontentstochasmaster is used for adding the filebasecontentstochasslave and the storage data managed by the filebasecontentstochasmaster into the deleted filebasecontentstochasslave list when the storage data managed by any filebasecontentstochasslave is marked as deleted, the list is sorted from large to small according to the storage space, and the filebasecontentstochasslave matched with the storage space is obtained from the list when the filebasecontentstochasslave object is required to be newly added for the data to be processed. When each FileBasentStoreSlave corresponding to a certain stored data file is deleted, the data (such as the file) and the corresponding FileBasentStoreSlave are deleted from the system, thereby saving the storage space of a memory and a disk.
Under the condition that processing operation indicates to update data, according to the required space of the update data, judging whether the residual space of a file storage object managed by a file management object to which the update data belongs meets the storage requirement of the update data by using the file management object to which the update data belongs, and if so, writing the update data into a storage address corresponding to the update data; and if not, taking the updated data as new data, and executing the step of constructing a corresponding new file management object for the new data. Specifically, in the case that a processing operation for processing data to be processed indicates update data, a required space of the update data is acquired, and whether the remaining space of a file storage object (slave data storage file5) managed by a file management object (e.g., filebasecontentstore 6) to which the update data belongs meets the storage requirement of the update data is judged; if the storage address of the file storage object (SlaveDataStoreFile5) does not meet the storage requirement of the update data, the step of processing the new data is executed by taking the update data as the new data. And simultaneously deleting the existing updating data and the corresponding storage address.
As shown in fig. 4, an embodiment of the present invention provides an apparatus 400 for processing data, including: a location obtaining module 401, an address determining module 402 and a data processing module 403; wherein the content of the first and second substances,
the position obtaining module 401 is configured to obtain a data position identifier of data to be processed in response to a processing operation of the data to be processed; searching a target array element to which the data position identifier belongs in an index array included in a preset index object, and searching the index position of the file to be processed under the target array element, wherein the index object manages and stores data in a classified manner through a plurality of array elements of the index array;
the address determining module 402 is configured to read a storage address of the to-be-processed data from the index position;
the data processing module 403 is configured to obtain the to-be-processed data according to the storage address, and perform the processing operation on the to-be-processed data
An embodiment of the present invention further provides an electronic device for processing data, including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the method provided by any one of the above embodiments.
Embodiments of the present invention further provide a computer-readable medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method provided in any of the above embodiments.
Fig. 5 illustrates an exemplary system architecture 500 of a method of processing data or an apparatus for processing data to which embodiments of the present invention may be applied.
As shown in fig. 5, the system architecture 500 may include terminal devices 501, 502, 503, a network 504, and a server 505. The network 504 serves to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. The terminal devices 501, 502, 503 may have various client applications installed thereon, such as an e-mall client application, a web browser application, a search-type application, an instant messaging tool, a mailbox client, and the like.
The terminal devices 501, 502, 503 may be various electronic devices having display screens and supporting various client applications, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 505 may be a server providing various services, such as a background management server providing support for client applications used by users with the terminal devices 501, 502, 503. The background management server can process the received request for processing the data, execute the operation of processing the data and feed back the processing result information to the terminal equipment.
It should be noted that the method for processing data provided by the embodiment of the present invention is generally executed by the server 505, or a tablet computer, a laptop portable computer, a desktop computer, etc., and accordingly, the apparatus for processing data is generally disposed in the server 505, or the tablet computer, the laptop portable computer, the desktop computer, etc.
It should be understood that the number of terminal devices, networks, and servers in fig. 5 are merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for an implementation.
Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, 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 illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 the present invention, 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 the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart 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 invention. 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 or flowchart illustration, and combinations of blocks in the block diagrams 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 modules and/or units described in the embodiments of the present invention may be implemented by software, and may also be implemented by hardware. The described modules and/or units may also be provided in a processor, and may be described as: a processor includes a location acquisition module, an address determination module, and a data processing module. The names of these modules do not limit the module itself in some cases, for example, the data processing module may also be described as a "module that acquires the data to be processed according to the storage address and performs the processing operation on the data to be processed".
As another aspect, the present invention also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: responding to the processing operation of the data to be processed, and acquiring a data position identifier of the data to be processed; searching a target array element to which the data position identification belongs in an index array included in a preset index object, and searching an index position of the data to be processed under the target array element, wherein the index object manages and stores data in a classified manner through a plurality of array elements of the index array; reading the storage address of the data to be processed from the index position; and acquiring the data to be processed according to the storage address, and executing the processing operation on the data to be processed.
According to the embodiment of the invention, the index position of the data position identification can be searched from the index array included in the preset index object based on the data position identification of the data to be processed, and the storage address of the data to be processed is read from the index position; and executing the processing operation on the data to be processed. Managing local data (e.g., files) to be processed by the index object improves the efficiency of determining the location of the data and processing the data, reducing the consumption of computing resources.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (17)
1. A method of processing data, comprising:
responding to the processing operation of the data to be processed, and acquiring a data position identifier of the data to be processed;
searching a target array element to which the data position identification belongs in an index array included in a preset index object, and searching an index position of the data to be processed under the target array element, wherein the index object manages and stores data in a classified manner through a plurality of array elements of the index array;
reading the storage address of the data to be processed from the index position;
and acquiring the data to be processed according to the storage address, and executing the processing operation on the data to be processed.
2. The method of claim 1,
each of the array elements has an associated index linked list;
the index linked list comprises a plurality of linked list nodes, and the linked list nodes store a storage address for storing data.
3. The method of claim 1,
after the acquiring the data position identification of the data to be processed, the method further comprises: calculating a hash value of the data position identification;
the searching the target array element to which the data position identifier belongs in the index array included in the preset index object includes:
and determining the matched target array elements of the data to be processed in the index array by using the length of the index array and the hash value.
4. The method of claim 2,
the searching the index position of the data to be processed under the target array element comprises:
and based on the data position identification, determining a target linked list node matched in the index linked list associated with the target array element, and reading a storage address stored in the target linked list node.
5. The method of claim 3,
each array element is provided with an array subscript, and the array subscripts are increased progressively from a set value;
the determining the target array element matched with the file to be processed in the index array comprises:
performing a remainder operation between the hash value and the length of the index array;
determining subscript values of array elements to which the data to be processed belong according to operation results of the remainder operation, the set values and the increasing mode of the array subscripts;
and searching a target array element corresponding to the subscript value.
6. The method of claim 4,
the determining the target linked list nodes matched in the index linked list associated with the target array elements and reading the storage addresses stored by the target linked list nodes includes:
acquiring an index linked list associated with the target array element;
the following steps N1 to N4 are executed in a loop:
n1: selecting a current linked list node and a data position identifier of the current linked list node from the index linked list;
n2: matching the file identification of the current linked list node with the data position of the data to be processed; executing step N3 when the matching result indicates that the data position identification of the current linked list node is consistent with the data position identification of the data to be processed; executing step N4 when the matching result indicates that the data position identification of the linked list node is inconsistent with the data position identification of the data to be processed;
n3, reading the stored storage address from the read current linked list node, and ending the current flow;
n4: the unselected neighbor linked list nodes of the current linked list node are taken as current linked list node N1.
7. The method of claim 1,
acquiring the data to be processed from the storage address, including:
and under the condition that the data to be processed in the storage address is obtained by a plurality of threads, the read-write lock of the threads is utilized to control the read-write permission of the threads to the data to be processed, so that the data to be processed is only provided for one thread at the same time.
8. The method of claim 7,
the controlling the read-write permission of the plurality of threads to the data to be processed comprises:
the processing operation indicates reading;
under the condition that the storage address does not have a read lock, judging whether the storage address has a write lock or not, and if so, determining that the thread does not have a read right; otherwise, determining that the thread has the reading authority, and setting a reading lock for the storage address.
9. The method of claim 7,
the controlling the read-write permission of the plurality of threads to the data to be processed comprises:
the processing operation indicates a write;
and acquiring a current version identifier corresponding to the storage address, comparing the version identifier contained in the processing operation with the current version identifier, and determining that the thread has write-in permission under the condition that the version identifier is greater than the current version identifier.
10. The method of claim 1,
the storage data belongs to one or more file storage objects, the storage data corresponds to one or more storage addresses, each storage address corresponds to a file management object, and the file management objects are used for managing the corresponding relation between the file storage objects and the storage addresses of the storage data belonging to the file storage objects;
the acquiring the data to be processed includes:
and the file management object searches a file storage object corresponding to the storage address according to the managed corresponding relation, and acquires the data to be processed from the file storage object corresponding to the storage address.
11. The method of claim 10, further comprising:
under the condition that processing operation indicates to write in new data, constructing a corresponding new file management object for the new data;
determining a target file storage object for the newly added data according to the required space of the newly added data, storing the newly added data into the target file storage object, and determining a storage address of the newly added data;
and managing the corresponding relation between the target file storage object and the storage address of the newly added data through the newly added file management object.
12. The method of claim 11, further comprising, after the constructing the corresponding new file management object for the new data,:
determining a storage space of the newly added data through the newly added file management object, wherein the storage space of the newly added data is the demand space of a set multiple to accommodate the updated data of the newly added data;
the determining a target file storage object for the newly added data includes:
and determining a target file storage object of which the residual storage space meets the storage space of the newly added data.
13. The method of claim 12, wherein the determining a target file storage object for the new added data comprises:
searching an available file storage object with the demand space from a plurality of file storage objects according to the demand space of the newly added data;
under the condition of finding, determining any one of the available file storage objects as the target file storage object;
otherwise, constructing a newly added file storage object, and determining the newly added file storage object as the target file storage object.
14. The method of claim 10,
under the condition that processing operation indicates to update data, according to the required space of the update data, judging whether the residual space of a file storage object managed by a file management object to which the update data belongs meets the storage requirement of the update data by using the file management object to which the update data belongs, and if so, writing the update data into a storage address corresponding to the update data; and if not, taking the updated data as new data, and executing the step of constructing a corresponding new file management object for the new data.
15. An apparatus for processing data, comprising: the system comprises an acquisition position module, an address determining module and a data processing module; wherein the content of the first and second substances,
the position acquiring module is used for responding to the processing operation of the data to be processed and acquiring the data position identification of the data to be processed; searching a target array element to which the data position identification belongs in an index array included in a preset index object, and searching an index position of the file to be processed under the target array element, wherein the index object manages and stores data in a classified manner through a plurality of array elements of the index array;
the address determining module is used for reading the storage address of the data to be processed from the index position;
and the data processing module is used for acquiring the data to be processed according to the storage address and executing the processing operation on the data to be processed.
16. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-14.
17. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210393316.6A CN114817146A (en) | 2022-04-15 | 2022-04-15 | Method and device for processing data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210393316.6A CN114817146A (en) | 2022-04-15 | 2022-04-15 | Method and device for processing data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114817146A true CN114817146A (en) | 2022-07-29 |
Family
ID=82536511
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210393316.6A Pending CN114817146A (en) | 2022-04-15 | 2022-04-15 | Method and device for processing data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114817146A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116415977A (en) * | 2023-03-24 | 2023-07-11 | 广州市原象信息科技有限公司 | Target crowd consumption data analysis method and system for live broadcasting room |
| CN116521198A (en) * | 2023-04-13 | 2023-08-01 | 广州汽车集团股份有限公司 | Data processing method, device, equipment and computer readable storage medium |
-
2022
- 2022-04-15 CN CN202210393316.6A patent/CN114817146A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116415977A (en) * | 2023-03-24 | 2023-07-11 | 广州市原象信息科技有限公司 | Target crowd consumption data analysis method and system for live broadcasting room |
| CN116415977B (en) * | 2023-03-24 | 2023-10-03 | 广州市原象信息科技有限公司 | Target crowd consumption data analysis method and system for live broadcasting room |
| CN116521198A (en) * | 2023-04-13 | 2023-08-01 | 广州汽车集团股份有限公司 | Data processing method, device, equipment and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107870728B (en) | Method and apparatus for moving data | |
| CN113495921B (en) | Routing method and device for database cluster | |
| CN107302597B (en) | Message file pushing method and device | |
| CN114817146A (en) | Method and device for processing data | |
| CN110765187A (en) | Data source route management method and device | |
| US20190108225A1 (en) | System and method for in-place record content management | |
| US10983949B2 (en) | File system quota versioning | |
| US20130007377A1 (en) | Message oriented middleware with integrated rules engine | |
| CN112860953A (en) | Data importing method, device, equipment and storage medium of graph database | |
| CN112947992B (en) | Code version management method and device | |
| US10002135B2 (en) | Simplifying the check-in of checked-out files in an ECM system | |
| CN109614383B (en) | Data copying method and device, electronic equipment and storage medium | |
| CN111858586A (en) | Data processing method and device | |
| CN112948138A (en) | Method and device for processing message | |
| CN112905225A (en) | Method and device for creating continuous integration tool construction task | |
| CN110674082A (en) | Method and device for removing online document, electronic equipment and computer readable medium | |
| CN112395337A (en) | Data export method and device | |
| CN112527276B (en) | Data updating method and device in visual programming tool and terminal equipment | |
| CN113722007A (en) | Configuration method, device and system of VPN branch equipment | |
| US20170132222A1 (en) | Document link migration | |
| CN113342449A (en) | Data protection method and device | |
| CN113704242A (en) | Data processing method and device | |
| CN109213815B (en) | Method, device, server terminal and readable medium for controlling execution times | |
| CN112711572A (en) | Online capacity expansion method and device suitable for sub-warehouse and sub-meter | |
| CN112835609A (en) | Method and device for modifying dependent package download address |
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 |