CN106897409A - Data point library storage method and device - Google Patents
Data point library storage method and device Download PDFInfo
- Publication number
- CN106897409A CN106897409A CN201710084576.4A CN201710084576A CN106897409A CN 106897409 A CN106897409 A CN 106897409A CN 201710084576 A CN201710084576 A CN 201710084576A CN 106897409 A CN106897409 A CN 106897409A
- Authority
- CN
- China
- Prior art keywords
- target data
- database
- identification code
- data
- class
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
- G06F18/241—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Bioinformatics & Computational Biology (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Software Systems (AREA)
- Databases & Information Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of data point stock's method for storing, and the target data of library storage to be divided is obtained first；Then the corresponding class of the target data is determined using default sorting algorithm；Finally by target data storage to the corresponding database of the class, point library storage to the target data is completed.Compared to prior art, the application only needs to calculate the class for determining target data, you can by target data storage to the corresponding database of the class.Method is simple, and the subsidiary classifications such as new id can not be introduced during Fen Ku, so as to realize point library storage in the case where not increasing former target data storage size or not needing extra memory space, taken compared to prior art memory space less, in addition, the application realizes a point storehouse by the way of class and database are associated, therefore in data-base capacity-enlarging or Data Migration, simple realization by only needing to increase corresponding class or changing the associating of class and database, is easy to extension dilatation.
Description
Technical field
The present invention relates to database technical field, and in particular to a kind of data point library storage method and device.
Background technology
With information-based popularization, the business that information system is carried is more and more, it is necessary to the data of storage are also more and more.
Because the resource (CPU, disk, internal memory, IO, bandwidth) of single server is limited, hold very much in the storage of data and using upper
Easily reach bottleneck.
The storage of more data is completed with more server combinations and using being a kind of currently valid solution,
Point storehouse of database point table technology is arisen at the historic moment.
The storehouse strategy that is divided to common in the art has two kinds：
A kind of is that, based on the int strategies from increasing, its advantage is：Data storage digit is few, as database key performance table
Now good, point storehouse strategy is easily；Have the disadvantage：Need single id server, system complexity is high, there is performance bottleneck, data are divided
There is risk in removal shifting.
Another kind is that, based on UUID strategies, its advantage is：It is easy that id will not be repeated, data tear storage capacity open；Have the disadvantage：Data storage
Digit is more, compared with accounting for, storage area, insertion performance be bad, the tactful bad treatment in point storehouse.
Accordingly, it is desirable to provide a kind of realize the data point library storage side that simple, data space took less, was easy to extension
Method.
The content of the invention
For defect of the prior art, the present invention provides a kind of data point library storage method and device, existing to solve
Drawbacks described above in technology.
In a first aspect, a kind of data point stock's method for storing that the present invention is provided, including：
Obtain the target data of library storage to be divided；
The corresponding class of the target data is determined using default sorting algorithm；
By in target data storage to the corresponding database of the class, point library storage to the target data is completed.
Optionally, it is described that the corresponding class of the target data is determined using default sorting algorithm, including：
Obtain the identification code of the target data；
Quantity according to database carries out modulus using modulus algorithm to the identification code, is determined according to the mould for calculating acquisition
The corresponding class of the target data.
Optionally, the identification code is N binary digits, and N is the integer more than 1；
The quantity according to database carries out modulus to the identification code using modulus algorithm, including：
The identification code of N systems is converted into metric identification code；
Modulus is carried out to the metric identification code using the quantity of database.
Optionally, the target data has identification code, and the identification code is N binary digits, and N is the integer more than 1；
The step of obtaining the target data of library storage to be divided before, also include：
The factor or multiple database of N are set.
Optionally, the data point stock's method for storing, also includes：
When needing to carry out dilatation to database, the quantity according to the database after dilatation is adjusted to the sorting algorithm
It is whole；
The corresponding new class of the target data is redefined using the sorting algorithm after adjustment；
During the target data dumped into the corresponding database of the new class.
Optionally, the sorting algorithm using after adjustment redefines the corresponding new class of the target data, including：
Modulus is carried out to the identification code of the target data using the quantity of the database after dilatation, is obtained according to calculating
Mould determines the corresponding new class of the target data.
Second aspect, the present invention provides a kind of data point library storage system, including：
Target data acquisition module, the target data for obtaining library storage to be divided；
Sort module, for determining the corresponding class of the target data using default sorting algorithm；
Memory module, for by target data storage to the corresponding database of the class, completing to the number of targets
According to point library storage.
Optionally, the sort module, including：
Identification code acquiring unit, the identification code for obtaining the target data；
Modulo unit, modulus, root are carried out for the quantity according to database using modulus algorithm to the identification code
Determine the corresponding class of the target data according to the mould for calculating acquisition.
Optionally, the identification code is N binary digits, and N is the integer more than 1；
The modulo unit, including：
System conversion subunit, for the identification code of N systems to be converted into metric identification code；
Decimal system modulus subelement, modulus is carried out for the quantity using database to the metric identification code.
Optionally, the target data has identification code, and the identification code is N binary digits, and N is the integer more than 1；
The data point repository, also includes：
Database setup module, factor or multiple database for setting N.
Optionally, the data point repository, also includes：
Algorithm adjusting module, for when needing to carry out dilatation to database, according to the quantity pair of the database after dilatation
The sorting algorithm is adjusted；
New class computing module, for redefining the corresponding new class of the target data using the sorting algorithm after adjustment；
New class memory module, in the target data dumped into the corresponding database of the new class.
Optionally, the new class computing module, including：
New class modulus unit, takes for the quantity using the database after dilatation to the identification code of the target data
Mould, the corresponding new class of the target data is determined according to the mould for calculating acquisition.
As shown from the above technical solution, a kind of data point stock's method for storing that the present invention is provided, obtains stock to be divided first
The target data of storage；Then the corresponding class of the target data is determined using default sorting algorithm；Finally by the number of targets
According to storage to the corresponding database of the class, point library storage to the target data is completed.Compared to prior art, the application
Only need to calculate the class for determining target data, you can by target data storage to the corresponding database of the class.Method is simple,
And can not introduce subsidiary classifications such as new id during Fen Ku, so as to do not increase former target data storage size or
Point library storage is realized in the case of not needing extra memory space, it is less compared to prior art memory space occupancy, in addition,
The application realizes a point storehouse by the way of class and database are associated, therefore in data-base capacity-enlarging or Data Migration, only needs
Simple realization by increasing corresponding class or changing the associating of class and database, is easy to extension dilatation.
A kind of data point repository that the present invention is provided, invents with above-mentioned data point stock's method for storing for identical
Design, with identical beneficial effect.
Brief description of the drawings
In order to illustrate more clearly of the specific embodiment of the invention or technical scheme of the prior art, below will be to specific
The accompanying drawing to be used needed for implementation method or description of the prior art is briefly described.
Fig. 1 shows a kind of flow chart of data point stock's method for storing that first embodiment of the invention is provided；
Fig. 2 shows a kind of schematic diagram of data point repository that second embodiment of the invention is provided.
Specific embodiment
The embodiment of technical solution of the present invention is described in detail below in conjunction with accompanying drawing.Following examples are only used for
Technical scheme is clearly illustrated, therefore is intended only as example, and protection of the invention can not be limited with this
Scope.
It should be noted that unless otherwise indicated, technical term used in this application or scientific terminology should be this hair
The ordinary meaning that bright one of ordinary skill in the art are understood.
The present invention provides a kind of data point library storage method and apparatus.Embodiments of the invention are carried out below in conjunction with the accompanying drawings
Explanation.
Fig. 1 shows a kind of flow chart of data point stock's method for storing that first embodiment of the invention is provided.Such as Fig. 1 institutes
Show, a kind of data that first embodiment of the invention is provided point stock's method for storing is comprised the following steps：
Step S101：Obtain the target data of library storage to be divided.
In first embodiment of the invention, the target data of the library storage to be divided can be from the new of client acquisition
The data of the library storage to be divided stored in data to be stored, or existing database, above two application scenarios are equal
It is applicable.
Point stock's method for storing of first embodiment of the invention belongs to level point storehouse method, data element that will be in database table
Element as operation object, by each data element point library storage to each database.
Step S102：The corresponding class of the target data is determined using default sorting algorithm.
For data element, there are various sorting techniques (also referred to as sorting algorithm), for example：A kind of sorting technique is
Any one data item of the data element can be classified as classification foundation according to the actual requirements, such as a certain number
It is numeral according to the property value of item, then the data item can be divided into several intervals, each interval represents a class, then obtaining
After getting target data, you can belong to which interval according to corresponding property value and quickly, simply judge that the target data belongs to
In which class；And for example, the property value of some data item is ownership place, then can set corresponding according to the different of ownership place
Database simultaneously sets corresponding class, then after target data is got, you can property value according to ownership place and it is quick, simple
The judgement target data which class belonged to.Another sorting technique can be using machine learning algorithm training in advance classification mould
Type, then this step only need to for target data to be input into the disaggregated model upon execution, you can the corresponding classification results of output.This
Outward, in the case of in the data element containing identification code (such as ID, data object ID, from increasing row number etc.), can be with
Using modulus algorithm to identification code modulus, classified according to the mould for calculating determination.
It is described that the target data correspondence is determined using default sorting algorithm in one embodiment that the application is provided
Class, including：
Obtain the identification code of the target data；
Quantity according to database carries out modulus using modulus algorithm to the identification code, is determined according to the mould for calculating acquisition
The corresponding class of the target data.
For example have from increasing row number in target data and (given birth to automatically according to the genesis sequence or storage order of data by counter
Into sequence number) in the case of, modulus is carried out to identification code using the quantity of database, and class be with database it is one-to-one,
Therefore, it is that can determine that the corresponding class of the target data according to the mould for obtaining, and then is assigned in corresponding database.This method can
A point library storage is carried out with according to the order from increasing row number in order, uniformly to data, it is ensured that the load balancing of each database.
It is considered that due to system environments requirement or other reasonses, the identification code of data may (5 enter using different systems
System, 16 systems etc.), more information content can be stored using less byte for example with 16 systems, so as to reduce identification code
Memory space take, therefore the application provide one embodiment in, if the identification code be N binary digits, N be more than
1 integer；
The quantity according to database carries out modulus to the identification code using modulus algorithm, including：
The identification code of N systems is converted into metric identification code；
Modulus is carried out to the metric identification code using the quantity of database.
Using the above method, can solve the problems, such as to be not easy to modulus calculating in the case of non-decimal.
It is the situation of N binary digits for the identification code in addition to the above-mentioned method for carrying out system conversion, can also passes through
The factor or multiple database of N are set, and then by setting up N binary digits and database accession number in the case of not modulus
The corresponding relation of (one kind of class) and directly divided storehouse, if for example, the identification code be 16 systems, 4 data can be set
Storehouse, then, end character is 1,5,9, the identification code of c can correspond to the 1st database, end character is 2,6,0, the mark of d
Knowing code can correspond to the 2nd database, by that analogy；And for example, if the identification code is 16 systems, 32 data can be set
Storehouse, then, 32 databases can be divided into two groups, and according to identifier second-to-last character be odd number or even number (a, c,
E is considered as odd number) above-mentioned two group can be corresponded to, for each group, further according to identifier end character according to the method described above
Carry out a point storehouse.According to the above method, can be in the case where modulus not be carried out, fast and accurately according to the identifier of target data
Target data is classified.
Step S103：By in target data storage to the corresponding database of the class, complete to the target data
Divide library storage.
As it was previously stated, when database is set, determine the one-to-one relationship of class and database, so as to according to step S102
The class of determination stores in the corresponding database of the class target data, completes point library storage to the target data.
In addition, it is contemplated that the situation of data-base capacity-enlarging, in one embodiment that the application is provided, described data point storehouse
Storage method, also includes：
When needing to carry out dilatation to database, the quantity according to the database after dilatation is adjusted to the sorting algorithm
It is whole；
The corresponding new class of the target data is redefined using the sorting algorithm after adjustment；
During the target data dumped into the corresponding database of the new class.
Wherein it is possible to be adjusted correspondingly to the sorting algorithm according to the specific sorting algorithm for using, such as build again
Found classification map table, repartition digital interval, re -training disaggregated model etc., for modulus algorithm, can be using expansion
The quantity of the database after appearance carries out modulus to the identification code of the target data, and the target is determined according to the mould for calculating acquisition
The corresponding new class of data.Above within the protection domain of the application, no longer repeat one by one herein.
So far, by step S101 to step S103, a kind of data point that first embodiment of the invention is provided are completed
The flow of stock's method for storing.Compared to prior art, the application only needs to calculate the class for determining target data, you can by number of targets
According in storage to the corresponding database of the class.Method is simple, and the auxiliary such as new id can not be introduced during Fen Ku
Sorting item, so as to realize a point stock in the case where not increasing former target data storage size or not needing extra memory space
Storage, it is less compared to prior art memory space occupancy, in addition, the application is realized by the way of class is associated with database
Point storehouse, therefore in data-base capacity-enlarging or Data Migration, it is only necessary to increase corresponding class or change associating i.e. for class and database
Can simple realization, be easy to extend dilatation.
In the specific embodiment that the application is provided, above-mentioned technical side is implemented based on mongodb Database Systems
Case, system creates " ID " key of ObjectId types to the every data for storing, and uniqueness differentiation is carried out with to each data,
ObjectId uses the memory space of 12 bytes, and two hexadecimal digits of each byte are the character strings of 24, its knot
Structure composition is as shown in the table：
Wherein, time：4 bytes are a timestamps of unix.Timestamp is located at the foremost of character, and this is just meaned
ObjectId can substantially be ranked up according to insertion, and this plays great role for certain aspects, such as be searched as index raising
Rope efficiency etc..
machine：3 bytes are the unique identifiers of main frame where u.
pid：2 bytes are process id.
inc：3 bytes are an automatic increased counters, for the objectid for ensuring to be produced within the same second
Also conflict will not be found.
With reference to the explanation of first embodiment, the whole ObjectId can be considered as the identification code of target data, it is also possible to
The identification code that inc therein parts are considered as the target data is processed, a corresponding point storehouse strategy is：
Divide storehouse quantity principle：The quantity in point storehouse is 2 Nth power, recommends initialization point storehouse quantity for 4 or 8 are preferred.
Id cutting strategies：By the inc values in objectId, the inc values of 3 bit bytes are converted into 10 systems and are referred to as
idNumer。
To idNumer according to a point storehouse quantity modulus, dbCheck=idNumer%dbNumer.
DbCheck=0, represents first database of selection.The like, dbCheck=N represents selection (N+1)
Individual database.
Accordingly, when to data-base capacity-enlarging, following strategy can be used：
Dilatation principle：The quantity in point storehouse is 2 Nth power, and 2 times of dilatation is advised in each dilatation.
Data Migration principle：The idNumer of data id before acquisition dilatation, using idNumer to the database number after dilatation
Mould is measured, by olddbNumer=<dbCheck<The data of newdbNumer are migrated.
The method provided using above-mentioned specific embodiment, can realize a point stock in the case where system complexity is not increased
Storage, wherein id cuttings strategy have the advantages that non-stop layer, therefore system does not exist performance bottleneck and single-point problem, additionally, id
In include time attribute, be easy to developer investigate problem.
Corresponding in above-mentioned first embodiment, there is provided a kind of data point stock's method for storing, the application is also
A kind of data point repository is provided.Fig. 2 is refer to, a kind of its data point library storage provided for second embodiment of the invention
The schematic diagram of device.Because system embodiment is substantially similar to embodiment of the method, so describe fairly simple, related part ginseng
See the part explanation of embodiment of the method.System embodiment described below is only schematical.
A kind of data point repository that second embodiment of the invention is provided, including：
Target data acquisition module 101, the target data for obtaining library storage to be divided；
Sort module 102, for determining the corresponding class of the target data using default sorting algorithm；
Memory module 103, for by target data storage to the corresponding database of the class, completing to the target
Point library storage of data.
Optionally, the sort module 102, including：
Identification code acquiring unit, the identification code for obtaining the target data；
Modulo unit, modulus, root are carried out for the quantity according to database using modulus algorithm to the identification code
Determine the corresponding class of the target data according to the mould for calculating acquisition.
Optionally, the identification code is N binary digits, and N is the integer more than 1；
The modulo unit, including：
System conversion subunit, for the identification code of N systems to be converted into metric identification code；
Decimal system modulus subelement, modulus is carried out for the quantity using database to the metric identification code.
Optionally, the target data has identification code, and the identification code is N binary digits, and N is the integer more than 1；
The data point repository, also includes：
Database setup module, factor or multiple database for setting N.
Optionally, the data point repository, also includes：
Algorithm adjusting module, for when needing to carry out dilatation to database, according to the quantity pair of the database after dilatation
The sorting algorithm is adjusted；
New class computing module, for redefining the corresponding new class of the target data using the sorting algorithm after adjustment；
New class memory module 103, in the target data dumped into the corresponding database of the new class.
Optionally, the new class computing module, including：
New class modulus unit, takes for the quantity using the database after dilatation to the identification code of the target data
Mould, the corresponding new class of the target data is determined according to the mould for calculating acquisition.
More than, it is a kind of embodiment explanation of data point repository that second embodiment of the invention is provided.
A kind of data point repository that the present invention is provided is invented with above-mentioned data point stock's method for storing for identical
Design, with identical beneficial effect, here is omitted.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means to combine specific features, structure, material or spy that the embodiment or example are described
Point is contained at least one embodiment of the invention or example.In this manual, to the schematic representation of above-mentioned term not
Identical embodiment or example must be directed to.And, the specific features of description, structure, material or feature can be with office
Combined in an appropriate manner in one or more embodiments or example.Additionally, in the case of not conflicting, the skill of this area
Art personnel can be tied the feature of the different embodiments or example described in this specification and different embodiments or example
Close and combine.
It should be noted that the flow chart and block diagram in accompanying drawing show multiple embodiments of the invention system,
The architectural framework in the cards of method and computer program product, function and operation.At this point, in flow chart or block diagram
Each square frame can represent a part for module, program segment or code, the part bag of the module, program segment or code
It is used for the executable instruction of the logic function of realization regulation containing one or more.It should also be noted that at some as the reality replaced
In existing, the function of being marked in square frame can also occur with different from the order marked in accompanying drawing.For example, two continuous sides
Frame can essentially be performed substantially in parallel, and they can also be performed in the opposite order sometimes, and this is according to involved function
It is fixed.It is also noted that the group of the square frame in each square frame and block diagram and/or flow chart in block diagram and/or flow chart
Close, can be realized with the function of regulation or the special hardware based system of action is performed, or specialized hardware can be used
Combination with computer instruction is realized.
The data point repository that the embodiment of the present invention is provided can be computer program product, including store journey
The computer-readable recording medium of sequence code, the instruction that described program code includes can be used to perform institute in previous methods embodiment
The method stated, implements and can be found in embodiment of the method, will not be repeated here.
It is apparent to those skilled in the art that, for convenience and simplicity of description, the system of foregoing description,
The specific work process of system and unit, may be referred to the corresponding process in preceding method embodiment, will not be repeated here.
In several embodiments provided herein, it should be understood that disclosed system, system and method, can be with
Realize by another way.System embodiment described above is only schematical, for example, the division of the unit,
It is only a kind of division of logic function, there can be other dividing mode when actually realizing, but for example, multiple units or component can
To combine or be desirably integrated into another system, or some features can be ignored, or not perform.It is another, it is shown or beg for
The coupling each other of opinion or direct-coupling or communication connection can be by some communication interfaces, system or unit it is indirect
Coupling is communicated to connect, and can be electrical, mechanical or other forms.
The unit that is illustrated as separating component can be or may not be it is physically separate, it is aobvious as unit
The part for showing can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
On NE.Some or all of unit therein can be according to the actual needs selected to realize the mesh of this embodiment scheme
's.
In addition, during each functional unit in each embodiment of the invention can be integrated in a processing unit, it is also possible to
It is that unit is individually physically present, it is also possible to which two or more units are integrated in a unit.
If the function is to realize in the form of SFU software functional unit and as independent production marketing or when using, can be with
Storage is in a computer read/write memory medium.Based on such understanding, technical scheme is substantially in other words
The part contributed to prior art or the part of the technical scheme can be embodied in the form of software product, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used to so that a computer equipment (can be individual
People's computer, server, or network equipment etc.) perform all or part of step of each embodiment methods described of the invention.
And foregoing storage medium includes：USB flash disk, mobile hard disk, read-only storage (ROM, Read-Only Memory), arbitrary access are deposited
Reservoir (RAM, Random Access Memory), magnetic disc or CD etc. are various can be with the medium of store program codes.
Finally it should be noted that：Various embodiments above is merely illustrative of the technical solution of the present invention, rather than its limitations；To the greatest extent
Pipe has been described in detail with reference to foregoing embodiments to the present invention, it will be understood by those within the art that：Its according to
The technical scheme described in foregoing embodiments can so be modified, or which part or all technical characteristic are entered
Row equivalent；And these modifications or replacement, the essence of appropriate technical solution is departed from various embodiments of the present invention technology
The scope of scheme, it all should cover in the middle of the scope of claim of the invention and specification.
Claims (10)
1. a kind of data divide stock's method for storing, it is characterised in that including：
Obtain the target data of library storage to be divided；
The corresponding class of the target data is determined using default sorting algorithm；
By in target data storage to the corresponding database of the class, point library storage to the target data is completed.
2. data according to claim 1 divide stock's method for storing, it is characterised in that described true using default sorting algorithm
Determine the corresponding class of the target data, including：
Obtain the identification code of the target data；
Quantity according to database carries out modulus using modulus algorithm to the identification code, according to the mould for calculating acquisition determines
The corresponding class of target data.
3. data according to claim 2 divide stock's method for storing, it is characterised in that the identification code is N binary digits, N
It is the integer more than 1；
The quantity according to database carries out modulus to the identification code using modulus algorithm, including：
The identification code of N systems is converted into metric identification code；
Modulus is carried out to the metric identification code using the quantity of database.
4. data according to claim 1 divide stock's method for storing, it is characterised in that the target data has identification code,
The identification code is N binary digits, and N is the integer more than 1；
The step of obtaining the target data of library storage to be divided before, also include：
The factor or multiple database of N are set.
5. data according to claim 1 divide stock's method for storing, it is characterised in that also include：
When needing to carry out dilatation to database, the quantity according to the database after dilatation is adjusted to the sorting algorithm；
The corresponding new class of the target data is redefined using the sorting algorithm after adjustment；
During the target data dumped into the corresponding database of the new class.
6. data according to claim 5 divide stock's method for storing, it is characterised in that the sorting algorithm using after adjustment
The corresponding new class of the target data is redefined, including：
Modulus is carried out to the identification code of the target data using the quantity of the database after dilatation, it is true according to the mould for calculating acquisition
Determine the corresponding new class of the target data.
7. a kind of data divide repository, it is characterised in that including：
Target data acquisition module, the target data for obtaining library storage to be divided；
Sort module, for determining the corresponding class of the target data using default sorting algorithm；
Memory module, for by target data storage to the corresponding database of the class, completing to the target data
Divide library storage.
8. data according to claim 7 divide repository, it is characterised in that the sort module, including：
Identification code acquiring unit, the identification code for obtaining the target data；
Modulo unit, carries out modulus, according to meter using modulus algorithm for the quantity according to database to the identification code
Calculate the mould for obtaining and determine the corresponding class of the target data.
9. data according to claim 8 divide repository, it is characterised in that the identification code is N binary digits, N
It is the integer more than 1；
The modulo unit, including：
System conversion subunit, for the identification code of N systems to be converted into metric identification code；
Decimal system modulus subelement, modulus is carried out for the quantity using database to the metric identification code.
10. data according to claim 6 divide repository, it is characterised in that also include：
Algorithm adjusting module, for when needing to carry out dilatation to database, the quantity according to the database after dilatation to be to described
Sorting algorithm is adjusted；
New class computing module, for redefining the corresponding new class of the target data using the sorting algorithm after adjustment；
New class memory module, in the target data dumped into the corresponding database of the new class.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710084576.4A CN106897409A (en) | 2017-02-16 | 2017-02-16 | Data point library storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710084576.4A CN106897409A (en) | 2017-02-16 | 2017-02-16 | Data point library storage method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106897409A true CN106897409A (en) | 2017-06-27 |
Family
ID=59184028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710084576.4A Pending CN106897409A (en) | 2017-02-16 | 2017-02-16 | Data point library storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106897409A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108875003A (en) * | 2018-06-14 | 2018-11-23 | 广州谱道网络科技有限公司 | A kind of data positioning method and device |
| CN109213825A (en) * | 2017-06-29 | 2019-01-15 | 北京微影时代科技有限公司 | A kind of data-base capacity-enlarging method and device |
| CN109815231A (en) * | 2018-12-26 | 2019-05-28 | 亚信科技（中国）有限公司 | Data fragmentation method, device, computer equipment and storage medium |
| WO2019148672A1 (en) * | 2018-01-31 | 2019-08-08 | 平安科技（深圳）有限公司 | Method, device, apparatus, and computer readable storage medium for processing data |
| CN110175163A (en) * | 2019-05-24 | 2019-08-27 | 江西尚通科技发展股份有限公司 | More library separation methods, system and medium based on business function intelligently parsing |
| CN110221778A (en) * | 2019-05-27 | 2019-09-10 | 携程计算机技术（上海）有限公司 | Processing method, system, storage medium and the electronic equipment of hotel's data |
| CN110532268A (en) * | 2019-08-29 | 2019-12-03 | 深圳前海环融联易信息科技服务有限公司 | Method, apparatus, computer equipment and the storage medium that mass data divides library to store |
| CN112395293A (en) * | 2020-11-27 | 2021-02-23 | 浙江诺诺网络科技有限公司 | Warehouse and table dividing method, warehouse and table dividing device, warehouse and table dividing equipment and storage medium |
| CN113449042A (en) * | 2021-07-14 | 2021-09-28 | 中国银行股份有限公司 | Automatic data warehouse-dividing method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103685342A (en) * | 2012-08-31 | 2014-03-26 | 百度在线网络技术（北京）有限公司 | Personal cloud data storage center and cloud data storage method |
| CN104765754A (en) * | 2014-01-08 | 2015-07-08 | 北大方正集团有限公司 | Data storage method and device |
| CN105589894A (en) * | 2014-11-13 | 2016-05-18 | 腾讯数码（深圳）有限公司 | Document index establishing method and device as well as document retrieving method and device |
| CN105930387A (en) * | 2016-04-14 | 2016-09-07 | 北京思特奇信息技术股份有限公司 | Data operation system and method based on data routing and sharding |
| CN106294421A (en) * | 2015-05-25 | 2017-01-04 | 阿里巴巴集团控股有限公司 | A kind of data write, read method and device |
-
2017
- 2017-02-16 CN CN201710084576.4A patent/CN106897409A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103685342A (en) * | 2012-08-31 | 2014-03-26 | 百度在线网络技术（北京）有限公司 | Personal cloud data storage center and cloud data storage method |
| CN104765754A (en) * | 2014-01-08 | 2015-07-08 | 北大方正集团有限公司 | Data storage method and device |
| CN105589894A (en) * | 2014-11-13 | 2016-05-18 | 腾讯数码（深圳）有限公司 | Document index establishing method and device as well as document retrieving method and device |
| CN106294421A (en) * | 2015-05-25 | 2017-01-04 | 阿里巴巴集团控股有限公司 | A kind of data write, read method and device |
| CN105930387A (en) * | 2016-04-14 | 2016-09-07 | 北京思特奇信息技术股份有限公司 | Data operation system and method based on data routing and sharding |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109213825A (en) * | 2017-06-29 | 2019-01-15 | 北京微影时代科技有限公司 | A kind of data-base capacity-enlarging method and device |
| WO2019148672A1 (en) * | 2018-01-31 | 2019-08-08 | 平安科技（深圳）有限公司 | Method, device, apparatus, and computer readable storage medium for processing data |
| CN108875003A (en) * | 2018-06-14 | 2018-11-23 | 广州谱道网络科技有限公司 | A kind of data positioning method and device |
| CN109815231A (en) * | 2018-12-26 | 2019-05-28 | 亚信科技（中国）有限公司 | Data fragmentation method, device, computer equipment and storage medium |
| CN110175163A (en) * | 2019-05-24 | 2019-08-27 | 江西尚通科技发展股份有限公司 | More library separation methods, system and medium based on business function intelligently parsing |
| CN110221778A (en) * | 2019-05-27 | 2019-09-10 | 携程计算机技术（上海）有限公司 | Processing method, system, storage medium and the electronic equipment of hotel's data |
| CN110532268A (en) * | 2019-08-29 | 2019-12-03 | 深圳前海环融联易信息科技服务有限公司 | Method, apparatus, computer equipment and the storage medium that mass data divides library to store |
| CN110532268B (en) * | 2019-08-29 | 2023-04-28 | 深圳前海环融联易信息科技服务有限公司 | Method, device, computer equipment and storage medium for storing mass data in database |
| CN112395293A (en) * | 2020-11-27 | 2021-02-23 | 浙江诺诺网络科技有限公司 | Warehouse and table dividing method, warehouse and table dividing device, warehouse and table dividing equipment and storage medium |
| CN112395293B (en) * | 2020-11-27 | 2024-03-01 | 浙江诺诺网络科技有限公司 | Database and table dividing method, database and table dividing device, database and table dividing equipment and storage medium |
| CN113449042A (en) * | 2021-07-14 | 2021-09-28 | 中国银行股份有限公司 | Automatic data warehouse-dividing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106897409A (en) | Data point library storage method and device | |
| CN104317650B (en) | A kind of job scheduling method towards Map/Reduce type mass data processing platforms | |
| US8224825B2 (en) | Graph-processing techniques for a MapReduce engine | |
| CN110209728A (en) | A kind of Distributed Heterogeneous Database synchronous method, electronic equipment and storage medium | |
| CN113177050B (en) | Data equalization method, device, query system and storage medium | |
| CN108428114A (en) | Information processing method and device, storage medium, the electronic device of project | |
| CN107070645A (en) | Compare the method and system of the data of tables of data | |
| CN108415912A (en) | Data processing method based on MapReduce model and equipment | |
| CN109710406A (en) | Data distribution and its model training method, device and computing cluster | |
| CN107180031A (en) | Distributed storage method and device, data processing method and device | |
| CN109510852A (en) | The method and device of gray scale publication | |
| CN101419600A (en) | Data copy mapping method and device based on object-oriented LANGUAGE | |
| CN108833592A (en) | Cloud host schedules device optimization method, device, equipment and storage medium | |
| CN106250110A (en) | Set up the method and device of model | |
| CN111275284A (en) | Cost allocation device and method | |
| CN114372060A (en) | Data storage method, device, equipment and storage medium | |
| CN104506636B (en) | A kind of method of data synchronization and device | |
| CN106575296B (en) | Dynamic N-dimensional cube for hosted analytics | |
| CN106599291A (en) | Method and device for grouping data | |
| CN104239520B (en) | A kind of HDFS data block Placement Strategies based on historical information | |
| US20160357795A1 (en) | Method and apparatus for data mining | |
| CN103036796B (en) | Route information update method and device | |
| CN106648891A (en) | MapReduce model-based task execution method and apparatus | |
| Even-Zohar et al. | Random surfaces with boundary | |
| CN115564204A (en) | Parallel processing method for demand resource allocation in supply chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170627 |
|
| RJ01 | Rejection of invention patent application after publication |