CN104268294B - File is imported to the method and device of database - Google Patents
File is imported to the method and device of database Download PDFInfo
- Publication number
- CN104268294B CN104268294B CN201410575267.3A CN201410575267A CN104268294B CN 104268294 B CN104268294 B CN 104268294B CN 201410575267 A CN201410575267 A CN 201410575267A CN 104268294 B CN104268294 B CN 104268294B
- Authority
- CN
- China
- Prior art keywords
- linked list
- file
- determining
- linked
- database
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000012545 processing Methods 0.000 claims description 14
- 230000008676 import Effects 0.000 claims description 9
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 230000006835 compression Effects 0.000 abstract 1
- 238000007906 compression Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 9
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000013523 data management Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Abstract
A kind of method and device that file is imported to database provided in an embodiment of the present invention, establish at least one chained list, the file received is converted into data flow, and data flow is mounted in chained list, when reaching the importing cycle, by the gauge outfit of the data flow carry of highest priority in each chained list to chained list；Storage is into database after the stream compression of each chained list gauge outfit is changed into the first data that database can identify.By the method and device provided in an embodiment of the present invention that file is imported to database, user can be that vital document assigns high priority, so as to which the file of high priority is preferentially imported in database, improve the efficiency that vital document is imported to database.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a method and a device for importing files into a database.
Background
In the data management of the bank e-commerce platform, a great variety of original data are stored in a file form (such as excel, txt, and the like), and in order to perform later analysis processing on the data, find out the connection between the data and mine more valuable information, the original data need to be processed. However, if the file is directly processed, the efficiency is very low in the case where the file amount is large. And the efficiency of processing the data in the database is much higher than that of directly processing the file. Therefore, the data in the file needs to be imported into the database.
However, in the process of implementing the present invention, the inventor finds that, at present, when a file is imported into a database, the file to be imported is input into a queue, and the files are imported into the database one by one according to the sequence of the queue.
Disclosure of Invention
The invention aims to provide a method and a device for importing files into a database, so as to improve the efficiency of importing important files into the database.
In order to achieve the above purpose, the embodiment of the present invention provides the following technical solutions:
a method of importing a file into a database, comprising:
when a first file is received, converting the received first file into a first data stream, wherein the first data stream comprises an identification mark of the first file, priority information of the first file and content of the first file;
determining a target linked list corresponding to the first file in at least one pre-established linked list;
mounting the first data stream into the target linked list;
when the import period is reached, mounting the data stream with the highest priority in each linked list to the head of the linked list;
and converting the data stream of each linked list head into data which can be identified by the database and then storing the data stream into the database.
Preferably, the determining, in the at least one pre-established linked list, the target linked list corresponding to the first file includes:
and determining the linked list with the minimum load capacity in the at least one linked list as a target linked list corresponding to the first file.
The above method, preferably, when there are at least two linked lists with the minimum load amount,
determining the highest priority in the linked list with the minimum load;
and determining the linked list with the highest priority smaller than the priority of the first file from the at least two linked lists with the minimum load capacity as a target linked list corresponding to the first file.
Preferably, the determining, in the at least one pre-established linked list, the target linked list corresponding to the first file includes:
determining the highest priority in each linked list;
and determining the linked list with the highest priority lower than the priority of the first file in the at least one linked list as a target linked list corresponding to the first file.
Preferably, in the method, when there are at least two linked lists with the same highest priority, the linked list with the smallest load is determined to be the target linked list corresponding to the first file from the at least two linked lists with the same highest priority.
An apparatus for importing a file into a database, comprising:
the conversion module is used for converting the received first file into a first data stream when the first file is received, wherein the first data stream comprises an identification mark of the first file, priority information of the first file and content of the first file;
the determining module is used for determining a target linked list corresponding to the first file in at least one pre-established linked list;
the mounting module is used for mounting the first data stream into the target linked list;
the linked list processing module is used for mounting the data stream with the highest priority in each linked list to the head of the linked list when the import period is reached;
and the storage module is used for converting the data stream of each linked list head into data which can be identified by the database and then storing the data in the database.
The above apparatus, preferably, the determining module includes:
and the first determining submodule is used for determining the linked list with the minimum load quantity in the at least one linked list as the target linked list corresponding to the first file.
Preferably, in the apparatus, when there are at least two linked lists with the minimum load, the first determining submodule includes:
the first determining unit is used for determining the highest priority in the linked list with the minimum load;
and a second determining unit, configured to determine, from the at least two linked lists with the smallest load amount, that a linked list with a highest priority that is lower than the priority of the first file is a target linked list corresponding to the first file.
The above apparatus, preferably, the determining module includes:
the second determining submodule is used for determining the highest priority in each linked list;
and the third determining submodule is used for determining the linked list with the highest priority lower than the priority of the first file in the at least one linked list as the target linked list corresponding to the first file.
Preferably, when there are at least two linked lists with the same highest priority, the third determining submodule includes:
and the third determining unit is used for determining the linked list with the minimum load as the target linked list corresponding to the first file from the at least two linked lists with the same highest priority.
According to the scheme, the method and the device for importing the file into the database provided by the embodiment of the invention have the advantages that at least one linked list is established, the received file is converted into the data stream, the data stream is mounted into the linked list, and when the import period is reached, the data stream with the highest priority in each linked list is mounted to the head of the linked list; and converting the data stream of each linked list header into first data which can be identified by the database and then storing the first data into the database. By the method and the device for importing the files into the database, provided by the embodiment of the invention, a user can give high priority to the important files, so that the files with high priority can be preferentially imported into the database, and the efficiency of importing the important files into the database is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flowchart of an implementation of a method for importing a file into a database according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating an implementation of determining a target linked list corresponding to a first file in at least one pre-established linked list according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of an apparatus for importing a file into a database according to an embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a linked list processing module according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a determining module according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a first determining submodule provided in the embodiment of the present invention;
fig. 7 is another schematic structural diagram of a determining module according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a third determining submodule provided in the 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 only a part of the embodiments of the present invention, and not all of the embodiments. 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.
Referring to fig. 1, fig. 1 is a flowchart of an implementation of a method for importing data into a database according to an embodiment of the present invention, where the method includes:
step S11: when a first file is received, converting the received first file into a first data stream, wherein the first data stream comprises an identification mark of the first file, priority information of the first file and content of the first file;
in the embodiment of the invention, when the file is imported with data, the file to be imported is converted into the data stream and transmitted in the form of the data stream.
The first file is any file to be imported into the database.
Step S12: determining a target linked list corresponding to the first file in at least one pre-established linked list;
in the embodiment of the invention, at least one linked list is established in advance, and the number of the linked lists can be determined according to the actual situation. For example, if the file is imported in the peak period, more linked lists can be established, and if the amount of files to be imported into the database is less, less linked lists can be established. When the file volume to be imported into the database is less than a certain value, only one linked list can be established.
Specifically, the time of day may be divided into a number of time periods, each time period being a linked list number. If a certain time period is reached, the number of required linked lists can be determined according to the time period. The number of linked lists corresponding to each time period can be determined by statistics.
Of course, the number of linked lists corresponding to each time segment is not constant, and may be changed according to actual situations. For example, when the number of files to be imported is greatly reduced, the number of linked lists can be reduced; similarly, when the number of files to be imported is increased greatly, the number of linked lists can be increased.
When the number of the linked lists needs to be changed, if the number of the linked lists needs to be increased, a plurality of linked lists can be newly built as required, and if the number of the linked lists needs to be reduced, each data stream in the existing first linked list can be mounted into the existing second linked list, so that the number of the linked lists is reduced.
Step S13: mounting the first data stream into the target linked list;
step S14: when the import period is reached, mounting the data stream with the highest priority in each linked list to the head of the linked list;
step S15: and converting the data stream of each linked list head into data which can be identified by the database and then storing the data stream into the database.
In the embodiment of the invention, the data stream with the highest priority mounted in the linked list is mounted to the head of the linked list according to the period, and the data stream at the head of the linked list is converted into the data which can be identified by the database and then stored in the database. Assuming that the first data stream is mounted at the head of the target linked list in a certain period, the first data stream is converted into data which can be identified by the database and then stored in the database, so that the first file is imported into the database.
It should be noted that, in the embodiment of the present invention, the execution sequence of the process of mounting the first file to the linked list (and the step S11 to the step S13) and the process of storing the data stream from the linked list to the database (the step S14 to the step S15) is not specifically limited, that is, the process of storing the data stream from the linked list to the database may be executed in the process of mounting the first file to the linked list, may be executed after the process of mounting the first file to the linked list is completed, or may be executed before the process of mounting the first file to the linked list is executed.
The method for importing the file into the database provided by the embodiment of the invention comprises the steps of establishing at least one linked list, converting the received file into a data stream, mounting the data stream into the linked list, and mounting the data stream with the highest priority in each linked list to the head of the linked list when the import period is reached; and converting the data stream of each linked list header into first data which can be identified by the database and then storing the first data into the database. By the method and the device for importing the files into the database, provided by the embodiment of the invention, a user can give high priority to the important files, so that the files with high priority can be preferentially imported into the database, and the efficiency of importing the important files into the database is improved.
In addition, in the embodiment of the invention, when a plurality of linked lists exist, the data stream with the highest priority in each linked list can be mounted to the head of each linked list, so that the parallel processing of the data stream is realized, and the efficiency of importing the file into the database is improved.
In the above embodiment, optionally, the first data stream may further include a time when the first file is received; further, in the above-mentioned case,
when there are at least two data flows with the highest priority in the first linked list of the at least one linked list, the data flow with the earliest receiving time in the at least two data flows with the highest priority may be mounted to the head of the first linked list.
In the foregoing embodiment, optionally, the determining, in the at least one pre-established linked list, the target linked list corresponding to the first file may include:
and determining the linked list with the minimum load capacity in the at least one linked list as a target linked list corresponding to the first file.
The load of the linked list refers to the maximum number of data streams that can be mounted under the linked list.
Optionally, when there are at least two linked lists with the minimum load,
the highest priority in the linked list with the minimum load can be determined;
and for each linked list with the minimum load capacity, determining the highest priority of the mounted flow in the linked list with the minimum load capacity.
And determining the linked list with the highest priority smaller than the priority of the first file from the at least two linked lists with the minimum load capacity as a target linked list corresponding to the first file.
That is, after the first data stream is mounted in the target linked list, the first data stream has the highest priority in the target linked list.
Optionally, when there are at least two linked lists with the highest priority lower than the priority of the first file, one linked list with the smallest number of data streams whose receiving time is earlier than the receiving time of the first file in the at least two linked lists with the highest priority lower than the priority of the first file may be used as the target linked list corresponding to the first file.
Optionally, when there are at least two linked lists with the smallest number of data streams whose receiving time is earlier than the receiving time of the first file, a linked list may be randomly determined from the at least two linked lists with the smallest number of data streams whose receiving time is earlier than the receiving time of the first file as the target linked list corresponding to the first file.
In the foregoing embodiment, optionally, the flowchart of determining, in at least one pre-established linked list, a target linked list corresponding to the first file is shown in fig. 2, and may include:
step S21: determining the highest priority in each linked list;
step S22: and determining the linked list with the highest priority lower than the priority of the first file in the at least one linked list as a target linked list corresponding to the first file.
That is, after the first data flow is mounted in the target linked list, the priority of the first data flow is the highest.
Optionally, when there are at least two linked lists with the same highest priority, the linked list with the minimum load is determined to be the target linked list corresponding to the first file from the at least two linked lists with the same highest priority.
Optionally, when there are at least two linked lists with the minimum load capacity, one linked list with the minimum number of data streams whose receiving time is earlier than the receiving time of the first file in the at least two linked lists with the minimum load capacity may be used as the target linked list corresponding to the first file.
Optionally, when there are at least two linked lists with the smallest number of data streams whose receiving time is earlier than the receiving time of the first file, one linked list may be randomly determined as the target linked list corresponding to the first file from the linked lists with the smallest number of data streams whose receiving time is earlier than the receiving time of the first file.
Corresponding to the method embodiment, an embodiment of the present invention further provides a device for importing a file into a database, and a schematic structural diagram of the device for importing a file into a database provided in the embodiment of the present invention is shown in fig. 3, and may include:
the system comprises a conversion module 31, a determination module 32, a mounting module 33, a linked list processing module 34 and a storage module 35; wherein,
the conversion module 31 is configured to, when a first file is received, convert the received first file into a first data stream, where the first data stream includes an identification of the first file, priority information of the first file, and content of the first file;
in the embodiment of the invention, when the file is imported with data, the file to be imported is converted into the data stream and transmitted in the form of the data stream.
The determining module 32 is configured to determine a target linked list corresponding to the first file in at least one pre-established linked list;
in the embodiment of the invention, at least one linked list is established in advance, and the number of the linked lists can be determined according to the actual situation. For example, if the file is imported in the peak period, more linked lists can be established, and if the amount of files to be imported into the database is less, less linked lists can be established. When the file volume to be imported into the database is less than a certain value, only one linked list can be established.
Specifically, the time of day may be divided into a number of time periods, each time period being a linked list number. If a certain time period is reached, the number of required linked lists can be determined according to the time period. The number of linked lists corresponding to each time period can be determined by statistics.
Of course, the number of linked lists corresponding to each time segment is not constant, and may be changed according to actual situations. For example, when the number of files to be imported is greatly reduced, the number of linked lists can be reduced; similarly, when the number of files to be imported is increased greatly, the number of linked lists can be increased.
When the number of the linked lists needs to be changed, if the number of the linked lists needs to be increased, a plurality of linked lists can be newly built as required, and if the number of the linked lists needs to be reduced, each data stream in the existing first linked list can be mounted into the existing second linked list, so that the number of the linked lists is reduced.
The mounting module 33 is configured to mount the first data stream into the target linked list;
the linked list processing module 34 is configured to mount, to the head of each linked list, a data stream with the highest priority in each linked list when the import period is reached;
the storage module 35 is configured to convert the data stream at the head of each linked list into data that can be identified by the database, and store the data in the database.
In the embodiment of the invention, the data stream with the highest priority mounted in the linked list is mounted to the head of the linked list according to the period, and the data stream at the head of the linked list is converted into the data which can be identified by the database and then stored in the database. Assuming that the first data stream is mounted at the head of the target linked list in a certain period, the first data stream is converted into data which can be identified by the database and then stored in the database, so that the first file is imported into the database.
The device for importing the file into the database provided by the embodiment of the invention establishes at least one linked list, converts the received file into the data stream, mounts the data stream into the linked list, and mounts the data stream with the highest priority in each linked list to the head of the linked list when the import period is reached; and converting the data stream of each linked list header into first data which can be identified by the database and then storing the first data into the database. By the method and the device for importing the files into the database, provided by the embodiment of the invention, a user can give high priority to the important files, so that the files with high priority can be preferentially imported into the database, and the efficiency of importing the important files into the database is improved.
In addition, in the embodiment of the invention, when a plurality of linked lists exist, the data stream with the highest priority in each linked list can be mounted to the head of each linked list, so that the parallel processing of the data stream is realized, and the efficiency of importing the file into the database is improved.
In the above embodiment, optionally, the first data stream may further include a time when the first file is received; further, when there are at least two data flows with the highest priority in the first linked list of the at least one linked list, a structural diagram of the linked list processing module 34 is shown in fig. 4, and may include:
the first linked list processing sub-module 41 is configured to mount, to the head of the first linked list, the data stream with the earliest receiving time among the at least two data streams with the highest priority.
In the foregoing embodiment, optionally, a schematic structural diagram of the determining module 32 is shown in fig. 5, and may include:
the first determining submodule 51 is configured to determine, as the target linked list corresponding to the first file, the linked list with the smallest load amount in the at least one linked list.
The load of the linked list refers to the maximum number of data streams that can be mounted under the linked list.
Optionally, when there are at least two linked lists with the minimum load, a schematic structural diagram of the first determining submodule 51 is shown in fig. 6, and may include:
a first determining unit 61, configured to determine a highest priority in a linked list with a smallest load amount;
and for each linked list with the minimum load capacity, determining the highest priority of the mounted flow in the linked list with the minimum load capacity.
A second determining unit 62, configured to determine, from the at least two linked lists with the smallest load amounts, that a linked list with a highest priority smaller than the priority of the first file is a target linked list corresponding to the first file.
That is, after the first data stream is mounted in the target linked list, the first data stream has the highest priority in the target linked list.
Optionally, when there are at least two linked lists with the highest priority lower than the priority of the first file, the second determining unit 62 may be specifically configured to use, from the at least two linked lists with the highest priority lower than the priority of the first file, a linked list with the smallest number of data streams whose receiving time is earlier than the receiving time of the first file as the target linked list corresponding to the first file.
Optionally, when there are at least two linked lists with the minimum number of data streams whose receiving time is earlier than the receiving time of the first file, the second determining unit 62 may be specifically configured to randomly determine one linked list as the target linked list corresponding to the first file from the at least two linked lists with the minimum number of data streams whose receiving time is earlier than the receiving time of the first file.
In the foregoing embodiment, optionally, another schematic structural diagram of the determining module 32 is shown in fig. 7, and may include:
a second determining submodule 71, configured to determine a highest priority in each linked list;
a third determining submodule 72, configured to determine, in the at least one linked list, that a linked list with a highest priority that is lower than the priority of the first file is a target linked list corresponding to the first file.
That is, after the first data flow is mounted in the target linked list, the priority of the first data flow is the highest.
Optionally, when there are at least two linked lists with the same highest priority, a schematic structural diagram of the third determining submodule 72 is shown in fig. 8, and may include:
the third determining unit 81 is configured to determine, from the at least two linked lists with the same highest priority, that the linked list with the smallest load is the target linked list corresponding to the first file.
Optionally, when there are at least two linked lists with the minimum load, the third determining unit 81 may be specifically configured to use, as the target linked list corresponding to the first file, one linked list with the minimum number of data streams, of the at least two linked lists with the minimum load, whose receiving time is earlier than the receiving time of the first file.
Optionally, when there are at least two linked lists with the minimum number of data streams whose receiving time is earlier than the receiving time of the first file, the third determining unit 81 may be specifically configured to randomly determine one linked list as the target linked list corresponding to the first file from the at least two linked lists with the minimum number of data streams whose receiving time is earlier than the receiving time of the first file.
In the bank e-commerce platform, for the merchants of B2C and B2B, a large amount of excel files related to customer data and product information are generated every day, and especially when a promotion event or a statement statistic is performed, the number of the excel files is larger, and these file resources can be imported into the database by the method or the device for importing files into the database provided by the embodiment of the invention.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. 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.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, and for example, the division of the units is only one type of logical function division, and other division manners may be available in actual implementation, for example, a plurality of units or components may be combined or integrated into another device, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
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 previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method for importing a file into a database, comprising:
when a first file is received, converting the received first file into a first data stream, wherein the first data stream comprises an identification mark of the first file, priority information of the first file and content of the first file;
determining a target linked list corresponding to the first file in at least one pre-established linked list;
mounting the first data stream into the target linked list;
when the import period is reached, mounting the data stream with the highest priority in each linked list to the head of the linked list;
and converting the data stream of each linked list head into data which can be identified by the database and then storing the data stream into the database.
2. The method of claim 1, wherein determining a target linked list corresponding to the first file in the pre-established at least one linked list comprises:
and determining the linked list with the minimum load capacity in the at least one linked list as a target linked list corresponding to the first file.
3. The method of claim 2, wherein when there are at least two linked lists with a minimum load,
determining the highest priority in the linked list with the minimum load;
and determining the linked list with the highest priority smaller than the priority of the first file from the at least two linked lists with the minimum load capacity as a target linked list corresponding to the first file.
4. The method of claim 1, wherein determining a target linked list corresponding to the first file in the pre-established at least one linked list comprises:
determining the highest priority in each linked list;
and determining the linked list with the highest priority lower than the priority of the first file in the at least one linked list as a target linked list corresponding to the first file.
5. The method according to claim 4, wherein when there are at least two linked lists with the same highest priority, the linked list with the smallest load is determined as the target linked list corresponding to the first file from the at least two linked lists with the same highest priority.
6. An apparatus for importing a file into a database, comprising:
the conversion module is used for converting the received first file into a first data stream when the first file is received, wherein the first data stream comprises an identification mark of the first file, priority information of the first file and content of the first file;
the determining module is used for determining a target linked list corresponding to the first file in at least one pre-established linked list;
the mounting module is used for mounting the first data stream into the target linked list;
the linked list processing module is used for mounting the data stream with the highest priority in each linked list to the head of the linked list when the import period is reached;
and the storage module is used for converting the data stream of each linked list head into data which can be identified by the database and then storing the data in the database.
7. The apparatus of claim 6, wherein the determining module comprises:
and the first determining submodule is used for determining the linked list with the minimum load quantity in the at least one linked list as the target linked list corresponding to the first file.
8. The apparatus of claim 7, wherein when there are at least two linked lists with the smallest load, the first determining sub-module comprises:
the first determining unit is used for determining the highest priority in the linked list with the minimum load;
and a second determining unit, configured to determine, from the at least two linked lists with the smallest load amount, that a linked list with a highest priority that is lower than the priority of the first file is a target linked list corresponding to the first file.
9. The apparatus of claim 6, wherein the determining module comprises:
the second determining submodule is used for determining the highest priority in each linked list;
and the third determining submodule is used for determining the linked list with the highest priority lower than the priority of the first file in the at least one linked list as the target linked list corresponding to the first file.
10. The apparatus of claim 9, wherein when there are at least two of the highest priority identical linked lists, the third determining submodule comprises:
and the third determining unit is used for determining the linked list with the minimum load as the target linked list corresponding to the first file from the at least two linked lists with the same highest priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410575267.3A CN104268294B (en) | 2014-10-24 | File is imported to the method and device of database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410575267.3A CN104268294B (en) | 2014-10-24 | File is imported to the method and device of database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104268294A CN104268294A (en) | 2015-01-07 |
| CN104268294B true CN104268294B (en) | 2018-02-09 |
Family
ID=
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102411634A (en) * | 2011-12-27 | 2012-04-11 | 北京人大金仓信息技术股份有限公司 | Data storage method for improving instantaneity of embedded type database |
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102411634A (en) * | 2011-12-27 | 2012-04-11 | 北京人大金仓信息技术股份有限公司 | Data storage method for improving instantaneity of embedded type database |
Non-Patent Citations (2)
| Title |
|---|
| 数据从文件导入数据库过程的实现与分析;张志强等;《成都大学学报（自然科学版）》;20060331;第25卷(第1期);第63页第1、2章节 * |
| 用无序双向循环链表实现学生作业优先级操作，把新来的作业插入到表头或表尾 如满意再追加40哦！！！！！;鹏鹏吧、520;《百度知道》;20111230;最佳答案宏定义部分和第（5）部分代码 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109271411B (en) | Report generation method, report generation device, computer equipment and storage medium | |
| CN105468626B (en) | data processing method and system | |
| CN110602214B (en) | Evidence storing and processing method, device, equipment and medium of judicial chain | |
| US20080086557A1 (en) | Network service provider platform for supporting usage sensitive billing and operation services | |
| CN102063498B (en) | Link de-duplication processing method and device based on content and feature information | |
| US20170142454A1 (en) | Third-party video pushing method and system | |
| WO2012112460A3 (en) | Offer insertion system | |
| CN108881393B (en) | Data issuing method, device, computer and storage medium | |
| CN107220376B (en) | Data query method and device | |
| CN112702228B (en) | Service flow limit response method, device, electronic equipment and readable storage medium | |
| CN109359109B (en) | Data processing method and system based on distributed stream computing | |
| CN111176756A (en) | Data acquisition method and device, computer readable storage medium and electronic equipment | |
| CN110008173A (en) | A kind of method and device of data storage | |
| CN111800292A (en) | Early warning method and device based on historical flow, computer equipment and storage medium | |
| CN106126721A (en) | The data processing method of a kind of real-time calculating platform and device | |
| CN105224418A (en) | A kind of data back up method and device | |
| CN109862052A (en) | Call method, device, computer equipment and the storage medium of service request | |
| CN104268294B (en) | File is imported to the method and device of database | |
| CN106708869B (en) | Group data processing method and device | |
| CN111274017B (en) | Resource processing method and device, electronic equipment and storage medium | |
| CN109740130B (en) | Method and device for generating file | |
| CN104268294A (en) | Method and device for importing files into database | |
| CN113553518A (en) | Resource identifier generation method, device, equipment and storage medium | |
| CN116382916A (en) | Resource scheduling method and system for cloud computer computing power cluster and electronic equipment | |
| CN104077422A (en) | Repeated APK removing method and device in APK downloading |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |