CN107766459A - A kind of high-performance and high availability divide table method and its system - Google Patents

A kind of high-performance and high availability divide table method and its system Download PDF

Info

Publication number
CN107766459A
CN107766459A CN201710890427.7A CN201710890427A CN107766459A CN 107766459 A CN107766459 A CN 107766459A CN 201710890427 A CN201710890427 A CN 201710890427A CN 107766459 A CN107766459 A CN 107766459A
Authority
CN
China
Prior art keywords
random
performance
fractionation
users
availability
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
Application number
CN201710890427.7A
Other languages
Chinese (zh)
Other versions
CN107766459B (en
Inventor
胡亚军
陈伟梁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianyi Electronic Commerce Co Ltd
Original Assignee
Tianyi Electronic Commerce Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianyi Electronic Commerce Co Ltd filed Critical Tianyi Electronic Commerce Co Ltd
Priority to CN201710890427.7A priority Critical patent/CN107766459B/en
Publication of CN107766459A publication Critical patent/CN107766459A/en
Application granted granted Critical
Publication of CN107766459B publication Critical patent/CN107766459B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9017Indexing; Data structures therefor; Storage structures using directory or table look-up

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Divide table method and its system the present invention relates to a kind of high-performance and high availability, this method includes the ID number for obtaining user;Dimension fractionation and random fractionation are carried out according to ID number, obtain form ID number;User data is stored in the form of form ID number.The present invention splits the mode combined by using random fractionation and dimension and carries out form fractionation, database availability can greatly be improved, when one of form is unavailable, it can be rejected by random algorithm, data in the form are evenly distributed in other forms, if some data source where dividing table needs to do the operation such as HardwareUpgring, directly the data source is weeded out the random scope of random algorithm, carry out database upgrade is not shut down, the fractionation of form can be completed, the availability of database is greatly improved again, ensure the performance of database, greatly reduce and shut down the loss that upgrading is brought.

Description

A kind of high-performance and high availability divide table method and its system
Technical field
The present invention relates to table method is divided, more specifically refer to dividing table method and its being for a kind of high-performance and high availability System.
Background technology
As Internet service continues to develop, internet data is increasing, and individual database table can not meet The growth requirement of business, therefore, it is necessary to carry out the fractionation of data, when the data of a table are arrived when can not handling greatly, just need It is splitted into multiple tables, this is the method that current Internet firm generally uses.For example T_PAY payoff tables have 10 hundred million Data, it is very slow, it is necessary to be split to the data of this table, it is necessary to split into 100 tables T_PAY_00, T_ using processing PAY_01 ..., T_PAY_99, so every table data are exactly 1000W, greatly improve program processing speed.
Fractionation for database table, existing method for splitting are that application system splits data according to some dimension, are commonly used Be take ID it is last 2 as split dimension, such as UID=XXXX00 user, data fall in T_PAY_00, UID= XXXX89 user, data fall in T_PAY_89 forms.But this form splits into multiple forms, big form is split It is divided into multiple small forms, although performance improves, the quantity of form also increases, and there is association portion between each form Point, any form goes wrong, and can all cause business unavailable, reduces the availability of whole system and the property of system Energy.
Therefore, it is necessary to which that designs a kind of high-performance and high availability divides table method, the fractionation that can complete form is realized, The availability of database is greatly improved again, ensures the performance of database, greatly reduces and shuts down the loss that upgrading is brought.
The content of the invention
The defects of it is an object of the invention to overcome prior art, there is provided a kind of high-performance and high availability divide table method And its system.
To achieve the above object, the present invention uses following technical scheme:A kind of high-performance and high availability divide table method, Methods described includes:
Obtain the ID number of user;
Dimension fractionation and random fractionation are carried out according to ID number, obtain form ID number;
User data is stored in the form of the form ID number.
Its further technical scheme is:Dimension fractionation and the random step for splitting, obtaining form ID number are carried out according to ID number Suddenly, including in detail below step:
Obtain the last double figures of ID users;
According to the last double figures of the ID users, stochastic arithmetic is carried out, obtains random number;
The last double figures of the ID users is combined with random number, forms new numeral;
The two digits in new numeral are obtained, form form ID number.
Its further technical scheme is:The last double figures of the ID users is combined with random number, forms new numeral The step of, specifically it is combined, is formed new in the posterior order of preceding and random number according to the last double figures of ID users Numeral.
Its further technical scheme is:The two digits in new numeral are obtained, the step of forming form ID number, are specifically obtained The first bit digital and last one-bit digital in new numeral are taken, forms form ID number.
Its further technical scheme is:User data is stored in after the step in the form of the form ID number, also Including step in detail below:
Send inquiry or modification request;
According to the acquisition request form ID;
The form according to corresponding to being opened the form ID, carry out corresponding inquiry or modification.
Divide table system, including ID acquiring unit, form present invention also offers a kind of high-performance and high availability ID acquiring units and memory cell;
The ID acquiring unit, for obtaining the ID number of user;
The form ID acquiring units, for carrying out dimension fractionation and random fractionation according to ID number, obtain form ID number;
The memory cell, for user data to be stored in the form of the form ID number.
Its further technical scheme is:The form ID acquiring units include the first acquisition module, random number acquisition module, New numeral forms module and the second acquisition module;
First acquisition module, for obtaining the last double figures of ID users;
The random number acquisition module, for the last double figures according to the ID users, stochastic arithmetic is carried out, is obtained Random number;
The new numeral forms module, for the last double figures of the ID users to be combined with random number, is formed new Numeral;
Second acquisition module, for obtaining the two digits in new numeral, form form ID number.
Its further technical scheme is:The system also includes request transmitting unit, acquisition request unit and opened single Member;
The request transmitting unit, for sending inquiry or modification request;
The acquisition request unit, for according to the acquisition request form ID;
The opening unit, for the form according to corresponding to form ID openings, carry out corresponding inquiry or modification.
Compared with the prior art, the invention has the advantages that:The above-mentioned a kind of high-performance and high availability of the present invention Divide table method, the mode combined is split by using random fractionation and dimension and carries out form fractionation, can greatly improve data Storehouse availability, when one of form is unavailable, it can be rejected by random algorithm, the data in the form are evenly distributed to In other forms, if some data source where dividing table needs to do the operation such as HardwareUpgring, directly the data source is weeded out The random scope of random algorithm, carry out database upgrade is not shut down, the fractionation of form can be completed, database is greatly improved again Availability, ensure the performance of database, greatly reduce and shut down the loss that upgrading is brought.
The invention will be further described with specific embodiment below in conjunction with the accompanying drawings.
Brief description of the drawings
Fig. 1 is the flow chart for dividing table method of a kind of high-performance and high availability that the specific embodiment of the invention provides;
Fig. 2 is the flow chart for the acquisition form ID number that the specific embodiment of the invention provides;
Fig. 3 is the structured flowchart for dividing table system of a kind of high-performance and high availability that the specific embodiment of the invention provides;
Fig. 4 is the structured flowchart for the form ID acquiring units that the specific embodiment of the invention provides;
Fig. 5 is that the form that the specific embodiment of the invention provides splits schematic diagram.
Embodiment
In order to more fully understand the technology contents of the present invention, technical scheme is entered with reference to specific embodiment One step introduction and explanation, but it is not limited to this.
Specific embodiment as shown in Fig. 1~5, a kind of high-performance and high availability that the present embodiment provides divide table side Method, the form that can be used in database divide during table, realize the fractionation that can complete form, database is greatly improved again Availability, ensure the performance of database, greatly reduce and shut down the loss that upgrading is brought.
As shown in figure 1, present embodiments provide a kind of high-performance and high availability divides table method, this method includes:
S1, the ID number for obtaining user;
S2, dimension fractionation and random fractionation are carried out according to ID number, obtain form ID number;
S3, user data is stored in the form of the form ID number.
For above-mentioned S1 steps, the ID number of user is obtained, you can so that data corresponding to the user have identity, be easy to Call data and data storage.
Further, above-mentioned S2 steps, dimension fractionation and random fractionation is carried out according to ID number, obtain form ID number The step of, including step in detail below:
S21, the last double figures for obtaining ID users;
S22, the last double figures according to the ID users, stochastic arithmetic is carried out, obtain random number;
S23, the last double figures of the ID users combined with random number, form new numeral;
Two digits in S24, the new numeral of acquisition, form form ID number.
Above-mentioned S21 steps, belong to the basis that data fractionation is carried out according to user's dimension.
For above-mentioned S22 steps, specifically in order to be split at random, on the basis of the dimension split before, increase One random algorithm dimension.
Above-mentioned S23 steps and S24 steps, the numeral that random number and dimension are split form form by handling ID number.For above-mentioned S23 steps, the last double figures of the ID users is combined with random number, forms the step of new numeral Suddenly, specifically it is combined according to the last double figures of ID users in the posterior order of preceding and random number, forms new numeral; For above-mentioned S24 steps, the two digits in new numeral are obtained, the step of forming form ID number, specifically obtain new numeral In the first bit digital and last one-bit digital, formed form ID number.
Dimension is split and random number splits and combined, obtains form ID number, when a point of storehouse is broken down Wait, random number, which splits algorithm, can kick this point of storehouse (manual or automatic) off, and flowing water is uniformly distributed on other available point storehouses, the worst In the case of, only a point of storehouse can use, and can also ensure availability, ensure the available of database so as to high degree Rate, if newly adding a physical library, can also easily it add very much.
The ID of user 1 is Uid=1234567890, takes last 2 bit digital 90;The random algorithm that tries again obtains 1, finally Combination obtains 901, takes 901 front and rear 2 bit digital, and 91 be the ID number of form, i.e. this payment information of user 1 insertion form T_ PAY_91.The ID of user 1 is Uid=1234567890 user, takes last 2 bit digital 90, the random algorithm that tries again obtains 2, finally combination obtains 902, takes 902 front and rear 2 bit digital, and 92 be the ID number of form, i.e. this payment information of user 1 insertion T_ PAY_92.Also with regard to saying that the data for the user for being Uid=1234567890 are possible on T_PAY_9X, X is that random algorithm obtains Arrive.Similarly Uid=1234567891 user data, it is possible to fall on T_PAY_9X, X is that random algorithm obtains.
The deployment way of database is 10 logical data sources.This 10 tables of T_PAY_00, T_PAY_10 ... T_PAY_90 For one group, on DB_0 databases;This 10 tables of T_PAY_01, T_PAY_11 ... T_PAY_91 are one group, positioned at DB_1 numbers According on storehouse;The like, as shown in Figure 5.
From the point of view of unique user, payment information can be evenly distributed on 10 logical data sources, that is, when individual use It is a logical data source (database) that the paying bill information at family, which can uniformly hash in DB_0~DB_9 this,.This 10 logical datas Source is deployed in 10 independent physical machines, when a data source (database) is broken down, divides storehouse algorithm can immediately To kick this storehouse off, flowing water is uniformly distributed on other available point storehouses.For example, this data source of DB_0 breaks down, then random Algorithm changes into 1~9 from 0~9 scope direct access before, rejects 0, so all data can be all hashed in DB1~DB9; If DB1, DB2 break down, then random algorithm will be random in 0,3,4,5,6,7,8,9 these number scopes, rejects 1 With 2, data will not fall in DB1, DB2, in other 8 points of storehouse random distributions, if the worst situation, only DB9 can be used, separately All delay machine in outer 9 storehouses, then random algorithm returns to 9 every time, and all data all fall in DB9.From the point of view of data hash, Best situation, user data are hash on 100 tables;The worst situation, user data are hash in individual data source On 10 tables.Under worst case, only a point of storehouse can use, and can ensure availability, and performance improves 10 times than single table, So as to the availability and high-performance of the guarantee database of high degree;Opposite, if some storehouse is recovered, as long as Made an amendment on random algorithm, increase this storehouse random number just.
In addition, in other embodiment, above-mentioned S3 steps, user data is stored in the form of the form ID number After step, in addition to step in detail below:
Send inquiry or modification request;
According to the acquisition request form ID;
The form according to corresponding to being opened the form ID, carry out corresponding inquiry or modification.
Above-mentioned a kind of high-performance and high availability divides table method, splits and combines by using random fractionation and dimension Mode carry out form fractionation, can greatly improve database availability, can be by random when one of form is unavailable Algorithm is rejected, and the data in the form is evenly distributed in other forms, if the data source needs where some divides table are done HardwareUpgring etc. operates, and directly the data source is weeded out the random scope of random algorithm, does not shut down carry out database upgrade, both The fractionation of form can be completed, the availability of database is greatly improved again, ensures the performance of database, greatly reduces shutdown upgrading The loss brought.
As shown in figure 3, the present embodiment additionally provide a kind of high-performance and high availability divide table system, it includes ID Acquiring unit 1, form ID acquiring units 2 and memory cell 3.
ID acquiring unit 1, for obtaining the ID number of user.It may be such that data corresponding to the user have identity, It is easy to call data and data storage.
Form ID acquiring units 2, for carrying out dimension fractionation and random fractionation according to ID number, obtain form ID number.
Memory cell 3, for user data to be stored in the form of the form ID number.
Further, above-mentioned form ID acquiring units 2 include the first acquisition module 21, random number acquisition module 22, New numeral forms the acquisition module 24 of module 23 and second.
First acquisition module 21, for obtaining the last double figures of ID users.Belong to and carry out data according to user's dimension The basis of fractionation.
Random number acquisition module 22, for the last double figures according to the ID users, carry out stochastic arithmetic, obtain with Machine number.Specifically in order to be split at random, on the basis of the dimension split before, increase a random algorithm dimension.
New numeral forms module 23, for the last double figures of the ID users to be combined with random number, forms new number Word.
Second acquisition module 24, for obtaining the two digits in new numeral, form form ID number.
Above-mentioned new numeral forms the acquisition module 24 of module 23 and second, and the numeral that random number and dimension are split is passed through Processing, form the ID number of form.Form module 23 for new numeral, specifically according to ID users last double figures it is preceding with And the posterior order of random number is combined, new numeral is formed;For the second acquisition module 24, the is specifically obtained in new numeral One-bit digital and last one-bit digital, form form ID number.
Dimension is split and random number splits and combined, and obtains form ID number, when a point of storehouse is broken down, Random number, which splits algorithm, can kick this point of storehouse off, and flowing water is uniformly distributed on other available point storehouses, under worst case, only one Point storehouse can use, and can also ensure availability, so as to the availability of the guarantee database of high degree, if newly plus a thing Li Ku, can also easily it add very much.
The ID of user 1 is Uid=1234567890, takes last 2 bit digital 90;The random algorithm that tries again obtains 1, finally Combination obtains 901, takes 901 front and rear 2 bit digital, and 91 be the ID number of form, i.e. this payment information of user 1 insertion form T_ PAY_91.The ID of user 2 is Uid=1234567890 user, takes last 2 bit digital 90, the random algorithm that tries again obtains 2, finally combination obtains 902, takes 902 front and rear 2 bit digital, and 92 be the ID number of form, i.e. this payment information of user 2 insertion T_ PAY_92.Also with regard to saying that the data for the user for being Uid=1234567890 are possible on T_PAY_9X, X is that random algorithm obtains Arrive.Similarly Uid=1234567891 user data, it is possible to fall on T_PAY_9X, X is that random algorithm obtains.
The deployment way of database is 10 logical data sources.This 10 tables of T_PAY_00, T_PAY_10 ... T_PAY_90 For one group, on DB_0 databases;This 10 tables of T_PAY_01, T_PAY_11 ... T_PAY_91 are one group, positioned at DB_1 numbers According on storehouse;The like, as shown in Figure 5.
From the point of view of unique user, payment information can be evenly distributed on 10 logical data sources, that is, when individual use It is a logical data source (database) that the paying bill information at family, which can uniformly hash in DB_0~DB_9 this,.This 10 logical datas Source is deployed in 10 independent physical machines, when a data source (database) is broken down, divides storehouse algorithm can immediately To kick this storehouse off, flowing water is uniformly distributed on other available point storehouses.For example, this data source of DB_0 breaks down, then random Algorithm changes into 1~9 from 0~9 scope direct access before, rejects 0, so all data can be all hashed in DB1~DB9; If DB1, DB2 break down, then random algorithm will be random in 0,3,4,5,6,7,8,9 these number scopes, rejects 1 With 2, data will not fall in DB1, DB2, in other 8 points of storehouse random distributions, if the worst situation, only DB9 can be used, separately All delay machine in outer 9 storehouses, then random algorithm returns to 9 every time, and all data all fall in DB9.From the point of view of data hash, Best situation, user data are hash on 100 tables;The worst situation, user data are hash in individual data source On 10 tables.Under worst case, only a point of storehouse can use, and can ensure availability, and performance improves 10 times than single table, So as to the availability and high-performance of the guarantee database of high degree;Opposite, if some storehouse is recovered, as long as Made an amendment on random algorithm, increase this storehouse random number just.
In other embodiment, above-mentioned system also includes request transmitting unit, acquisition request unit and opening unit.
Request transmitting unit, for sending inquiry or modification request.
Acquisition request unit, for according to the acquisition request form ID.
Opening unit, for the form according to corresponding to form ID openings, carry out corresponding inquiry or modification.
Above-mentioned a kind of high-performance and high availability divides table system, splits and combines by using random fractionation and dimension Mode carry out form fractionation, can greatly improve database availability, can be by random when one of form is unavailable Algorithm is rejected, and the data in the form is evenly distributed in other forms, if the data source needs where some divides table are done HardwareUpgring etc. operates, and directly the data source is weeded out the random scope of random algorithm, does not shut down carry out database upgrade, both The fractionation of form can be completed, the availability of database is greatly improved again, ensures the performance of database, greatly reduces shutdown upgrading The loss brought.
The above-mentioned technology contents that the present invention is only further illustrated with embodiment, in order to which reader is easier to understand, but not Represent embodiments of the present invention and be only limitted to this, any technology done according to the present invention extends or recreation, by the present invention's Protection.Protection scope of the present invention is defined by claims.

Claims (8)

1. a kind of high-performance and high availability divide table method, it is characterised in that methods described includes:
Obtain the ID number of user;
Dimension fractionation and random fractionation are carried out according to ID number, obtain form ID number;
User data is stored in the form of the form ID number.
2. a kind of high-performance according to claim 1 and high availability divide table method, it is characterised in that are entered according to ID number Row dimension split and it is random split, the step of obtaining form ID number, including step in detail below:
Obtain the last double figures of ID users;
According to the last double figures of the ID users, stochastic arithmetic is carried out, obtains random number;
The last double figures of the ID users is combined with random number, forms new numeral;
The two digits in new numeral are obtained, form form ID number.
3. a kind of high-performance according to claim 2 and high availability divide table method, it is characterised in that by the user The last double figures of ID number combines with random number, the step of new numeral is formed, specifically according to the last double figures of ID users It is combined in the posterior order of preceding and random number, forms new numeral.
4. a kind of high-performance according to claim 3 and high availability divide table method, it is characterised in that obtain new numeral In two digits, the step of forming form ID number, specifically obtain the first bit digital and last one-bit digital in new numeral, Form form ID number.
5. a kind of high-performance and high availability according to any one of Claims 1-4 divide table method, it is characterised in that User data is stored in after the step in the form of the form ID number, in addition to step in detail below:
Send inquiry or modification request;
According to the acquisition request form ID;
The form according to corresponding to being opened the form ID, carry out corresponding inquiry or modification.
6. a kind of high-performance and high availability divide table system, it is characterised in that are obtained including ID acquiring unit, form ID Unit and memory cell;
The ID acquiring unit, for obtaining the ID number of user;
The form ID acquiring units, for carrying out dimension fractionation and random fractionation according to ID number, obtain form ID number;
The memory cell, for user data to be stored in the form of the form ID number.
7. a kind of high-performance according to claim 6 and high availability divide table system, it is characterised in that the form ID Acquiring unit includes the first acquisition module, random number acquisition module, new numeral and forms module and the second acquisition module;
First acquisition module, for obtaining the last double figures of ID users;
The random number acquisition module, for the last double figures according to the ID users, stochastic arithmetic is carried out, obtained random Number;
The new numeral forms module, for the last double figures of the ID users to be combined with random number, forms new numeral;
Second acquisition module, for obtaining the two digits in new numeral, form form ID number.
8. a kind of high-performance according to claim 7 and high availability divide table system, it is characterised in that the system is also Including request transmitting unit, acquisition request unit and opening unit;
The request transmitting unit, for sending inquiry or modification request;
The acquisition request unit, for according to the acquisition request form ID;
The opening unit, for the form according to corresponding to form ID openings, carry out corresponding inquiry or modification.
CN201710890427.7A 2017-09-27 2017-09-27 Table dividing method and system Active CN107766459B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710890427.7A CN107766459B (en) 2017-09-27 2017-09-27 Table dividing method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710890427.7A CN107766459B (en) 2017-09-27 2017-09-27 Table dividing method and system

Publications (2)

Publication Number Publication Date
CN107766459A true CN107766459A (en) 2018-03-06
CN107766459B CN107766459B (en) 2021-03-02

Family

ID=61266793

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710890427.7A Active CN107766459B (en) 2017-09-27 2017-09-27 Table dividing method and system

Country Status (1)

Country Link
CN (1) CN107766459B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109800270A (en) * 2019-01-22 2019-05-24 青岛聚好联科技有限公司 A kind of method and Internet of things system of data storage and query

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020073270A1 (en) * 2000-12-07 2002-06-13 Benson William E. Headerless split sector format for optical disk drives
CN101566986A (en) * 2008-04-21 2009-10-28 阿里巴巴集团控股有限公司 Method and device for processing data in online business processing
CN102402586A (en) * 2011-10-24 2012-04-04 深圳华强电子交易网络有限公司 Distributed data storage method
CN102930062A (en) * 2012-11-30 2013-02-13 南京富士通南大软件技术有限公司 Rapid horizontal extending method for databases
CN103942209A (en) * 2013-01-18 2014-07-23 阿里巴巴集团控股有限公司 Data processing method
CN106202524A (en) * 2016-07-22 2016-12-07 努比亚技术有限公司 Data base and point meter apparatus and method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020073270A1 (en) * 2000-12-07 2002-06-13 Benson William E. Headerless split sector format for optical disk drives
CN101566986A (en) * 2008-04-21 2009-10-28 阿里巴巴集团控股有限公司 Method and device for processing data in online business processing
CN102402586A (en) * 2011-10-24 2012-04-04 深圳华强电子交易网络有限公司 Distributed data storage method
CN102930062A (en) * 2012-11-30 2013-02-13 南京富士通南大软件技术有限公司 Rapid horizontal extending method for databases
CN103942209A (en) * 2013-01-18 2014-07-23 阿里巴巴集团控股有限公司 Data processing method
CN106202524A (en) * 2016-07-22 2016-12-07 努比亚技术有限公司 Data base and point meter apparatus and method

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109800270A (en) * 2019-01-22 2019-05-24 青岛聚好联科技有限公司 A kind of method and Internet of things system of data storage and query
CN109800270B (en) * 2019-01-22 2020-12-04 青岛聚好联科技有限公司 Data storage and query method and Internet of things system

Also Published As

Publication number Publication date
CN107766459B (en) 2021-03-02

Similar Documents

Publication Publication Date Title
CN110489445B (en) Rapid mass data query method based on polymorphic composition
CN102722553B (en) Distributed type reverse index organization method based on user log analysis
CN104408159B (en) A kind of data correlation, loading, querying method and device
CN110674154B (en) Spark-based method for inserting, updating and deleting data in Hive
CN105335402B (en) Searching method, index data generation method and device based on static Cache
CN104008199B (en) A kind of data query method
CN109857803B (en) Data synchronization method, device, equipment, system and computer readable storage medium
CN105989076A (en) Data statistical method and device
CN107943952A (en) A kind of implementation method that full-text search is carried out based on Spark frames
US10496616B2 (en) Log fragmentation method and apparatus
CN103514236A (en) Retrieval condition error correction prompt processing method based on Pinyin in retrieval application
CN110674247A (en) Barrage information intercepting method and device, storage medium and equipment
CN103425771A (en) Method and device for excavating data regular expressions
CN104077385A (en) Classification and retrieval method of files
Lee et al. Poster: A proof-of-stake (PoS) blockchain protocol using fair and dynamic sharding management
CN109299101B (en) Data retrieval method, device, server and storage medium
CN101763415A (en) Method and device for generating B tree index of database
CN110019231A (en) A kind of method that parallel database dynamically associates and node
CN108874950A (en) A kind of distributed data storage method and device based on ER relationship
CN102945163A (en) Signal-slot structure for embedded system
US20210397667A1 (en) Search term recommendation method and system based on multi-branch tree
CN107766459A (en) A kind of high-performance and high availability divide table method and its system
CN104794129B (en) A kind of data processing method and system based on inquiry log
CN107562762A (en) Data directory construction method and device
CN103853763A (en) Information acquiring method and device

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

Effective date of registration: 20200819

Address after: 510030 - 5, 1st / F, 2nd floor, 230 Changdi Road, Yuexiu District, Guangzhou City, Guangdong Province

Applicant after: Tianyi commercial factoring Co., Ltd

Address before: 102200 Beijing Changping District future science and Technology City South District China Telecom group company

Applicant before: TIANYI ELECTRONIC COMMERCE Co.,Ltd.

GR01 Patent grant
GR01 Patent grant