CN106202261A - The distributed approach of a kind of data access request and engine - Google Patents
The distributed approach of a kind of data access request and engine Download PDFInfo
- Publication number
- CN106202261A CN106202261A CN201610499819.6A CN201610499819A CN106202261A CN 106202261 A CN106202261 A CN 106202261A CN 201610499819 A CN201610499819 A CN 201610499819A CN 106202261 A CN106202261 A CN 106202261A
- Authority
- CN
- China
- Prior art keywords
- data
- request
- data access
- back end
- access request
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Probability & Statistics with Applications (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Fuzzy Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application discloses distributed approach and the engine of a kind of data access request, the method includes: obtain the data access request that user terminal is initiated for target data；Wherein, target data includes N part data segment, and N number of back end that above-mentioned N part data segment is stored in distributed memory system the most one to one, and N is positive integer；According to above-mentioned N part data segment in the storage position of above-mentioned N number of back end, correspondingly data access request is resolved into the request of N number of data access, and respectively the request of above-mentioned N number of data access is sent one to one to above-mentioned N number of back end；By above-mentioned N number of back end to corresponding data access request respond after return data merge, and will merge after data send to user terminal.The application can be greatly reduced the communication overhead during whole access response, and reduces the impact that equipment fault is brought, and improves data access reliability.
Description
Technical field
The present invention relates to data access technology field, particularly to a kind of data access request distributed approach and
Engine.
Background technology
Centralized data base system is a kind of data that can focus on Client-initiated data access request
Storehouse system.Owing to centralized data base system is to process data access request by the way of focusing on, institute
With in centralized data base system, such as back up, the data access function such as inquiry can be easy for accomplished, but,
Focus on and but can bring the highest communication overhead, and be easily subject to equipment fault impact cause reliability relatively low.
In sum it can be seen that how to reduce communication overhead during data access request is responded and to carry
High data access reliability is to have problem to be solved at present.
Summary of the invention
In view of this, it is an object of the invention to provide distributed approach and the engine of a kind of data access request,
Achieve and during data access request is responded, reduce communication overhead and improve the purpose of data access reliability.
Its concrete scheme is as follows:
A kind of distributed approach of data access request, including:
Obtain the data access request that user terminal is initiated for target data；Wherein, described target data includes N number
According to section, and N number of back end that described N part data segment is stored in distributed memory system the most one to one, N is the most whole
Number；
According to described N part data segment in the storage position of described N number of back end, correspondingly by described data access request
Resolve into the request of N number of data access, and respectively the request of described N number of data access is sent one to one to described N number of number
According to node；
The data returned after described N number of back end being responded the request of corresponding data access merge,
And the data after merging send to described user terminal.
Preferably, described according to described N part data segment in the storage position of described N number of back end, correspondingly by described
Data access request resolves into the process of N number of data access request, including:
Described data access request is resolved, the described target data corresponding to determine described data access request；
Utilize metadatabase, the described target data determined after resolving is analyzed, to determine that described N part data segment exists
The storage position of described N number of back end；Wherein, described metadatabase is the distributions on each back end of the pre-recorded data
The data base of storage positional information；
According to described N part data segment in the storage position of described N number of back end, correspondingly by described data access request
Resolve into the request of described N number of data access；Wherein, each data access request in comprise with this data access request right
The storage position of the data segment answered.
Preferably, described distributed approach, also include: the data after described merging are cached.
Preferably, described distributed approach, also include:
The all Data Migrations preserved on the back end that will currently break down are to the data section that currently can normally work
On point；
After data migration process completes, the distribution storage positional information of record in described metadatabase is carried out accordingly
Amendment.
Preferably, described distributed approach, also include:
After on any data node, the storage position of data is changed, the distribution of record in described metadatabase is deposited
Storage positional information is revised accordingly.
The invention also discloses the distributed process engines of a kind of data access request, including:
Request AM access module, for obtaining the data access request that user terminal is initiated for target data；Wherein, described
Target data includes N part data segment, and described N part data segment is stored in the N in distributed memory system the most one to one
Individual back end, N is positive integer；
Request diverter module, is used for according to described N part data segment in the storage position of described N number of back end, correspondingly
Described data access request is resolved into the request of N number of data access, and respectively described N number of data access is asked one to one
Ground sends to described N number of back end；
Data combiners block, returns after described N number of back end being responded the request of corresponding data access
The data returned merge, and the data after merging send to described user terminal.
Preferably, described request diverter module includes:
Request analysis unit, for resolving described data access request, to determine described data access request pair
The described target data answered；
Positional information analytic unit, is used for utilizing metadatabase, determines after resolving described request analysis unit
Described target data is analyzed, to determine that described N part data segment is in the storage position of described N number of back end；Wherein, described
Metadatabase is the data base of pre-recorded data distribution storage positional information on each back end；
Request resolving cell, is used for according to described N part data segment in the storage position of described N number of back end, correspondingly
Described data access request is resolved into the request of described N number of data access；Wherein, each data access request in comprise with
The storage position of the data segment that the request of this data access is corresponding；
Request routing unit, for sending the request of described N number of data access one to one to described N number of data respectively
Node.
Preferably, described data combiners block includes:
Data capture unit, is used for obtaining after the request of corresponding data access responds by described N number of back end
The data returned；
Data combination unit, merges for the data getting described data capture unit；
Data transmission unit, the data obtained after described data combination unit is carried out data merging send to described
User terminal.
Preferably, described distributed process engines, also include:
Cache module, for caching the data after described merging.
Preferably, described distributed process engines, also include:
Data Migration module, all Data Migrations preserved on the back end that will currently break down are to current energy
On the back end of normal work；
Information modified module, for after described Data Migration module completes Data Migration, remembers in described metadatabase
The distribution storage positional information of record is revised accordingly.
In the present invention, the distributed approach of data access request, including: obtain user terminal and send out for target data
The data access request risen；Wherein, target data includes N part data segment, and above-mentioned N part data segment stores the most one to one
N number of back end in distributed memory system, N is positive integer；According to above-mentioned N part data segment at above-mentioned N number of back end
Storage position, correspondingly data access request is resolved into N number of data access request, and respectively will above-mentioned N number of data visit
Ask that sub-request sends one to one to above-mentioned N number of back end；Corresponding data access is asked by above-mentioned N number of back end
After responding return data merge, and will merge after data send to user terminal.Visible, the present invention is obtaining
After data access request, according to target data storage positional information in distributed memory system, correspondingly data are visited
The request of N number of data access is resolved in the request of asking, then the request of each data access is sent to corresponding back end,
And then the data returning back end are merged the data transmission obtained to user terminal.That is, the present invention is basis
Target data specifically store position, data access request is decomposed, then will decompose after obtain data access
Request is accurately delivered to corresponding back end and responds, and this feature being accurately delivered to corresponding data node can be significantly
Reduce the communication overhead during whole access response, and if can obtain after decomposing multiple data access please
Asking, will eventually be so to be responded a data access request by multiple back end, this advantageously reduces equipment event
The impact that barrier is brought, thus improve data access reliability.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this
Inventive embodiment, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to according to
The accompanying drawing provided obtains other accompanying drawing.
Fig. 1 is the distributed approach flow chart of a kind of data access request disclosed in the embodiment of the present invention；
Fig. 2 is the distributed process engines structural representation of a kind of data access request disclosed in the embodiment of the present invention；
Fig. 3 is a kind of concrete distributed process engines structural representation disclosed in the embodiment of the present invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Describe, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments wholely.Based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under not making creative work premise
Embodiment, broadly falls into the scope of protection of the invention.
The embodiment of the invention discloses the distributed approach of a kind of data access request, shown in Figure 1, the method
Including:
Step S11: obtain the data access request that user terminal is initiated for target data；Wherein, target data includes N
Part data segment, and N number of back end that above-mentioned N part data segment is stored in distributed memory system the most one to one, N is
Positive integer.
It is understood that the data access request in the present embodiment refer to data inspection request, data backup requests or
Data copy request etc. need target data is read out the request that data process.
N number of back end that above-mentioned target data is stored in advance in distributed memory system, that is, this N number of data section
Each back end in point independently stores a part of data in above-mentioned target data, and the present embodiment is by each data
The a part of data corresponding with target data stored in node are referred to as a data segment.
Further it will be understood that the program language for generating above-mentioned data access request can be Java, C, C++,
Any one in C# or Python.
Step S12: according to above-mentioned N part data segment in the storage position of above-mentioned N number of back end, correspondingly by data access
The request of N number of data access is resolved in request, and sends the request of above-mentioned N number of data access to above-mentioned N one to one respectively
Individual back end.
It is understood that each data access above-mentioned request comprises the number corresponding with the request of this data access
Storage positional information according to section.
Step S13: the data returned after above-mentioned N number of back end being responded the request of corresponding data access are entered
Row merge, and will merge after data send to user terminal.
It is understood that after any data node receives the request of corresponding data access, just to this data access
Son request responds, to return the corresponding data segment of storage on this back end.The number that above-mentioned N number of back end is returned
According to just can get the data consistent with above-mentioned target data after merging.
In the embodiment of the present invention, the distributed approach of data access request, including: obtain user terminal for target
The data access request that data are initiated；Wherein, target data includes N part data segment, and above-mentioned N part data segment is the most one to one
N number of back end of being stored in distributed memory system, N is positive integer；According to above-mentioned N part data segment at above-mentioned N number of number
According to the storage position of node, correspondingly data access request is resolved into the request of N number of data access, and respectively by above-mentioned N number of
The request of data access sends one to one to above-mentioned N number of back end；By above-mentioned N number of back end to corresponding data access
Son request respond after return data merge, and will merge after data send to user terminal.Visible, the present invention
Embodiment is after getting data access request, according to target data storage positional information in distributed memory system, phase
Data access request should be resolved into ground the request of N number of data access, then the request of each data access be sent to accordingly
Back end on, and then the data returning back end merged the data that obtain send to user terminal.That is,
The embodiment of the present invention is specifically to store position according to target data, is decomposed data access request, then will decompose
After the data access request that obtains accurately be delivered to corresponding back end and respond, this be accurately delivered to corresponding data
The feature of node can be greatly reduced the communication overhead during whole access response, and if can obtain after decomposing
Multiple data access are asked, and will eventually be so to be responded a data access request by multiple back end, this
Advantageously reduce the impact that equipment fault is brought, thus improve data access reliability.
The embodiment of the invention discloses the distributed approach of a kind of concrete data access request, real relative to upper one
Executing example, technical scheme has been made further instruction and optimization by the present embodiment.Concrete:
In upper embodiment step S12, according to N part data segment in the storage position of N number of back end, correspondingly by data
Access request resolves into the process of N number of data access request, comprises the following steps S121 to step S123；Wherein:
Step S121: data access request is resolved, the target data corresponding to determine data access request.
That is, first determine the data object that the data access request being currently received is to be accessed.
Wherein, the process resolved data access request can be specifically that data access request is carried out sql parsing
(sql, i.e. structured query language, SQL).In the present embodiment, the process that sql resolves is concrete
Syntactic analysis and semantic analysis can be included, it is also possible to farther include at view conversion, expression formula conversion and sql optimization
Reason.
Step S122: utilize metadatabase, is analyzed the target data determined after above-mentioned parsing, to determine above-mentioned N
Part data segment is in the storage position of above-mentioned N number of back end；Wherein, metadatabase is that pre-recorded data are on each back end
Distribution storage positional information data base.
Above-mentioned metadatabase stores all data data storage location distribution situation on each back end.Profit
Use this metadatabase, a certain data distribution storage positional information in distributed memory system can be determined easily.
Data are correspondingly visited by step S123: according to above-mentioned N part data segment in the storage position of above-mentioned N number of back end
The request of N number of data access is resolved in the request of asking；Wherein, the request of each data access comprises and the request of this data access
The storage position of corresponding data segment.
In the present embodiment, distributed approach may further comprise: that the data after being combined cache, when follow-up use
When data access request is initiated again for identical data in family, can directly the data of caching be sent to corresponding user eventually
End.
Further, in the present embodiment, distributed approach can also include: the back end that will currently break down
All Data Migrations of upper preservation are on the back end that currently can normally work, after data migration process completes, to unit's number
Revise accordingly according to the distribution storage positional information of record in storehouse.
Wherein, after above-mentioned data migration process completes, the distribution storage positional information of record in metadatabase is carried out
The process of corresponding amendment not only includes that the storage positional information of the back end to data of having moved into is modified, also include by
The storage positional information corresponding with the back end broken down is deleted.
It addition, the distributed approach in the present embodiment, it is also possible to including: when the storage of data on any data node
After position is changed, the distribution storage positional information of record in metadatabase is revised accordingly.
Accordingly, the embodiment of the invention also discloses the distributed process engines of a kind of data access request, see Fig. 2 institute
Showing, this engine includes:
Request AM access module 21, for obtaining the data access request that user terminal is initiated for target data；Wherein, mesh
Mark data include N part data segment, and above-mentioned N part data segment be stored in the most one to one in distributed memory system N number of
Back end, N is positive integer；
Request diverter module 22, is used for according to above-mentioned N part data segment in the storage position of above-mentioned N number of back end, accordingly
Data access request is resolved into the request of N number of data access by ground, and is asked one to one by above-mentioned N number of data access respectively
Send to above-mentioned N number of back end；
Data combiners block 23, after responding above-mentioned N number of back end the request of corresponding data access
Return data merge, and will merge after data send to user terminal.
Visible, the embodiment of the present invention is after getting data access request, according to target data at distributed memory system
In storage positional information, correspondingly data access request is resolved into N number of data access request, then each data are visited
Ask that sub-request sends on corresponding back end, and then the data returning back end are merged the data obtained send out
Deliver to user terminal.That is, the embodiment of the present invention is specifically to store position according to target data, data access request is carried out
Decomposing, the data access request that then will obtain after decomposing accurately is delivered to corresponding back end and responds, this
Accurately it is delivered to the communication overhead during the feature of corresponding data node can be greatly reduced whole access response, and if
The request of multiple data access can be obtained after decomposing, will eventually be so by multiple back end, one data to be visited
The request of asking responds, and this advantageously reduces the impact that equipment fault is brought, thus improves data access reliability.
The embodiment of the invention discloses the distributed process engines of a kind of concrete data access request, real relative to upper one
Executing example, technical scheme has been made further instruction and optimization by the present embodiment.Concrete:
Shown in Figure 3, in a upper embodiment, request diverter module specifically includes request analysis unit 221, positional information
Analytic unit 222, request resolving cell 223 and request routing unit 224；Wherein:
Request analysis unit 221, for data access request is resolved, the mesh corresponding to determine data access request
Mark data；
Positional information analytic unit 222, is used for utilizing metadatabase, determines after resolving request analysis unit 221
Target data be analyzed, to determine that above-mentioned N part data segment is in the storage position of above-mentioned N number of back end；Wherein, metadata
Storehouse is the data base of pre-recorded data distribution storage positional information on each back end；
Request resolving cell 223, is used for according to above-mentioned N part data segment in the storage position of above-mentioned N number of back end, accordingly
Data access request is resolved into the request of N number of data access by ground；Wherein, the request of each data access comprises and these data
Access the storage position of data segment corresponding to son request；
Request routing unit 224, for sending the request of above-mentioned N number of data access one to one to above-mentioned N number of respectively
Back end.
It addition, the data combiners block in a upper embodiment specifically includes data capture unit, data combination unit sum
According to transmitting element；Wherein:
Data capture unit, is used for obtaining after the request of corresponding data access responds by above-mentioned N number of back end
The data returned；
Data combination unit, merges for the data getting data capture unit；
Data transmission unit, the data obtained after data combination unit is carried out data merging send to user eventually
End.
Distributed process engines further, shown in Figure 3, in the present embodiment, it is also possible to including:
Cache module 24, the data after being combined cache.
Shown in Figure 3, in the present embodiment, distributed process engines can also include that Data Migration module 25 and information are repaiied
Change module 26；Wherein:
Data Migration module 25, all Data Migrations preserved on the back end that will currently break down are to currently
On the back end that can normally work；
Information modified module 26, for after Data Migration module 25 completes Data Migration, to record in metadatabase
Distribution storage positional information is revised accordingly.
It addition, above-mentioned information modified module 26, it may also be used for when on any data node, the storage position of data becomes
After more, the distribution storage positional information of record in metadatabase is revised accordingly.
Finally, in addition it is also necessary to explanation, in this article, term " includes ", " comprising " or its any other variant are intended to
Contain comprising of nonexcludability, so that include that the process of a series of key element, method, article or equipment not only include those
Key element, but also include other key elements being not expressly set out, or also include for this process, method, article or set
Standby intrinsic key element.In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that
Other identical element is there is also in including the process of described key element, method, article or equipment.
Distributed approach and engine to a kind of data access request provided by the present invention have been carried out in detail above
Introducing, principle and the embodiment of the present invention are set forth by specific case used herein, the explanation of above example
It is only intended to help to understand method and the core concept thereof of the present invention；Simultaneously for one of ordinary skill in the art, according to this
The thought of invention, the most all will change, and in sum, this specification content should not
It is interpreted as limitation of the present invention.
Claims (10)
1. the distributed approach of a data access request, it is characterised in that including:
Obtain the data access request that user terminal is initiated for target data；Wherein, described target data includes N number evidence
Section, and N number of back end that described N part data segment is stored in distributed memory system the most one to one, N is the most whole
Number；
According to described N part data segment in the storage position of described N number of back end, correspondingly described data access request is decomposed
Become N number of data access to ask, and respectively the request of described N number of data access is sent one to one to described N number of data section
Point；
The data returned after described N number of back end being responded the request of corresponding data access merge, and will
Data after merging send to described user terminal.
The distributed approach of data access request the most according to claim 1, it is characterised in that described in described basis
Described data access request, in the storage position of described N number of back end, is correspondingly resolved into N number of data and visits by N part data segment
Ask the process of sub-request, including:
Described data access request is resolved, the described target data corresponding to determine described data access request；
Utilize metadatabase, the described target data determined after resolving is analyzed, to determine that described N part data segment is described
The storage position of N number of back end；Wherein, described metadatabase is the distribution storages on each back end of the pre-recorded data
The data base of positional information；
According to described N part data segment in the storage position of described N number of back end, correspondingly described data access request is decomposed
Described N number of data access is become to ask；Wherein, each data access comprises corresponding with the request of this data access in asking
The storage position of data segment.
The distributed approach of data access request the most according to claim 1, it is characterised in that also include: to institute
State the data after merging to cache.
The distributed approach of data access request the most according to claim 2, it is characterised in that also include:
The all Data Migrations preserved on the back end that will currently break down are on the back end that currently can normally work；
After data migration process completes, the distribution storage positional information of record in described metadatabase is repaiied accordingly
Change.
The distributed approach of data access request the most according to claim 2, it is characterised in that also include:
After on any data node, the storage position of data is changed, to the distribution storage position of record in described metadatabase
Confidence breath is revised accordingly.
6. the distributed process engines of a data access request, it is characterised in that including:
Request AM access module, for obtaining the data access request that user terminal is initiated for target data；Wherein, described target
Data include N part data segment, and N number of number that described N part data segment is stored in distributed memory system the most one to one
According to node, N is positive integer；
Request diverter module, is used for according to described N part data segment in the storage position of described N number of back end, correspondingly by institute
State data access request and resolve into the request of N number of data access, and respectively the request of described N number of data access is sent out one to one
Deliver to described N number of back end；
Data combiners block, returns after described N number of back end being responded the request of corresponding data access
Data merge, and the data after merging send to described user terminal.
The distributed process engines of data access request the most according to claim 6, it is characterised in that described request shunts
Module includes:
Request analysis unit is for resolving described data access request, corresponding to determine described data access request
Described target data；
Positional information analytic unit, is used for utilizing metadatabase, determine after described request analysis unit is resolved described in
Target data is analyzed, to determine that described N part data segment is in the storage position of described N number of back end；Wherein, described unit number
According to the data base that storehouse is pre-recorded data distribution storage positional information on each back end；
Request resolving cell, is used for according to described N part data segment in the storage position of described N number of back end, correspondingly by institute
State data access request and resolve into the request of described N number of data access；Wherein, the request of each data access comprises and this number
According to the storage position accessing data segment corresponding to son request；
Request routing unit, for sending the request of described N number of data access one to one to described N number of data section respectively
Point.
The distributed process engines of data access request the most according to claim 6, it is characterised in that described data merge
Module includes:
Data capture unit, is used for obtaining return after the request of corresponding data access is responded by described N number of back end
Data；
Data combination unit, merges for the data getting described data capture unit；
Data transmission unit, the data obtained after described data combination unit is carried out data merging send to described user
Terminal.
The distributed process engines of data access request the most according to claim 6, it is characterised in that also include:
Cache module, for caching the data after described merging.
The distributed process engines of data access request the most according to claim 7, it is characterised in that also include:
Data Migration module, all Data Migrations preserved on the back end that will currently break down are normal to currently energy
On the back end of work；
Information modified module, for after described Data Migration module completes Data Migration, to record in described metadatabase
Distribution storage positional information is revised accordingly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610499819.6A CN106202261A (en) | 2016-06-29 | 2016-06-29 | The distributed approach of a kind of data access request and engine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610499819.6A CN106202261A (en) | 2016-06-29 | 2016-06-29 | The distributed approach of a kind of data access request and engine |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106202261A true CN106202261A (en) | 2016-12-07 |
Family
ID=57463038
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610499819.6A Pending CN106202261A (en) | 2016-06-29 | 2016-06-29 | The distributed approach of a kind of data access request and engine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106202261A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106803841A (en) * | 2017-02-14 | 2017-06-06 | 北京奇虎科技有限公司 | The read method of message queue data, device and distributed data-storage system |
| CN107070987A (en) * | 2017-03-01 | 2017-08-18 | 网宿科技股份有限公司 | Data capture method and system for distributed objects storage system |
| CN107589917A (en) * | 2017-09-29 | 2018-01-16 | 郑州云海信息技术有限公司 | A kind of distributed memory system and method |
| CN107888684A (en) * | 2017-11-13 | 2018-04-06 | 小草数语（北京）科技有限公司 | Distributed system calculating task processing method, device and controller |
| CN108241654A (en) * | 2016-12-23 | 2018-07-03 | 航天星图科技（北京）有限公司 | A kind of data read-write method in distributed system |
| CN109375872A (en) * | 2018-09-27 | 2019-02-22 | 腾讯科技（深圳）有限公司 | Processing method, device and the equipment and storage medium of data access request |
| CN110727401A (en) * | 2019-09-09 | 2020-01-24 | 无锡江南计算技术研究所 | Memory access system |
| CN114116553A (en) * | 2021-11-30 | 2022-03-01 | 海光信息技术股份有限公司 | Data processing device, method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729290A (en) * | 2009-11-04 | 2010-06-09 | 中兴通讯股份有限公司 | Method and device for realizing business system protection |
| CN102467570A (en) * | 2010-11-17 | 2012-05-23 | 日电（中国）有限公司 | Connection query system and method for distributed data warehouse |
| US20120290631A1 (en) * | 2011-05-09 | 2012-11-15 | Cleversafe, Inc. | Retrieving a hypertext markup language file from a dispersed storage network memory |
| CN104572862A (en) * | 2014-12-19 | 2015-04-29 | 阳珍秀 | Mass data storage access method and system |
-
2016
- 2016-06-29 CN CN201610499819.6A patent/CN106202261A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729290A (en) * | 2009-11-04 | 2010-06-09 | 中兴通讯股份有限公司 | Method and device for realizing business system protection |
| CN102467570A (en) * | 2010-11-17 | 2012-05-23 | 日电（中国）有限公司 | Connection query system and method for distributed data warehouse |
| US20120290631A1 (en) * | 2011-05-09 | 2012-11-15 | Cleversafe, Inc. | Retrieving a hypertext markup language file from a dispersed storage network memory |
| CN104572862A (en) * | 2014-12-19 | 2015-04-29 | 阳珍秀 | Mass data storage access method and system |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108241654A (en) * | 2016-12-23 | 2018-07-03 | 航天星图科技（北京）有限公司 | A kind of data read-write method in distributed system |
| CN106803841A (en) * | 2017-02-14 | 2017-06-06 | 北京奇虎科技有限公司 | The read method of message queue data, device and distributed data-storage system |
| CN106803841B (en) * | 2017-02-14 | 2020-04-10 | 北京奇虎科技有限公司 | Method and device for reading message queue data and distributed data storage system |
| CN107070987A (en) * | 2017-03-01 | 2017-08-18 | 网宿科技股份有限公司 | Data capture method and system for distributed objects storage system |
| CN107070987B (en) * | 2017-03-01 | 2020-02-14 | 网宿科技股份有限公司 | Data acquisition method and system for distributed object storage system |
| CN107589917A (en) * | 2017-09-29 | 2018-01-16 | 郑州云海信息技术有限公司 | A kind of distributed memory system and method |
| CN107589917B (en) * | 2017-09-29 | 2020-08-21 | 苏州浪潮智能科技有限公司 | Distributed storage system and method |
| CN107888684A (en) * | 2017-11-13 | 2018-04-06 | 小草数语（北京）科技有限公司 | Distributed system calculating task processing method, device and controller |
| CN109375872A (en) * | 2018-09-27 | 2019-02-22 | 腾讯科技（深圳）有限公司 | Processing method, device and the equipment and storage medium of data access request |
| CN109375872B (en) * | 2018-09-27 | 2020-07-24 | 腾讯科技（深圳）有限公司 | Data access request processing method, device and equipment and storage medium |
| CN110727401A (en) * | 2019-09-09 | 2020-01-24 | 无锡江南计算技术研究所 | Memory access system |
| CN114116553A (en) * | 2021-11-30 | 2022-03-01 | 海光信息技术股份有限公司 | Data processing device, method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106202261A (en) | The distributed approach of a kind of data access request and engine | |
| US20200183932A1 (en) | Optimizing write operations in object schema-based application programming interfaces (apis) | |
| US10116725B2 (en) | Processing data retrieval requests in a graph projection of an application programming interfaces (API) | |
| JP4856627B2 (en) | Partial query caching | |
| CN103714073A (en) | Method and device for querying data | |
| CN104160381A (en) | Managing tenant-specific data sets in a multi-tenant environment | |
| EP2710477B1 (en) | Distributed caching and cache analysis | |
| CN100589079C (en) | Data sharing method, system and device | |
| WO2020024903A1 (en) | Method and device for searching for blockchain data, and computer readable storage medium | |
| CN100378731C (en) | Automatic data consolidation | |
| CN101639776A (en) | Database access and integration method and system thereof | |
| CN106202492A (en) | The Metadata Service optimization method of a kind of NFS and system | |
| CN103607424A (en) | Server connection method and server system | |
| CN104750757B (en) | A kind of date storage method and equipment based on HBase | |
| CN106372266A (en) | Cache and accessing method of cloud operation system based on aspects and configuration documents | |
| CN109656886B (en) | Key value pair-based file system implementation method, device, equipment and storage medium | |
| US9380127B2 (en) | Distributed caching and cache analysis | |
| CN103544300B (en) | A kind of extensible storage index structure in cloud environment realize method | |
| CN104008199A (en) | Data inquiring method | |
| CN103561083B (en) | Internet of things data processing method | |
| CN107491463A (en) | The optimization method and system of data query | |
| CN107704475A (en) | Multilayer distributed unstructured data storage method, querying method and device | |
| CN112800066B (en) | Index management method, related equipment and storage medium | |
| CN109299059A (en) | File storage, search method, device, storage medium and server | |
| CN106549983B (en) | Database access method, terminal and server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161207 |
|
| RJ01 | Rejection of invention patent application after publication |