CN110688826A - Disordered row-column transposition method and device, computer equipment and storage medium - Google Patents
Disordered row-column transposition method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN110688826A CN110688826A CN201910750717.0A CN201910750717A CN110688826A CN 110688826 A CN110688826 A CN 110688826A CN 201910750717 A CN201910750717 A CN 201910750717A CN 110688826 A CN110688826 A CN 110688826A
- Authority
- CN
- China
- Prior art keywords
- row
- cell
- sub
- cells
- sequence
- 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.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a disordered row-column transposition method, a disordered row-column transposition device, computer equipment and a storage medium, wherein the method comprises the steps of determining the number of initial data included in each cell of a table to be transposed; calling a preset splitting function to split each cell in the table to be transposed into a plurality of sub-cells which are sequentially arranged so as to obtain a first intermediate table; sequentially acquiring a corresponding number of sequence marking bits from a preset sequence marking bit array according to the determined number; inserting different sequence marking bits acquired for each row into the sub-cells obtained by splitting each cell in each row respectively; and calling a preset Lateral function to convert all the sub-cells obtained by splitting the same cell in each row of the first intermediate table into the column of the cell in sequence to obtain the target table. The invention can realize the high-efficiency management of the form data and improve the user experience.
Description
Technical Field
The present invention relates to the field of data processing, and in particular, to a method and an apparatus for disordered row-column transposition, a computer device, and a storage medium.
Background
A database refers to a collection of data that is stored together in a manner that can be shared by multiple users, has as little redundancy as possible, and is independent of the application. The database takes the table as an entity, and the essence of the database is a file system which stores data in a corresponding table according to a specific format, so that a user can add, modify, delete and query the data in the table in the database. At present, a large amount of data is generated in production and life, and in order to better read and manage the data, the large amount of data is usually stored in a table of a database, and the data in the table of the database may also be correspondingly transposed in rows and columns so as to perform operations such as data reading, but the current operation of column transposition has a situation that is partially irreversible, that is, the original state before transposition cannot be restored after column transposition, and the data management is inconvenient.
Disclosure of Invention
The embodiment of the invention provides a disordered row-column transposition method, a disordered row-column transposition device, computer equipment and a storage medium, which can realize efficient management of form data and can improve the safety performance of data storage and the use experience of a user.
In a first aspect, an embodiment of the present invention provides a method for disordered row-column transposition, where the method includes: acquiring a table to be transposed in a preset database to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same;
calling a preset splitting function to split each cell in each row in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell to correspondingly obtain a first intermediate table, wherein the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split;
determining the quantity of initial data included in one of the cells in each row of the first intermediate table, and sequentially acquiring a corresponding quantity of sequence mark bits from a preset sequence mark bit array according to the determined quantity, wherein the sequence mark bit array comprises a plurality of sequentially arranged sequence mark bits, the sequence mark bits acquired for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequence mark bit acquired for the row;
according to the called preset marking function and the corresponding number of sequence marking bits associated with each row of the first intermediate table, sequentially and respectively inserting the sequence marking bits acquired aiming at one row into the sub-cells which are obtained by splitting each cell in the row and are arranged in sequence;
and calling a preset Lateral function to convert all the sub-cells obtained by splitting the same cell in each row of the first intermediate table into the column of the cell in sequence to obtain a target table with a plurality of columns arranged side by side, wherein the target table is associated with the table to be transposed, and the number of the columns of the target table is the same as that of the table to be transposed.
In a second aspect, an embodiment of the present invention further provides a device for unordered row-column transposition, where the device includes:
the table acquiring unit is used for acquiring a table to be transposed in a preset database so as to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same;
the table splitting unit is used for calling a preset splitting function to split each cell in each row in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell to correspondingly obtain a first intermediate table, wherein the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split;
a flag determining unit, configured to determine a number of initial data included in one of the cells in each row of the first intermediate table, so as to sequentially acquire a corresponding number of sequential flag bits from a preset sequential flag bit array according to the determined number, where the sequential flag bit array includes a plurality of sequentially arranged sequential flag bits, the sequential flag bits acquired for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequential flag bit acquired for the row;
the mark inserting unit is used for respectively inserting the sequence mark bits acquired aiming at one row into the sub-cells which are obtained by splitting each cell in the row and are arranged in sequence according to the called preset mark function and the corresponding number of sequence mark bits associated with each row of the first intermediate table;
a row-column conversion unit, configured to invoke a preset lareral function to convert all sub-cells split from the same cell in each row of the first intermediate table into a column in which the cell is located in sequence, so as to obtain a target table having multiple columns arranged side by side, where the target table is associated with the table to be transposed, and the number of columns of the target table is the same as the number of columns of the table to be transposed.
In a third aspect, an embodiment of the present invention further provides a computer device, which includes a memory and a processor, where the memory stores a computer program, and the processor implements the above method when executing the computer program.
In a fourth aspect, the present invention also provides a computer-readable storage medium, which stores a computer program, and the computer program can implement the above method when being executed by a processor.
The embodiment of the invention provides a disordered row-column transposition method and device, computer equipment and a storage medium. Wherein the method comprises the following steps: acquiring a table to be transposed in a preset database to determine the number of initial data included in each cell of each row of the table to be transposed; calling a preset splitting function to split each cell of each line in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell to correspondingly obtain a first intermediate table; determining the quantity of initial data included in one cell in each row of the first intermediate table, and sequentially acquiring corresponding quantity of sequential marking bits from a preset sequential marking bit array according to the determined quantity; according to the called preset marking function and the corresponding number of sequence marking bits associated with each row of the first intermediate table, sequentially and respectively inserting the sequence marking bits acquired aiming at one row into the sub-cells which are obtained by splitting each cell in the row and are arranged in sequence; and calling a preset Lateral function to convert all the sub-cells obtained by splitting the same cell in each row of the first intermediate table into the column of the cell in sequence so as to obtain a target table with a plurality of columns arranged side by side. According to the embodiment of the invention, because the row and column transposition of the table in the preset database is realized by calling the related function, the efficient management of the table data can be realized, and the use experience of the user is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flow chart of a method for disordered row-column transposition according to an embodiment of the present invention;
fig. 1a is a schematic view of an application scenario of a disordered row-column transposition method according to an embodiment of the present invention;
FIG. 2 is a sub-flow diagram of a method for disordered row-column transposition according to an embodiment of the present invention;
FIG. 3 is a flow chart of a method for disordered row-column transposition according to another embodiment of the present invention;
FIG. 4 is a block diagram of an out-of-order row-column transpose apparatus according to an embodiment of the present invention;
FIG. 5 is a schematic block diagram of a flag inserting unit of an unordered row-column transposing apparatus according to an embodiment of the present invention;
FIG. 6 is a block diagram of an out-of-order row-column transposing apparatus according to another embodiment of the present invention;
fig. 7 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
Referring to fig. 1 and fig. 1a, fig. 1 is a schematic flow chart of a disordered row-column transposition method provided in an embodiment of the present application, and fig. 1a is a schematic view of a scenario of the disordered row-column transposition method in the embodiment of the present application. The unordered line-row transposition method is applied to the management server 10. The management server 10 can call related functions to implement row-column transposition of tables in a preset database, wherein data in the preset database is related data acquired from the internet 20. The steps of the unordered line transpose method will be described in detail below from the perspective of the management server 10.
Referring to fig. 1, fig. 1 is a schematic flow chart of a method for disordered row-column transposition according to an embodiment of the present invention. As shown in fig. 1, the steps of the method include steps S101 to S105.
Step S101, obtaining a table to be transposed in a preset database to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same.
In this embodiment, the data in the preset database may be related data acquired from the internet through a web crawler, so that a user may perform data mining analysis, and of course, the data in the preset database may be stored in a form of a table, that is, the preset database may include a plurality of tables. In order to facilitate the storage, viewing and processing by the user, each cell in the table in the preset database may store a plurality of data information, and the table may also be transposed with respect to the row and column as required.
When the management server obtains a table to be transposed in a preset database, the number of initial data stored in each cell of each row of the table to be transposed needs to be determined, so as to perform corresponding row-column conversion.
In an embodiment, the table to be transposed may further include a list name row, where a list name stored in each cell in the list name row is an initial column name of a column where the cell is located.
For example, as shown in Table 1,
Answer | Question |
A;B;C;NULL;E;D | 1001;1002;1003;1105;1109;1107 |
TABLE 1
As can be seen from the data storage locations in table 1, in general, the initial data a may correspond to the initial data 1001, the initial data B may correspond to the initial data 1002, and the initial data C may correspond to the initial data 1003. Meanwhile, the first row is a list name row, and the second row is a main row of the table with transpose for storing numerical values. Wherein Answer is the initial column name of the first column, and Question is the initial column name of the second column; when the table to be transposed is analyzed, if a list name line exists, the second line of the table to be transposed should be used as an initial line to be converted, and each cell of the line comprises six different initial data.
Step S102, a preset splitting function is called to split each cell in each row of the table to be transposed into a plurality of sub-cells arranged in sequence, and all initial data in each cell is sequentially and independently stored in the corresponding sub-cell to correspondingly obtain a first intermediate table, wherein the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split.
In this embodiment, the management server may call a preset splitting function, such as a Split function, and Split each cell in each row in the table to be transposed into a plurality of sequentially arranged sub-cells, that is, the arrangement order of the sub-cells may be determined according to the arrangement order of the initial data in each cell, so as to ensure that each sub-cell can store a corresponding initial data in order, and avoid confusion in the process of allocating the initial data. At this time, the split table is the first intermediate table, and meanwhile, the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split, so that the relevance between the data of different cells in the same row is further ensured, and the user can call and read the data conveniently.
For example, as shown in the following table 2, the table shown in table 2 is the first intermediate table, the first six sub-cells in the initial row of the first intermediate table are split into the first cell of the initial row of the table to be transposed, and similarly, the last six sub-cells in the initial row of the first intermediate table are split into the second cell of the initial row of the table to be transposed.
TABLE 2
The first six sub-cells in the initial row in table 2 store the initial data in the first cell in the corresponding initial row in sequence, and the last six sub-cells in the initial row in table 2 store the initial data in the second cell in the corresponding initial row in sequence.
In one embodiment, the step S102 includes: and calling a preset Split function to divide each cell in each row in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell so as to correspondingly obtain a first intermediate table. Wherein, the Split function is one of the splitting functions. Each cell of each row in the table to be transposed can be divided into a plurality of sub-cells which are sequentially arranged by calling a preset Split function.
Step S103, determining the amount of initial data included in one of the cells in each row of the first intermediate table, and sequentially acquiring a corresponding amount of sequential flag bits from a preset sequential flag bit array according to the determined amount, where the sequential flag bit array includes a plurality of sequentially arranged sequential flag bits, the sequential flag bits acquired for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequential flag bit acquired for the row.
In this embodiment, in order to allocate different sequence flag bits to each sub-cell, at this time, the management server needs to determine the amount of the initial data included in one of the cells in each row of the first intermediate table, that is, the amount of the initial data included in other cells in each row can be known by the amount of the initial data included in one of the cells in each row. Then, the management server may obtain, from the array of preset sequence flag bits, the same number of sequence flag bits as the number of initial data included in the cell of the row, where the obtained sequence flag bits need to be associated with the row. For example, in table 1, the number of initial data of the first cell in the starting row of the table to be transposed is 6, the preset sequence flag bit group is (101; 102; 103; 104; 105; 106; 107; … …), and then the sequence flag bits associated with the starting row need to be sequentially obtained (101; 102; 103; 104; 105; 106) from the sequence flag bit group.
Step S104, according to the called preset marking function and the corresponding number of sequence marking bits associated with each row of the first intermediate table, sequentially inserting the sequence marking bits acquired for one row into the sequentially arranged sub-cells obtained by splitting each cell in the row.
In this embodiment, the management server may call a preset flag function, such as a Contact _ ws function, and sequentially insert the sequence flag bits acquired for one of the rows into the sequentially arranged sub-cells obtained by splitting each cell in the row, specifically, sequentially insert the sequence flag bits associated with the row into the sub-cells belonging to the same cell in each row in the first intermediate table, as shown in table 3
TABLE 3
The sequence marking bits obtained from the preset sequence marking bit group and associated with the initial row of the first intermediate table are (101; 102; 103; 104; 105; 106), and at the moment, the sequence marking bits are correspondingly inserted into the corresponding sub-cells in a one-to-one correspondence manner.
In one embodiment, as shown in FIG. 2, the step S104 may include steps S201 to S204.
Step S201, determining a corresponding number of sequential flag bits associated with each row of the first intermediate table. The management server may determine a corresponding number of sequential flag bits associated with all rows of the first intermediate table, so as to perform corresponding marking for the sub-cells.
Step S202, the called preset Contact _ ws function is operated to determine the position sequence of the sub-cells which are obtained by splitting each cell in each row and are arranged in sequence, wherein the sub-cells corresponding to the cells in different rows respectively correspond to the sequence marking bits acquired for the row one by one in sequence. The management server can also run the called marking function (Contact _ ws function) and determine the position sequence of the sequenced sub-cells obtained by splitting each row, so as to insert the corresponding number of sequence marking bits associated with the row into different sub-cells in sequence.
Step S203, according to the position sequence of each sub-cell, determining the sequence mark bit matched with the position sequence from the sequence marks acquired for the row.
Step S204, inserting the determined sequence marking bit into the sub-cell. Wherein the determined order flag bits matching the positional order of each sub-cell may be inserted into the sub-cells.
Step S105, a preset lareral function is called to convert all sub-cells obtained by splitting the same cell in each row of the first intermediate table into a column in which the cell is located in sequence, so as to obtain a target table having a plurality of columns arranged side by side, where the target table is associated with the table to be transposed, and the number of columns of the target table is the same as the number of columns of the table to be transposed.
In this embodiment, the management server may call and run a preset lareral function for automatic numeration, and all sub-cells obtained by splitting the same cell in each row of the first intermediate table are converted into a column with the cell, as shown in table 4
| Question | |
101 |
101#1001 | |
102 |
102#1002 | |
103 |
103#1003 | |
104 |
104#1105 | |
105 |
105#1109 | |
106#D | 106#1107 |
TABLE 4
The sub-cells obtained by splitting the same cell are converted into the column of the cell in sequence, and similarly, the sub-cells obtained by splitting the same cell in other rows can also be converted into the column of the cell in sequence, so that the number of columns of the target table is the same as that of the table to be transposed. In addition, in order to facilitate analysis and search by a user, the target table can be associated with the table to be transposed, so that the restoring accuracy of the table to be transposed in the row and column transposition process is ensured, the time and cost required by an intermediate association table are effectively reduced, and the data conversion and viewing efficiency of the management server and the data processing performance are improved.
In summary, in the embodiment of the present invention, since the row and column transpose of the table in the preset database is realized by calling the related function, the efficient management of the table data can be realized, and the user experience is improved.
Referring to fig. 3, fig. 3 is a schematic flow chart of a method for disordered row-column transposition according to another embodiment of the invention. As shown in fig. 3, the steps of the method include steps S301 to S307. The related explanations and detailed descriptions of the steps similar to steps S101-S105 in the above embodiment are not repeated herein, and the following detailed descriptions are the added steps in this embodiment.
Step S301, acquiring a table to be transposed in a preset database to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same.
In an embodiment, the table to be transposed includes a list name row, and a list name stored in each cell in the list name row is an initial column name of a column in which the cell is located.
Step S302, a preset splitting function is called to split each cell in each row of the table to be transposed into a plurality of sub-cells arranged in sequence, and all initial data in each cell is sequentially and individually stored in the corresponding sub-cell, so as to correspondingly obtain a first intermediate table, where the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split.
Step S303, determining the number of initial data included in one of the cells in each row of the first intermediate table, so as to sequentially obtain a corresponding number of sequential flag bits from a preset sequential flag bit array according to the determined number, where the sequential flag bit array includes a plurality of sequentially arranged sequential flag bits, the sequential flag bits obtained for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequential flag bit obtained for the row.
Step S304, according to the called preset marking function and the corresponding number of sequence marking bits associated with each row of the first intermediate table, sequentially inserting the sequence marking bits acquired for one row into the sequentially arranged sub-cells obtained by splitting each cell in the row.
Step S305, a preset lareral function is called to convert all sub-cells obtained by splitting the same cell in each row of the first intermediate table into a column in which the cell is located in sequence, so as to obtain a target table having a plurality of columns arranged side by side, where the target table is associated with the table to be transposed, and the number of columns of the target table is the same as the number of columns of the table to be transposed.
Step S306, a preset Array function is called, so as to sequentially group the sub cells in all columns of the target table according to the sequence flag bit associated with each row in the table to be transposed and the sequence flag bit inserted into the sub cells of the target table, and sequentially set the sub cells located in the same group side by side to be the same row according to the arrangement sequence of the rows, so as to obtain a second intermediate table, where the number of rows of the second intermediate table is the same as the number of rows of the table to be transposed, and each row is associated with the sequence flag bit acquired for the row.
In this embodiment, the management server can group the sub-cells in the columns in the target table and perform corresponding transposition of column-to-row by using a preset array function or the like, so as to obtain a second intermediate table, which is similar to the first intermediate table. If the target information is added into the sub-cells, the step converts the target table into a second intermediate table with the same format as the first intermediate table; if so, directly transpose to the first intermediate table.
Step S307, a preset merge function is called to merge the sub-cells with different sequence flag bits arranged in sequence in each row into one cell, so as to obtain a converted table after merging and restoring.
In this embodiment, the management server may call a preset merge function to merge the sub-cells arranged in sequence in each row and having different sequence flag bits, that is, merge and restore the sub-cells originally split from the same cell to obtain a converted table after the merge and the restoration, where the converted table is a table that has been transposed and restored again, so as to facilitate subsequent storage and call of a user, increase availability of data in a preset database, and facilitate management and corresponding processing of the data.
In an embodiment, the step 307 may specifically include: and calling a preset coordinate function to merge the sub-cells with different sequence marking bits arranged in sequence in each row into one cell so as to obtain the converted table after merging and restoring. Wherein, the merge function may be a Concatenate function.
In an embodiment, the method 300 may further include the steps of:
step S308, calling a preset dictionary table to acquire target information associated with each initial data from the preset dictionary table.
Step S309, insert the target information associated with each initial data into the sub-cell in which the initial data is located.
In order to ensure the security performance of data storage, the initial data stored in the general cells are generally encrypted codes, and at this time, different data represented by different codes can be confirmed according to a preset dictionary table which is preset, so that the size of a table to be transposed is correspondingly reduced, and the data management is facilitated. Therefore, the management server can call the preset dictionary table, so as to determine the target information associated with each initial data, and insert the target information into the sub-cell where the initial data associated with the target information is located. For example, as shown in Table 5
| Question | |
101 |
101# your gender? | |
Sale No. 102 | 102# your first occupation? | |
103 |
103# your second occupation? | |
104 |
104# longest working time? | |
105#55 years old | 105# your age? | |
106# local residence for 5 years | 106# local residenceTime of day |
TABLE 5
The table shows the corresponding relation between the answer and the query, so that a user can conveniently read the data when needed, and the data in the table to be transposed is a corresponding code, so that the safety of the data is ensured. Namely, the data stored in the cells are encrypted through the preset dictionary table, namely, the initial data in the cells can be encrypted related codes, so that the safety performance of data storage and the use experience effect of a user are improved.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), or the like.
Referring to fig. 4, in response to the foregoing method for disordered row-column transposition, an embodiment of the present invention further provides a disordered row-column transposition apparatus, where the apparatus 100 includes: the table processing device comprises a table acquisition unit 101, a table splitting unit 102, a mark determination unit 103, a mark insertion unit 104 and a row-column conversion unit 105.
A table obtaining unit 101, configured to obtain a table to be transposed in a preset database, so as to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same.
In this embodiment, the data in the preset database may be related data acquired from the internet through a web crawler, so that a user may perform data mining analysis, and of course, the data in the preset database may be stored in a form of a table, that is, the preset database may include a plurality of tables. In order to facilitate the storage, viewing and processing by the user, each cell in the table in the preset database may store a plurality of data information, and the table may also be transposed with respect to the row and column as required.
When the management server obtains a table to be transposed in a preset database, the number of initial data stored in each cell of each row of the table to be transposed needs to be determined, so as to perform corresponding row-column conversion.
In an embodiment, the table to be transposed includes a list name row, and a list name stored in each cell in the list name row is an initial column name of a column in which the cell is located.
The table splitting unit 102 is configured to invoke a preset splitting function to split each cell in each row of the table to be transposed into a plurality of sequentially arranged sub-cells, and sequentially and individually store all initial data in each cell in the corresponding sub-cell, so as to correspondingly obtain a first intermediate table, where the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split.
In this embodiment, the management server may call a preset splitting function, such as a Split function, and Split each cell in each row in the table to be transposed into a plurality of sequentially arranged sub-cells, that is, the arrangement order of the sub-cells may be determined according to the arrangement order of the initial data in each cell, so as to ensure that each sub-cell can store a corresponding initial data in order, and avoid confusion in the process of allocating the initial data. At this time, the split table is the first intermediate table, and meanwhile, the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split, so that the relevance between the data of different cells in the same row is further ensured, and the user can call and read the data conveniently.
In an embodiment, the table splitting unit 102 is specifically configured to call a preset Split function to Split each cell in each row of the table to be transposed into a plurality of sequentially arranged sub-cells, and sequentially and individually store all initial data in each cell in the corresponding sub-cell, so as to correspondingly obtain a first intermediate table. Wherein, the Split function is one of the splitting functions. Each cell of each row in the table to be transposed can be divided into a plurality of sub-cells which are sequentially arranged by calling a preset Split function.
A flag determining unit 103, configured to determine a number of initial data included in one of the cells in each row of the first intermediate table, so as to sequentially obtain, according to the determined number, a corresponding number of sequential flag bits from a preset sequential flag bit array in sequence, where the sequential flag bit array includes a plurality of sequentially arranged sequential flag bits, the sequential flag bits obtained for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequential flag bit obtained for the row.
In this embodiment, in order to allocate different sequence flag bits to each sub-cell, at this time, the management server needs to determine the amount of the initial data included in one of the cells in each row of the first intermediate table, that is, the amount of the initial data included in other cells in each row can be known by the amount of the initial data included in one of the cells in each row. Then, the management server may obtain, from the array of preset sequence flag bits, the same number of sequence flag bits as the number of initial data included in the cell of the row, where the obtained sequence flag bits need to be associated with the row.
The mark inserting unit 104 is configured to insert, according to the called preset mark function and the corresponding number of sequential mark bits associated with each row of the first intermediate table, the sequential mark bits acquired for one of the rows into the sequentially arranged sub-cells obtained by splitting each cell in the row, respectively in sequence.
In this embodiment, the management server may call a preset flag function, such as a Contact _ ws function, and insert a different sequence flag bit into each sequentially arranged sub-cell obtained by splitting each cell in each row, specifically, the sequence flag bit associated with each row is sequentially inserted into each sequentially arranged sub-cell belonging to the same cell in each row in the first intermediate table.
In an embodiment, as shown in fig. 5, the marker inserting unit 104 may include a first determining unit 201, a second determining unit 202, a third determining unit 203, and an inserting unit 204.
A first determining unit 201, configured to determine a corresponding number of sequential flag bits associated with each row of the first intermediate table. The management server may determine a corresponding number of sequential flag bits associated with all rows of the first intermediate table, so as to perform corresponding marking for the sub-cells.
A second determining unit 202, configured to run the called preset Contact _ ws function to determine a position order of the sub-cells arranged in order obtained by splitting each cell in each row, where the sub-cells corresponding to the cells in different rows respectively correspond to the sequence flag bits acquired for the row one by one in order. The management server can also run the called marking function (Contact _ ws function) and determine the position sequence of the sequenced sub-cells obtained by splitting each row, so as to insert the corresponding number of sequence marking bits associated with the row into different sub-cells in sequence.
A third determining unit 203, configured to determine, according to the position order of each sub-cell, a sequence flag bit matching the position order from the sequence flags acquired for the row.
An inserting unit 204, configured to insert the determined sequence flag bit into the sub-cell. Wherein the determined order flag bits matching the positional order of each sub-cell may be inserted into the sub-cells.
A row-column conversion unit 105, configured to invoke a preset lareral function to convert all sub-cells split from the same cell in each row of the first intermediate table into a column in which the cell is located in sequence, so as to obtain a target table having multiple columns arranged side by side, where the target table is associated with the table to be transposed, and the number of columns of the target table is the same as the number of columns of the table to be transposed.
In this embodiment, the management server may call and run a preset lareral function for automatic number attribution, and all sub-cells obtained by splitting the same cell in each row of the first intermediate table are converted into a column with the cell.
Referring to fig. 6, in response to the above-mentioned method for disordered row-column transposition, another embodiment of the present invention further provides a disordered row-column transposition apparatus, where the apparatus 300 includes: a table acquisition unit 301, a table splitting unit 302, a flag determination unit 303, a flag insertion unit 304, a row-column conversion unit 305, a table setting unit 306, and a table merging unit 307.
A table obtaining unit 301, configured to obtain a table to be transposed in a preset database, so as to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same.
In an embodiment, the table to be transposed includes a list name row, and a list name stored in each cell in the list name row is an initial column name of a column in which the cell is located.
The table splitting unit 302 is configured to invoke a preset splitting function to split each cell in each row of the table to be transposed into a plurality of sequentially arranged sub-cells, and sequentially and individually store all initial data in each cell in the corresponding sub-cell, so as to correspondingly obtain a first intermediate table, where the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split.
A mark determining unit 303, configured to determine the number of initial data included in one of the cells in each row of the first intermediate table, so as to sequentially obtain, according to the determined number, a corresponding number of sequential mark bits from a preset sequential mark bit array in sequence, where the sequential mark bit array includes a plurality of sequentially arranged sequential mark bits, the sequential mark bits obtained for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequential mark bit obtained for the row.
A flag inserting unit 304, configured to insert, according to the called preset flag function and the corresponding number of sequential flag bits associated with each row of the first intermediate table, the sequential flag bits acquired for one of the rows in sequence into the sequentially arranged sub-cells obtained by splitting each cell in the row.
A row-column conversion unit 305, configured to invoke a preset lareral function to convert all sub-cells split from the same cell in each row of the first intermediate table into a column in which the cell is located in sequence, so as to obtain a target table having multiple columns arranged side by side, where the target table is associated with the table to be transposed, and the number of columns of the target table is the same as the number of columns of the table to be transposed.
A table setting unit 306, configured to invoke a preset array function, sequentially group the sub-cells in all columns of the target table according to the sequence flag bits associated with each row in the table to be transposed and the sequence flag bits inserted into the sub-cells of the target table, and sequentially set the sub-cells located in the same group side by side in the arrangement order of the columns to be the same row, so as to obtain a second intermediate table, where the number of rows of the second intermediate table is the same as the number of rows of the table to be transposed, and each row is associated with the sequence flag bit acquired for the row.
In this embodiment, the management server can group the sub-cells in the columns in the target table and perform corresponding transposition of column-to-row by using a preset array function or the like, so as to obtain a second intermediate table, which is similar to the first intermediate table. If the target information is added into the sub-cells, the step converts the target table into a second intermediate table with the same format as the first intermediate table; if so, directly transpose to the first intermediate table.
The table merging unit 307 is configured to invoke a preset merging function to merge the sub-cells with different sequence flag bits arranged in sequence in each row into one cell, so as to obtain a converted table after merging and restoring.
In this embodiment, the management server may call a preset merge function to merge the sub-cells arranged in sequence in each row and having different sequence flag bits, that is, merge and restore the sub-cells originally split from the same cell to obtain a converted table after the merge and the restoration, where the converted table is a table that has been transposed and restored again, so as to facilitate subsequent storage and call of a user, increase availability of data in a preset database, and facilitate management and corresponding processing of the data.
In an embodiment, the table merging unit 307 may be specifically configured to call a preset coordinate function to merge the sub-cells with different sequence flag bits arranged in sequence in each row into one cell, so as to obtain a merged and restored converted table. Wherein, the merge function may be a Concatenate function.
In an embodiment, the apparatus 300 may further include the following units:
an information obtaining unit 308, configured to call a preset dictionary table to obtain, from the preset dictionary table, target information associated with each piece of initial data.
An information inserting unit 309, configured to insert the target information associated with each piece of initial data into the sub-cell in which the initial data is located.
In order to ensure the security performance of data storage, the initial data stored in the general cells are generally encrypted codes, and at this time, different data represented by different codes can be confirmed according to a preset dictionary table which is preset, so that the size of a table to be transposed is correspondingly reduced, and the data management is facilitated. Therefore, the management server can call the preset dictionary table, so as to determine the target information associated with each initial data, and insert the target information into the sub-cell where the initial data associated with the target information is located.
It should be noted that, as can be clearly understood by those skilled in the art, the specific implementation processes of the unordered row-column transposing device 100 and each unit may refer to the corresponding descriptions in the foregoing method embodiments, and for convenience and brevity of description, no further description is provided herein.
As can be seen from the above description, in terms of hardware implementation, the above table obtaining unit 101, the table splitting unit 102, the mark determining unit 103, the mark inserting unit 104, and the row-column converting unit 105 may be embedded in a device independent of the life insurance declaration in a hardware form, or may be stored in a memory of an unordered row-column transposing device in a software form, so that the processor calls to execute operations corresponding to the above units. The processor can be a Central Processing Unit (CPU), a microprocessor, a singlechip and the like.
The unordered row-column transposing means described above may be implemented in the form of a computer program which is executable on a computer device as shown in fig. 7.
FIG. 7 is a schematic diagram of a computer device according to the present invention. The device may be a server, where the server may be an independent server or a server cluster composed of a plurality of servers.
Referring to fig. 7, the computer device 400 includes a processor 402, a memory, an internal memory 404, and a network interface 405 connected by a system bus 401, wherein the memory may include a nonvolatile storage medium 403 and the internal memory 404.
The non-volatile storage medium 403 may store an operating system 4031 and a computer program 4032 that, when executed, may cause the processor 402 to perform a method of out-of-order row-column transpose.
The processor 402 is used to provide computing and control capabilities that support the operation of the overall computer device 400.
The memory 404 provides an environment for the operation of the computer program 4032 on the non-volatile storage medium 403, which when executed by the processor 402 causes the processor 402 to perform a method of out-of-order row-column transposition.
The network interface 405 is used for network communication with other devices. Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing device 400 to which the disclosed aspects apply, as a particular computing device 400 may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
Wherein the processor 402 is adapted to run a computer program 4032 stored in the memory to implement the steps of the unordered row and column transpose method described above.
It should be understood that in the embodiment of the present Application, the Processor 402 may be a Central Processing Unit (CPU), and the Processor 402 may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field-Programmable gate arrays (FPGAs) or other Programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It will be understood by those skilled in the art that all or part of the flow of the method implementing the above embodiments may be implemented by a computer program instructing associated hardware. The computer program may be stored in a storage medium, which is a computer-readable storage medium. The computer program is executed by at least one processor in the computer system to implement the flow steps of the embodiments of the method described above.
Accordingly, the present invention also provides a storage medium. The storage medium may be a computer-readable storage medium. The storage medium stores a computer program that, when executed by a processor, causes the processor to execute the steps of the unordered row-column transposing method described above.
The storage medium may be a usb disk, a removable hard disk, a Read-Only Memory (ROM), a magnetic disk, or an optical disk, which can store various computer readable storage media.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative. For example, the division of each unit is only one logic function division, and there may be another division manner in actual implementation. For example, various elements or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented.
The steps in the method of the embodiment of the invention can be sequentially adjusted, combined and deleted according to actual needs. The units in the device of the embodiment of the invention can be merged, divided and deleted according to actual needs. In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a terminal, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method of unordered line-row transposing, the method comprising:
acquiring a table to be transposed in a preset database to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same;
calling a preset splitting function to split each cell in each row in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell to correspondingly obtain a first intermediate table, wherein the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split;
determining the quantity of initial data included in one of the cells in each row of the first intermediate table, and sequentially acquiring a corresponding quantity of sequence mark bits from a preset sequence mark bit array according to the determined quantity, wherein the sequence mark bit array comprises a plurality of sequentially arranged sequence mark bits, the sequence mark bits acquired for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequence mark bit acquired for the row;
according to the called preset marking function and the corresponding number of sequence marking bits associated with each row of the first intermediate table, sequentially and respectively inserting the sequence marking bits acquired aiming at one row into the sub-cells which are obtained by splitting each cell in the row and are arranged in sequence;
and calling a preset Lateral function to convert all the sub-cells obtained by splitting the same cell in each row of the first intermediate table into the column of the cell in sequence to obtain a target table with a plurality of columns arranged side by side, wherein the target table is associated with the table to be transposed, and the number of the columns of the target table is the same as that of the table to be transposed.
2. The method of claim 1, wherein the table to be transposed comprises a list name row, and a list name stored in each cell in the list name row is an initial column name of a column in which the cell is located.
3. The method according to claim 1, wherein the step of calling a preset splitting function to split each cell of each row in the table to be transposed into a plurality of sequentially arranged sub-cells, and sequentially and individually storing all initial data in each cell in the corresponding sub-cell to correspondingly obtain a first intermediate table comprises:
and calling a preset Split function to divide each cell in each row in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell so as to correspondingly obtain a first intermediate table.
4. The method according to claim 1, wherein the step of sequentially inserting the sequential flag bits obtained for one row into the sequentially arranged sub-cells split from each cell in the row according to the called preset flag function and the corresponding number of sequential flag bits associated with each row of the first intermediate table comprises:
determining a respective number of sequential flag bits associated with each row of the first intermediate table;
running the called preset Contact _ ws function to determine the position sequence of the sub-cells which are obtained by splitting each cell in each row and are arranged in sequence, wherein the sub-cells corresponding to the cells in different rows respectively correspond to the sequence marking bits acquired for the row one by one in sequence;
according to the position sequence of each sub-cell, determining a sequence marking bit matched with the position sequence of the sub-cell from the sequence marks acquired for the row;
inserting the determined sequential flag bits into the sub-cells.
5. The method of claim 1, wherein the method further comprises:
calling a preset Array function, sequentially grouping the sub-cells in all columns of the target table according to the sequence marking bits associated with each row in the table to be transposed and the sequence marking bits inserted into the sub-cells of the target table, and sequentially setting the sub-cells in the same group side by side to be the same row according to the arrangement sequence of the rows to obtain a second intermediate table, wherein the number of the rows of the second intermediate table is the same as the number of the rows of the table to be transposed, and each row is associated with the sequence marking bit acquired for the row;
and calling a preset merging function to merge the sub-cells with different sequence marking bits arranged in sequence in each row into one cell so as to obtain a converted table after merging and restoration.
6. The method of claim 5, wherein the step of invoking a predetermined merge function to merge the sequentially arranged sub-cells with different sequence flag bits in each row into one cell to obtain a merged restored converted table comprises:
and calling a preset coordinate function to merge the sub-cells with different sequence marking bits arranged in sequence in each row into one cell so as to obtain the converted table after merging and restoring.
7. The method of claim 5, wherein the step of calling the preset Lateral function to sequentially convert all sub-cells in each row of the first intermediate table, which are split from the same cell, into the column of the cell, so as to obtain the target table having a plurality of columns arranged side by side, comprises:
calling a preset dictionary table to acquire target information associated with each initial data from the preset dictionary table;
and inserting the target information associated with each initial data into the sub-cell in which the initial data is positioned.
8. An unordered row-column transposing apparatus, comprising:
the table acquiring unit is used for acquiring a table to be transposed in a preset database so as to determine the number of initial data included in each cell of each row of the table to be transposed; each row of the table to be transposed comprises a plurality of cells, each cell comprises a plurality of initial data stored in sequence, and the number of the initial data contained in different cells in the same row is the same;
the table splitting unit is used for calling a preset splitting function to split each cell in each row in the table to be transposed into a plurality of sub-cells which are sequentially arranged, and sequentially and independently storing all initial data in each cell in the corresponding sub-cell to correspondingly obtain a first intermediate table, wherein the number of the initial data included in each cell is the same as the number of the sub-cells obtained after the cell is split;
a flag determining unit, configured to determine a number of initial data included in one of the cells in each row of the first intermediate table, so as to sequentially acquire a corresponding number of sequential flag bits from a preset sequential flag bit array according to the determined number, where the sequential flag bit array includes a plurality of sequentially arranged sequential flag bits, the sequential flag bits acquired for different rows are different, and each row of the first intermediate table or the table to be transposed is associated with the sequential flag bit acquired for the row;
the mark inserting unit is used for respectively inserting the sequence mark bits acquired aiming at one row into the sub-cells which are obtained by splitting each cell in the row and are arranged in sequence according to the called preset mark function and the corresponding number of sequence mark bits associated with each row of the first intermediate table;
a row-column conversion unit, configured to invoke a preset lareral function to convert all sub-cells split from the same cell in each row of the first intermediate table into a column in which the cell is located in sequence, so as to obtain a target table having multiple columns arranged side by side, where the target table is associated with the table to be transposed, and the number of columns of the target table is the same as the number of columns of the table to be transposed.
9. A computer arrangement, characterized in that the computer arrangement comprises a memory having stored thereon a computer program and a processor implementing the method according to any of claims 1-7 when executing the computer program.
10. A computer-readable storage medium, characterized in that the storage medium stores a computer program which, when executed by a processor, causes the processor to carry out the method according to any one of claims 1-7.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910750717.0A CN110688826B (en) | 2019-08-14 | 2019-08-14 | Disorder rank transposition method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910750717.0A CN110688826B (en) | 2019-08-14 | 2019-08-14 | Disorder rank transposition method, device, computer equipment and storage medium |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110688826A true CN110688826A (en) | 2020-01-14 |
CN110688826B CN110688826B (en) | 2023-07-25 |
Family
ID=69108245
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910750717.0A Active CN110688826B (en) | 2019-08-14 | 2019-08-14 | Disorder rank transposition method, device, computer equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110688826B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112686011A (en) * | 2020-12-30 | 2021-04-20 | 武汉联影医疗科技有限公司 | Table unit group interchange method and device, computer equipment and storage medium |
CN113971993A (en) * | 2021-10-22 | 2022-01-25 | 浙江太美医疗科技股份有限公司 | Clinical test data conversion method and device, computer equipment and storage medium |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120173226A1 (en) * | 2010-12-30 | 2012-07-05 | International Business Machines Corporation | Table merging with row data reduction |
US20150039984A1 (en) * | 2013-07-31 | 2015-02-05 | Hitachi, Ltd. | Table format multi-dimensional data translation method and device |
CN109241514A (en) * | 2018-09-10 | 2019-01-18 | 深圳市泰洲科技有限公司 | Data automatically imported method, device, computer equipment and storage medium |
CN109299450A (en) * | 2018-10-31 | 2019-02-01 | 上海用天网络科技有限公司 | Dynamic statement method for exhibiting data in a kind of business management software |
-
2019
- 2019-08-14 CN CN201910750717.0A patent/CN110688826B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120173226A1 (en) * | 2010-12-30 | 2012-07-05 | International Business Machines Corporation | Table merging with row data reduction |
US20150039984A1 (en) * | 2013-07-31 | 2015-02-05 | Hitachi, Ltd. | Table format multi-dimensional data translation method and device |
CN109241514A (en) * | 2018-09-10 | 2019-01-18 | 深圳市泰洲科技有限公司 | Data automatically imported method, device, computer equipment and storage medium |
CN109299450A (en) * | 2018-10-31 | 2019-02-01 | 上海用天网络科技有限公司 | Dynamic statement method for exhibiting data in a kind of business management software |
Non-Patent Citations (1)
Title |
---|
范莉娅;肖田元;: "自动获取HTML表格语义层次结构方法", 清华大学学报(自然科学版), no. 10 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112686011A (en) * | 2020-12-30 | 2021-04-20 | 武汉联影医疗科技有限公司 | Table unit group interchange method and device, computer equipment and storage medium |
CN113971993A (en) * | 2021-10-22 | 2022-01-25 | 浙江太美医疗科技股份有限公司 | Clinical test data conversion method and device, computer equipment and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CN110688826B (en) | 2023-07-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110008744B (en) | Data desensitization method and related apparatus | |
CN110688826A (en) | Disordered row-column transposition method and device, computer equipment and storage medium | |
US8082233B2 (en) | Comparing data sets through identification of matching blocks | |
Frousios et al. | REAL: an efficient REad ALigner for next generation sequencing reads | |
CN110781183A (en) | Method and device for processing incremental data in Hive database and computer equipment | |
CN114298039B (en) | Sensitive word recognition method and device, electronic equipment and storage medium | |
CN112269665B (en) | Memory processing method and device, electronic equipment and storage medium | |
CN109634912A (en) | Data migration method and system | |
CN113986828A (en) | Method and device for storing mass files, electronic equipment and storage medium | |
US20220157401A1 (en) | Method and system for mapping read sequences using a pangenome reference | |
CN112232025A (en) | Character string storage method and device and electronic equipment | |
CN107748705B (en) | Method for recovering system EVT log fragments, terminal equipment and storage medium | |
CN113703753B (en) | Method and device for product development and product development system | |
CN113704309B (en) | Graph data processing method, device, computer equipment and storage medium | |
US11709856B2 (en) | Data mapper tool | |
CN116185374A (en) | Method, device, electronic equipment and storage medium for acquiring code base dependency relationship | |
CN115208881A (en) | Block chain consensus method, equipment and storage medium | |
CN114461672A (en) | Data retrieval method and device, computer equipment and storage medium | |
CN112329424A (en) | Service data processing method and device, storage medium and electronic equipment | |
CN111538750A (en) | Information restoration method and device, computer system and readable storage medium | |
CN110457323A (en) | The processing method and processing device of tables of data | |
CN114117187B (en) | Data query method and related device | |
CN102193967B (en) | The relatively value of bounded domain | |
CN111427893B (en) | Json data storage method, json data storage device, computer equipment and storage medium | |
CN118296187A (en) | Data structure construction method, device and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |