CN103891244B - A kind of method and device carrying out data storage and search - Google Patents
A kind of method and device carrying out data storage and search Download PDFInfo
- Publication number
- CN103891244B CN103891244B CN201280001730.2A CN201280001730A CN103891244B CN 103891244 B CN103891244 B CN 103891244B CN 201280001730 A CN201280001730 A CN 201280001730A CN 103891244 B CN103891244 B CN 103891244B
- Authority
- CN
- China
- Prior art keywords
- data
- field
- full
- text search
- retrieved
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000013500 data storage Methods 0.000 title claims abstract description 88
- 238000000034 method Methods 0.000 title claims abstract description 74
- 238000003860 storage Methods 0.000 claims abstract description 59
- 239000000203 mixture Substances 0.000 claims description 13
- 238000005520 cutting process Methods 0.000 claims description 10
- 238000007689 inspection Methods 0.000 claims description 8
- 230000010365 information processing Effects 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 abstract 1
- 238000009826 distribution Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 3
- 238000002372 labelling Methods 0.000 description 2
- 239000008186 active pharmaceutical agent Substances 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of method and device carrying out data storage and search, relate to field of information processing, it is capable of needing the data carrying out full-text search and has been made without the data of the full-text search distributed storage in parallel database, having reduced storage redundancy；Meanwhile, it is capable to realize under parallel database the full-text search of data to be retrieved and structuring retrieval, improve recall precision.The present invention includes: control node in parallel database system framework, to need to carry out full-text search data and be made without the data of full-text search store respectively with on different types of back end；And the retrieval request according to client transmission, send different types of search instruction to different types of back end, it is achieved that retrieval execution node can perform to instruct according to different retrievals and data to be retrieved carried out different types of retrieval simultaneously.During the embodiment of the present invention is mainly used in data storage and search.
Description
Technical field
The present invention relates to field of information processing, particularly relate to a kind of method and device carrying out data storage and search.
Background technology
There is different data retrieval demands in different application.For the different data retrieval demand of different application, existing
Some technical schemes are to use structuring retrieval language SQL to retrieve structural data, use existing full-text search to draw
Hold up and unstructured data is carried out full-text search.But, have some application to need a part of information in data is carried out structure
Change retrieval, and after another part information in these data is carried out full-text search, just can obtain the result wanted.Prior art
The technical scheme provided be by by data to be retrieved to being sent in SQL searching system carry out structuring retrieval, and will treat
The data of retrieval send and carry out full-text search to the system of full-text search engine, then obtain facing to two independent searching systems
To retrieval result integrate, when needs allow full-text search engine retrieve substantial amounts of data to be retrieved, in full inspection
The data more much more than data to be retrieved can be produced during rope, significantly reduce full-text search efficiency, thus reduce whole
The recall precision of individual retrieving.
Summary of the invention
Embodiments of the invention provide a kind of method and device carrying out data storage and search, it is achieved that need to carry out entirely
The data of literary composition retrieval and be made without the data of the full-text search distributed storage in parallel database, reduce storage superfluous
Remaining；Meanwhile, it is capable to realize under parallel database the full-text search of data to be retrieved and structuring retrieval, improve retrieval
Efficiency.
For reaching above-mentioned purpose, embodiments of the invention adopt the following technical scheme that
A kind of method carrying out data storage, it is characterised in that described method is applied in parallel database system, described
Parallel database system includes controlling node and back end；Described back end includes full-text search back end and bottom number
According to storehouse node；Described method includes:
Described control node receives the data storage request that client sends；
Tables of data is created according to described data storage request；
Metadata according to described tables of data determines the full-text search field of described tables of data；
According to described full-text search field, send the first instruction data storage to described full-text search back end；Described
First instruction data storage is described by corresponding for the described full-text search field of described full-text search back end storage for indicating
Data；
According to the field beyond described tables of data full-text search field, send the second data to described underlying database node
Storage instruction；Described second instruction data storage is used for indicating described underlying database node to store described tables of data full-text search
The data that other fields beyond field are corresponding.
A kind of method carrying out data retrieval, it is characterised in that be applied in parallel database system, described parallel data
Storehouse system includes controlling node and back end；Described back end includes full-text search back end and underlying database joint
Point；Described method includes:
Described control node receives the retrieval request that client sends；
According to described retrieval request, determine field to be retrieved and tables of data to be retrieved；
Obtain the metadata of tables of data to be retrieved, and according to the metadata of described tables of data to be retrieved, determine described to be checked
Full-text search field in rope field；
According to the full-text search field in described field to be retrieved, send the first retrieval to described full-text search back end
Instruction, described first search instruction retrieves the full text inspection in described field to be retrieved for indicating described full-text search back end
The data that rope field is corresponding；
According to other field beyond full-text search field in described field to be retrieved, send out to described underlying database node
The second search instruction, described second search instruction is sent to be used for indicating in field to be retrieved described in described underlying database Nodes Retrieval
The data that other field beyond full-text search field is corresponding；
The retrieval result that reception full-text search back end and underlying database node each return, and by full-text search number
The retrieval result each returned according to node and underlying database node carries out convergence processing, will converge result as complete retrieval
Result returns to described client.
A kind of control node for carrying out data storage, it is characterised in that be applied in parallel database system, described
Parallel database system includes described control node and back end；Described back end includes full-text search back end and the end
Layer data storehouse node；Described control node includes:
Receive unit, for receiving the data storage request that client sends；
Creating unit, creates tables of data for the data storage request received according to described reception unit；
Determining unit, the metadata of the tables of data for creating according to described creating unit determines the full text of described tables of data
Search field；
Transmitting element, for according to the described full-text search field determining that unit determines, to described full-text search data section
Point sends the first instruction data storage；Described first instruction data storage is used for indicating described by described full-text search back end
Store the data that described full-text search field is corresponding；Determine beyond the tables of data full-text search field that unit determines according to described
Field, sends the second instruction data storage to described underlying database node；Described second instruction data storage is used for indicating institute
State underlying database node and store the data that other fields beyond described tables of data full-text search field are corresponding.
A kind of control node for carrying out data retrieval, it is characterised in that be applied in parallel database system, described
Parallel database system includes controlling node and back end；Described back end includes full-text search back end and bottom number
According to storehouse node；Described control node includes:
Receive unit, for receiving the retrieval request that client sends；
Acquiring unit, for the retrieval request that receives according to described reception unit, obtains field to be retrieved and to be retrieved
Tables of data；
Determine unit, for according to described retrieval request, determine field to be retrieved and tables of data to be retrieved；Treat according to described
The metadata of retrieval tables of data, determines the full-text search field in described field to be retrieved；
Transmitting element, for according to the described full-text search field determined in the field to be retrieved that unit determines, to described
Full-text search back end sends the first search instruction, and described first search instruction is used for indicating described full-text search back end
Retrieve the data that the full-text search field in described field to be retrieved is corresponding；According to the described field to be retrieved determining that unit determines
Other field beyond middle full-text search field, sends the second search instruction, described second inspection to described underlying database node
Suo Zhiling is for indicating in field to be retrieved described in described underlying database Nodes Retrieval other word beyond full-text search field
The data that section is corresponding；
Receive unit, for the retrieval result receiving full-text search back end and underlying database node each returns；
Converge unit, each for full-text search back end and the underlying database node that described reception unit is received
Convergence processing is carried out from the retrieval result returned；
Described transmitting element, is additionally operable to return to described client using converging result as complete retrieval result.
A kind of method and device carrying out data storage and search that the embodiment of the present invention provides, can be at parallel database
In system architecture, store respectively and inhomogeneity needing the data carrying out full-text search and the data being made without full-text search
On the back end of type, it is achieved that the distributed storage to data, for the unified storage mode of prior art, reduce
The redundancy of data storage；Meanwhile, the retrieval request sent according to client, send difference to different types of back end
The search instruction of type, it is achieved that retrieval performs node and can perform to instruct to enter data to be retrieved according to different retrievals simultaneously
The different types of retrieval of row.Compared with the method that prior art provides, the method that the embodiment of the present invention provides is in same system
Middle provide full-text search ability and structuring retrieval capability, it is not necessary to use two independent searching systems to examine simultaneously
Rope, thus simplify searching step, the recall precision of raising.
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
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to
Other accompanying drawing is obtained according to these accompanying drawings.
Fig. 1 is a kind of method flow diagram carrying out data storage in the embodiment of the present invention 1；
Fig. 2 is a kind of method flow diagram carrying out data retrieval in the embodiment of the present invention 1；
Fig. 3 is a kind of method flow diagram carrying out data storage in the embodiment of the present invention 2；
Fig. 4 is the method flow diagram that the another kind in the embodiment of the present invention 2 carries out data storage；
Fig. 5 is a kind of method flow diagram carrying out data retrieval in the embodiment of the present invention 3；
Fig. 6 is a kind of composition frame chart controlling node for carrying out data storage in the embodiment of the present invention 4；
Fig. 7 is that the another kind in the embodiment of the present invention 4 is for carrying out the composition frame chart controlling node of data storage；
Fig. 8 is a kind of composition frame chart controlling node for carrying out data retrieval in the embodiment of the present invention 4；
Fig. 9 is a kind of composition frame chart controlling node for carrying out data storage in the embodiment of the present invention 5；
Figure 10 is a kind of composition frame chart controlling node for carrying out data retrieval in the embodiment of the present invention 5.
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.
Embodiment 1
Embodiments provide a kind of method carrying out data storage and search, it is characterised in that described method should
In parallel database system, described parallel database system includes controlling node and back end；Described back end bag
Include full-text search back end and underlying database node.
Wherein, described back end includes full-text search back end and underlying database node, described full-text search number
Need to carry out, for storage, the data that full-text search field is corresponding according to node, and the data for self storage carry out examining in full
Rope；Described underlying database node is made without, for storage, the data that full-text search field is corresponding, and stores for self
Data carry out structuring retrieval.
In this parallel database system framework, described full-text search back end and underlying database node can be by such as
Lower two kinds of distribution modes:
The first distribution mode: all of full-text search back end is all disposed within a pond, by described bottom
Database node is all disposed within another pond, and the two pond is logically independent, physically can be deployed in two respectively
Individual equipment, it is also possible to be integrated on same equipment.In this manner, the pond storage being provided with full-text search back end needs
The data of full-text search to be carried out, the pond storage being provided with underlying database node is made without the data of full-text search.
The second distribution mode: using a full-text search back end and a underlying database node as a pair joint
Point, is co-located on same data retrieval node.This data retrieval node only includes a full-text search back end
With a underlying database node, and different data retrieval nodes arranges different full-text search back end and bottom number
According to storehouse node.In this manner, the data that the storage of each data retrieval intra-node is different.At same data retrieval node
In, full-text search back end storage needs to carry out the data of full-text search, and underlying database node storage is made without entirely
The data of literary composition retrieval, and, full-text search back end and underlying database node in same data retrieval node are deposited
The data of storage need corresponding identical distribution key assignments etc. to have the information of identification function.
Based on above-mentioned parallel database system framework, embodiments provide a kind of method carrying out data storage,
The method can be realized, as it is shown in figure 1, the method includes by controlling node:
101, the data storage request that client sends is received.
102, tables of data is created according to described data storage request.
Wherein, described tables of data can represent to use structural data storage form, and the content wherein stored is by client
End provides.Table 1 below is the concrete structure of an embodiment of tables of data.
The structure of table 1 tables of data
Wherein, Name, Provider and Summary are field name, and in each row corresponding with each field, storage is just
It is each self-corresponding data of each field.
103, the full-text search field of described tables of data is determined according to the metadata of described tables of data.
Wherein, in all fields indicating tables of data, which is full-text search field to described metadata, and which is not
Full-text search field.The form of expression of metadata can be specifically located in tables of data, and the data identifying the storage of each field are
The no greatest length exceeding its field, or, metadata is set to one corresponding with tables of data, but be arranged on outside tables of data
The tables of data of separate storage.Metadata could be arranged to which the combination method for expressing such as " 0 " " 1 " or " yes " " no " represents
Which need not to need to carry out full-text search, and such as, " 0 " then represents and need not, and " 1 " then represents needs；Or, " no " then table
Showing and need not, " yes " then represents needs.
Wherein, the described metadata according to described tables of data determine described tables of data full-text search field can by with
Lower two kinds of methods realize, and specifically include:
First method: if the data of the field storage of described tables of data exceed the greatest length of described field, the most really
Fixed described field is full-text search field.
Method in second: if the keyword in good grounds index field is retrieved in described tables of data, it is determined that
Described field is full-text search field.
Wherein, described first method is to add up by controlling the node data length that stores each field, and with respectively
The greatest length of field compares, and determines full-text search field and non-full-text search field, and by controlling node to each word
The type of section is identified.
Second method is that the keyword in index field is identified by client, and controls node and be only used for storage
These marks, and identify the implication of these labellings.Such as, it is " value " that client arranges index field, and as " value=0 "
Time correspondence be made without the field of full-text search, as " value=1 ", in requisition for the field carrying out full-text search.Then control
Node processed just identifies each field according to this corresponding relation.
104, according to described full-text search field, the first instruction data storage is sent to described full-text search back end；
Described first instruction data storage is used for indicating and described described full-text search back end is stored described full-text search field pair
The data answered.
Wherein, described first instruction data storage is the inspection of described full text specifically for indicating described full-text search back end
Rope field creates index or updates the index of described full-text search back end storage.
105, according to the field beyond described tables of data full-text search field, second is sent to described underlying database node
Instruction data storage；Described second instruction data storage is used for indicating described underlying database node to store described tables of data in full
The data that other fields beyond search field are corresponding.
Wherein, described second instruction data storage is deposited specifically for indicating underlying database node to carry out structural data
Storage.
Based on above-mentioned parallel database system framework, embodiments provide a kind of method carrying out data retrieval,
The method is realized by controlling node, as in figure 2 it is shown, the method includes；
201, the retrieval request that client sends is received.
Wherein, described retrieval request can be the standard queries statement that SQL specifies, such as " Selectid, name from
A where comment Like ' roman ' group by name ", this statement meaning is for inquiring about " comment " bag from Table A
Containing id and name that " roman " is corresponding, and it is ranked up with name.
202, according to described retrieval request, field to be retrieved and tables of data to be retrieved are determined.
203, obtain the metadata of tables of data to be retrieved, and according to the metadata of described tables of data to be retrieved, determine described
Full-text search field in field to be retrieved.
Wherein, the described metadata according to described tables of data to be retrieved, determine the full-text search in described field to be retrieved
The realization of field can be realized by following two method, specifically includes:
First method: deposit in described tables of data to be retrieved if there is at least one field in described field to be retrieved
The data of storage exceed the greatest length of at least one field described, it is determined that at least one field described is full-text search field.
Second method, if described field to be retrieved there is a need to carry out retrieving according to the keyword in index field
During field, it is determined that described needs are full-text search field according to the field that the keyword in index field carries out retrieving.
What deserves to be explained is, first method and second method are for the identification of full-text search field, with above-mentioned steps
The method of the how labelling full-text search field described in 103 is corresponding.
204, according to the full-text search field in described field to be retrieved, first is sent to described full-text search back end
Search instruction, described first search instruction is complete for indicate described full-text search back end to retrieve in described field to be retrieved
The data that literary composition search field is corresponding.
205, according to other field beyond full-text search field in described field to be retrieved, save to described underlying database
Point sends the second search instruction, and described second search instruction is used for indicating word to be retrieved described in described underlying database Nodes Retrieval
The data that in Duan, other field beyond full-text search field is corresponding.
Wherein, the first search instruction here, after referring to that full-text search back end receives searching request, for request
In search key, scanning inverted index table process.This search instruction mainly comprises the following information that
1) currently used segmenter type, such as WhitespaceAnalyzer, StandardAnalyzer,
SimpleAnalyzer, ChineseAnalyzer etc..
2) keyword carried in this time request, such as q=" what is search engine ", crucial
Word is exactly search, engine, and " what ", " is " is filtered in stop words mode.
3) whether carry out spell check, such as " aplle ", if carried out spell check, then system compensation is "
apple″
4) whether comprise synonym, such as " father ", if comprising synonym, then system will increase " father ", " dry
Father " scans for.
5) search hit score calculates, the size of this value, determines the sequence of retrieval result.
Here the second search instruction refers to a specific set inquiring about data base's sequence of operations to be performed,
The each step performing instruction describes a specific database manipulation such as tablescan, join, aggregation, sort
Deng.
The instruction of one complete database retrieval, mainly includes following information:
1) Cost: when data are retrieved, the assessment to system resources consumption；
2) rows: retrieval returns the assessment of total line number of result.Reflect the selection estimating any WHERE clause condition
Property.
3) width: the assessment of the total bytes of total line number that retrieval returns, the data set that reflection meets search condition is big
Little.
206, the retrieval result that reception full-text search back end and underlying database node each return.
207, the retrieval result that full-text search back end and underlying database node each return is carried out convergence processing.
Wherein, the described retrieval result returning each back end carries out the implementation method of convergence processing and can be: root
Equivalent connection is carried out according to a specific field.Such as, such as table 2 below, shown in 3,4, table 2 represents and obtains at full-text search back end
To retrieval result be id field value be 2,3；The retrieval result that table 3 underlying database node obtains be id field value be 1,2,3
And the information of the Name field of correspondence, then according to the value of id field, the retrieval result that id field value is 2,3 can be merged into one
In individual table, as shown in table 4.
Table 2 full-text search Nodes Retrieval result
| Id |
| 3 |
| 2 |
Table 3 underlying database Nodes Retrieval result
| Id | Name |
| 1 | Notorious |
| 2 | Titanic |
| 3 | Gift |
The retrieval result that table 4 is complete
| id | name |
| 3 | Gift |
| 2 | Titanic |
It should be noted that in the present embodiment, it is only a kind of in conjunction with the collecting processing method described with above-mentioned table 2,3,4
Example.
208, described client is returned to converging result as complete retrieval result.
A kind of method carrying out data storage and search that the embodiment of the present invention provides, can be at parallel database system frame
In structure, store respectively and different types of number needing the data carrying out full-text search and the data being made without full-text search
According on node, it is achieved that the distributed storage to data, for the unified storage mode of prior art, reduce data
The redundancy of storage；Meanwhile, the retrieval request sent according to client, send different types of to different types of back end
Search instruction, it is achieved that retrieval performs node can carry out difference to data to be retrieved according to different retrieval execution instructions simultaneously
The retrieval of type.Compared with the method that prior art provides, the while that the method that the embodiment of the present invention provides being in same system
Provide full-text search ability and structuring retrieval capability, it is not necessary to use two independent searching systems to retrieve, thus
Simplify searching step, the recall precision of raising.
Embodiment 2
Based on the full-text search back end described in embodiment 1 and the first distribution mode of underlying database node,
Embodiments providing a kind of method carrying out data storage, the method has control node to realize, as it is shown on figure 3, the party
Method includes:
301, the data storage request that client sends is received.
302, tables of data is created according to described data storage request.
Wherein, the relevant description of described tables of data is identical with the relevant description in described step 102, the embodiment of the present invention pair
This repeats no more.
303, the full-text search field of described tables of data is determined according to the metadata of described tables of data.
Wherein, relevant description and the realization of described metadata determines described tables of data according to the metadata of described tables of data
The method of full-text search field identical with the relevant description in above-mentioned steps 103, this is repeated no more by the embodiment of the present invention.
304, according to described full-text search field, the first instruction data storage is sent to described full-text search back end；
Described first instruction data storage is used for indicating and described described full-text search back end is stored described full-text search field pair
The data answered.
305, according to the field beyond described tables of data full-text search field, second is sent to described underlying database node
Instruction data storage；Described second instruction data storage is used for indicating described underlying database node to store described tables of data in full
The data that other fields beyond search field are corresponding.
Further, what deserves to be explained is, the step 304 herein recorded and 305 does not require obvious elder generation on execution sequence
Rear order.
Further, what deserves to be explained is, during performing above-mentioned steps 303, however, it is determined that without wanting full-text search
Field then only carries out step 305.During if it is determined that all need to carry out full-text search field, then only carry out step 304 i.e.
Can.
It addition, what deserves to be explained is, bigger at client terminal quantity, when data volume to be stored is bigger, such as implementing
Parallel database system framework described in example 1 can be provided with data load services device, load clothes including full-text search data
Business device and underlying database load server.Wherein, described full-text search data load services device is in the control controlling node
Under system, it is loaded into full-text search back end by tables of data needing carry out data corresponding to full-text search field, so that entirely
Literary composition retrieval back end storage corresponding data；Underlying database load server is under the control controlling node, by data
Table is made without data corresponding to full-text search field and is loaded into underlying database node, so that underlying database node
Storage corresponding data.
Now, the concrete steps of described step 304 then include: control node by tables of data by row cutting, it would be desirable in full
The row field of retrieval is divided into together, then generates corresponding data loading tasks according to ready-portioned field and sends to inspection in full
In rope data load services device, full-text search data load services device is according to the Distribution Strategy pre-seted, it would be desirable to full-text search
Data corresponding to row field distribute to different full-text search back end and store.
Wherein, described full-text search data loading tasks, is that unstructured data or the needs of application are supported inspection in full
The data of rope store the process of text searching server, it is common that refer to create the process of inverted index.If structuring number
According to, the most directly by participle, filter, create inverted index table, the most also comprise data message and extract process.The number of full-text search
Not having strict industry standard according to loading, generally open to the outside world privately owned API, completes the establishment of data directory.
Wherein, the Distribution Strategy pre-seted could be arranged to the information of different back end storage different regions, such as,
Node 1 stores Pekinese's information, and node 2 stores the information etc. in Shanghai.Distribution Strategy can be configured according to actual needs, this
This is not limited by bright embodiment.
Same, the concrete steps of described step 305 then include: control node by tables of data by row cutting, will be not required to
The row field wanting full-text search is divided into together, then generates corresponding data loading tasks according to ready-portioned field and sends extremely
In bottom data loading of databases load server, underlying database load server, will not according to the Distribution Strategy pre-seted
The data needing the row field of full-text search corresponding are distributed to different underlying database nodes and are stored.
Wherein, bottom data database data loading tasks, is to load statement COPY FROM by the SQL of standard to complete application
Concrete data in the storage of underlying database, such as:
COPY tableA FROM′/opt/data/datainfo.tbl′DELIMITERS′|′；
Wherein, tableA represents the tables of data that needs load, and/opt/data/datainfo.tbl represents data to be loaded
Concrete path, ' | ' represent data line multiple fields between separator.Referring specifically to SQL standard 99.If created
Create index during table, then, during data load, the index simultaneously having also needed to tables of data generates.
It addition, what deserves to be explained is, for ensureing the retrieval result of full-text search back end and underlying database node
Retrieval result can merge, during carrying out data loading tasks generation, in addition it is also necessary to determines which field is main key
Spoon field, i.e. master key field, these fields are for representing that the association being stored between the data in different nodes is closed
System.Specifically when carrying out data storage, the number that full-text search back end is corresponding except to store the field needing full-text search
According to, it is necessary to the data that storage master key field is corresponding, the storage method of underlying database node is similar to.
The embodiment of the present invention additionally provides a kind of method carrying out data storage, and the method is applied to as described in embodiment
Full-text search back end and underlying database node the second distribution mode in, as shown in Figure 4, in this method,
Before described step 303 determines the full-text search field of described tables of data according to the metadata of described tables of data, also include step
Described tables of data is pressed row cutting by 306；The most described step 303 determines the complete of described tables of data according to the metadata of described tables of data
Literary composition search field can be replaced by following step 307, and described step 307 is the data that often row needs storage, according to described data
The metadata of table determines the described full-text search field often gone.Based on full-text search number in the execution of other step and the present embodiment
The method that carry out data storage corresponding with the first distribution mode of underlying database node according to node is identical.
The embodiment of the present invention provide a kind of method carrying out data storage, can in parallel database system framework,
Store respectively and different types of data section needing the data carrying out full-text search and the data being made without full-text search
On point, it is achieved that the distributed storage to data, for the unified storage mode of prior art, reduce data storage
Redundancy.
Embodiment 3
In the present embodiment, the tables of data controlling node establishment represents with tables of data as shown in table 5 below, this tables of data
Table name is A, has three different fields id, name, comment, and wherein, id is masterkey field, comment field
Need full-text search.Id field and name field are stored in underlying database node, and id field and comment field are stored in
In full-text search node.
Table 5 tables of data to be retrieved
Based on this tables of data to be retrieved, the method carrying out data retrieval that the embodiment of the present invention provides, as it is shown in figure 5, wrap
Include:
401, control node and receive the retrieval request that client sends.In the present embodiment, the language that this retrieval request is corresponding
Sentence is Select id, name from A where comment Like ' roman ' group byname, and this statement meaning is
From Table A, inquire about " comment " comprise id and name that " roman " is corresponding, and be ranked up with name.
402, control node is according to described retrieval request, determines field to be retrieved and tables of data to be retrieved.
403, control node and obtain the metadata of tables of data to be retrieved, and according to the metadata of described tables of data to be retrieved,
Determine the full-text search field in described field to be retrieved.
404, control node is according to the full-text search field in described field to be retrieved, to described full-text search back end
Send the first search instruction.
405, control node is according to other field beyond full-text search field in described field to be retrieved, to described bottom
Database node sends the second search instruction.
406, full-text search back end is according to described first search instruction, treats storage in full-text search back end
Retrieval data are retrieved, and obtain full-text search Nodes Retrieval result.
407, underlying database node is according to described second search instruction, the number to be retrieved to the storage of underlying database node
According to retrieving, obtain underlying database Nodes Retrieval result.
In the present embodiment, full-text search Nodes Retrieval result is as shown in table 6 below, and underlying database Nodes Retrieval result is such as
Shown in table 7 below.
Table 6 full-text search Nodes Retrieval result
| Id |
| 3 |
| 2 |
Table 7 underlying database Nodes Retrieval result
| Id | Name |
| 1 | Notorious |
| 2 | Titanic |
| 3 | Gift |
408, control node and receive full-text search Nodes Retrieval result and the bottom data that full-text search back end sends
The underlying database Nodes Retrieval result that storehouse node sends.
409, full-text search Nodes Retrieval result and bottom number that the node full-text search node to receiving sends are controlled
The underlying database Nodes Retrieval result sent according to storehouse node carries out convergence processing, obtains complete retrieval result.In this enforcement
In example, the complete retrieval result herein obtained is as shown in table 8 below.
The retrieval result that table 8 is complete
| id | name |
| 3 | Gift |
| 2 | Titanic |
410, control node to send described complete retrieval result to client.
It should be noted that the retrieval result described in above-mentioned table 6 to table 8 is based on the first described in embodiment 1 point
The retrieval result that mode for cloth produces, the pond that i.e. full-text search node is corresponding returns to control one full-text search result of node, the end
The pond that layer data storehouse node is corresponding returns to control one bottom data retrieval result of node, is retrieved this two class by controlling node
Result carries out convergence processing.
If based on the second distribution mode described in embodiment 1, the most each data retrieval node can return oneself
If retrieval result is provided with data retrieval node 1, data retrieval node 2 and data retrieval node 3, in each data retrieval node
Be respectively arranged with a full-text search back end and a underlying database node, then the retrieval result of three data retrieval nodes is permissible
If table 9 below is to shown in table 11.
Table 9 data retrieval node 1 retrieves result:
| id | name |
| null | null |
Table 10 data retrieval node 2 retrieves result:
| id | name |
| 2 | Titanic |
Table 11 data retrieval node 3 retrieves result:
| id | name |
| 3 | Gift |
Now, these three, after receiving the retrieval result that these three data retrieval node sends, can be examined by control node
Hitch fruit carries out convergence processing and obtains complete retrieval result.Retrieval result is as above-mentioned table 8.
The embodiment of the present invention provide a kind of method carrying out data retrieval, can in parallel database system framework,
The retrieval request sent according to client, sends different types of search instruction to different types of back end, it is achieved that inspection
Suo Zhihang node can perform instruction according to different retrievals and data to be retrieved be carried out different types of retrieval simultaneously.With existing
The method that technology provides is compared, and the method that the embodiment of the present invention provides provides full-text search ability in same system simultaneously
With structuring retrieval capability, it is not necessary to use two independent searching systems to retrieve, thus simplify searching step, improve
Recall precision.
Embodiment 4
Embodiments provide a kind of control node for carrying out data storage, can apply to parallel database
In system, described parallel database system includes described control node and back end；Described back end includes full-text search
Back end and underlying database node；As shown in Figure 6, described control node includes: receive unit 51, creating unit 52, really
Cell 53, transmitting element 54.
Receive unit 51, for receiving the data storage request that client sends.
Creating unit 52, creates tables of data for the data storage request received according to described reception unit 51
Determining unit 53, the metadata of the tables of data for creating according to described creating unit 52 determines described tables of data
Full-text search field.
Transmitting element 54, for according to the described full-text search field determining that unit 53 determines, to described full-text search number
The first instruction data storage is sent according to node；Described first instruction data storage is used for indicating described by described full-text search data
Node stores the data that described full-text search field is corresponding；According to the described tables of data full-text search field determining that unit 53 determines
Field in addition, sends the second instruction data storage to described underlying database node；Described second instruction data storage is used for
Described underlying database node is indicated to store the data that other fields beyond described tables of data full-text search field are corresponding.
Optionally, described determine that unit 53 exceedes described word specifically for the data stored in the field of described tables of data
Section greatest length time, determine that described field is full-text search field；The pass in good grounds index field in described tables of data
When key word is retrieved, determine that described field is full-text search field.
Optionally, as it is shown in fig. 7, described control node also includes: cutting unit 55.
Described, cutting unit 55, for determining that unit 53 determines described tables of data according to the metadata of described tables of data
Before full-text search field, described tables of data is pressed row cutting.
Described determine unit 53, be additionally operable to often row is needed the data of storage, determine according to the metadata of described tables of data
The described full-text search field often gone.
Optionally, described first instruction data storage is used for indicating and described described full-text search back end is stored institute
State the data that full-text search field is corresponding, specifically include: indicating described full-text search back end is described full-text search field
Create index or update the index of described full-text search back end storage.
The embodiment of the present invention additionally provides a kind of control node for carrying out data retrieval, can apply to parallel data
In the system of storehouse, described parallel database system includes controlling node and back end；Described back end includes full-text search number
According to node and underlying database node；As shown in Figure 8, described control node includes: receives unit 61, acquiring unit 62, determine
Unit 63, transmitting element 64, reception unit 65, convergence unit 66.
Receive unit 61, for receiving the retrieval request that client sends.
Acquiring unit 62, for the retrieval request received according to described reception unit 61, obtains field to be retrieved and treats
Retrieval tables of data.
Determine unit 63, for according to described retrieval request, determine field to be retrieved and tables of data to be retrieved；According to described
The metadata of tables of data to be retrieved, determines the full-text search field in described field to be retrieved.
Transmitting element 64, for according to the described full-text search field determined in the field to be retrieved that unit 63 determines, to
Described full-text search back end sends the first search instruction, and described first search instruction is used for indicating described full-text search data
The data that full-text search field in field to be retrieved described in Nodes Retrieval is corresponding；To determine that unit 63 determines to be checked according to described
Other field beyond full-text search field in rope field, sends the second search instruction to described underlying database node, described
Second search instruction is for indicating in field to be retrieved described in described underlying database Nodes Retrieval beyond full-text search field
The data that other field is corresponding.
Receive unit 65, for the retrieval knot receiving full-text search back end and underlying database node each returns
Really.
Converge unit 66, for the full-text search back end received by described reception unit 65 and underlying database joint
The retrieval result that point each returns carries out convergence processing.
Described transmitting element 64, is additionally operable to return to described client using converging result as complete retrieval result.
Optionally, described determine that unit 63 is specifically for existing at least one field in institute in described field to be retrieved
State the data of storage in tables of data to be retrieved and exceed the greatest length of at least one field described, determine at least one field described
For full-text search field；Described field to be retrieved there is a need to carry out, according to the keyword in index field, the field retrieved
Time, determine that described needs are full-text search field according to the field that the keyword in index field carries out retrieving.
A kind of device carrying out data storage and search that the embodiment of the present invention provides, can be at parallel database system frame
In structure, store respectively and different types of number needing the data carrying out full-text search and the data being made without full-text search
According on node, it is achieved that the distributed storage to data, for the unified storage mode of prior art, reduce data
The redundancy of storage；Meanwhile, the retrieval request sent according to client, send different types of to different types of back end
Search instruction, it is achieved that retrieval performs node can carry out difference to data to be retrieved according to different retrieval execution instructions simultaneously
The retrieval of type.Compared with the method that prior art provides, the while that the method that the embodiment of the present invention provides being in same system
Provide full-text search ability and structuring retrieval capability, it is not necessary to use two independent searching systems to retrieve, thus
Simplify searching step, the recall precision of raising.
Embodiment 5
Embodiments provide a kind of control node for carrying out data storage, can apply to parallel database
In system, described parallel database system includes described control node and back end；Described back end includes full-text search
Back end and underlying database node；As it is shown in figure 9, described control node includes: processor 71, memorizer 72.
Processor 71, for receiving the data storage request that client sends；Number is created according to described data storage request
According to table；Metadata according to described tables of data determines the full-text search field of described tables of data；According to described full-text search field,
The first instruction data storage is sent to described full-text search back end；Described first instruction data storage is used for indicating described general
Described full-text search back end stores the data that described full-text search field is corresponding；According to described tables of data full-text search field
Field in addition, sends the second instruction data storage to described underlying database node；Described second instruction data storage is used for
Described underlying database node is indicated to store the data that other fields beyond described tables of data full-text search field are corresponding.
Memorizer 72, for storing data storage request, the metadata of tables of data, the first instruction data storage and the second number
According to storage instruction.
Optionally, described processor 71 exceedes described field specifically for the data stored in the field of described tables of data
Greatest length time, determine that described field is full-text search field；The key in good grounds index field in described tables of data
When word is retrieved, determine that described field is full-text search field.
Optionally, described processor is additionally operable at the full text determining described tables of data according to the metadata of described tables of data
Before search field, described tables of data is pressed row cutting.Often row is needed the data of storage, according to the metadata of described tables of data
Determine the described full-text search field often gone.
Optionally, described first instruction data storage is used for indicating and described described full-text search back end is stored institute
State the data that full-text search field is corresponding, specifically include: indicating described full-text search back end is described full-text search field
Create index or update the index of described full-text search back end storage.
The embodiment of the present invention additionally provides a kind of control node for carrying out data retrieval, can apply to parallel data
In the system of storehouse, described parallel database system includes controlling node and back end；Described back end includes full-text search number
According to node and underlying database node as shown in Figure 10, described control node includes: processor 73 and memorizer 74.
Described processor 73, for receiving the retrieval request that client sends；According to described retrieval request, determine to be retrieved
Field and tables of data to be retrieved；Obtain the metadata of tables of data to be retrieved, and according to the metadata of described tables of data to be retrieved, really
Full-text search field in fixed described field to be retrieved；According to the full-text search field in described field to be retrieved, to described entirely
Literary composition retrieval back end sends the first search instruction, and described first search instruction is used for indicating described full-text search data section spot check
The data that full-text search field in Suo Suoshu field to be retrieved is corresponding；According to full-text search field in described field to be retrieved with
Other outer field, sends the second search instruction to described underlying database node, and described second search instruction is used for indicating institute
State in field to be retrieved described in underlying database Nodes Retrieval the data that other field beyond full-text search field is corresponding；Receive
The retrieval result that full-text search back end and underlying database node each return, and by full-text search back end and bottom
The retrieval result that database node each returns carries out convergence processing, returns to institute using converging result as complete retrieval result
State client.
Described memorizer 74, for memory scan request, the metadata of described tables of data to be retrieved, the first search instruction,
Second search instruction and retrieval result.
Optionally, specifically for there is at least one field described in described processor 73 in described field to be retrieved
In tables of data to be retrieved, the data of storage exceed the greatest length of at least one field described, determine that at least one field described is
Full-text search field；When there is a need to carry out, according to the keyword in index field, the field retrieved in described field to be retrieved,
Determine that described needs are full-text search field according to the field that the keyword in index field carries out retrieving.
A kind of device carrying out data storage and search that the embodiment of the present invention provides, can be at parallel database system frame
In structure, store respectively and different types of number needing the data carrying out full-text search and the data being made without full-text search
According on node, it is achieved that the distributed storage to data, for the unified storage mode of prior art, reduce data
The redundancy of storage；Meanwhile, the retrieval request sent according to client, send different types of to different types of back end
Search instruction, it is achieved that retrieval performs node can carry out difference to data to be retrieved according to different retrieval execution instructions simultaneously
The retrieval of type.Compared with the method that prior art provides, the while that the method that the embodiment of the present invention provides being in same system
Provide full-text search ability and structuring retrieval capability, it is not necessary to use two independent searching systems to retrieve, thus
Simplify searching step, the recall precision of raising.
Through the above description of the embodiments, those skilled in the art is it can be understood that can borrow to the present invention
The mode helping software to add required common hardware realizes, naturally it is also possible to by hardware, but a lot of in the case of the former is more preferably
Embodiment.Based on such understanding, the portion that prior art is contributed by technical scheme the most in other words
Dividing and can embody with the form of software product, this computer software product is stored in the storage medium that can read, such as meter
The floppy disk of calculation machine, hard disk or CD etc., including some instructions with so that computer equipment (can be personal computer,
Server, or the network equipment etc.) perform the method described in each embodiment of the present invention.
The above, the only detailed description of the invention of the present invention, but protection scope of the present invention is not limited thereto, and any
Those familiar with the art, in the technical scope that the invention discloses, can readily occur in change or replace, should contain
Cover within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with described scope of the claims.
Claims (12)
1. the method carrying out data storage, it is characterised in that described method is applied in parallel database system, described also
Row Database Systems include controlling node and back end；Described back end includes full-text search back end and bottom data
Storehouse node；Described method includes:
Described control node receives the data storage request that client sends；
Tables of data is created according to described data storage request；
Metadata according to described tables of data determines the full-text search field of described tables of data；
According to described full-text search field, send the first instruction data storage to described full-text search back end；Described first
Instruction data storage stores, for indicating described full-text search back end, the data that described full-text search field is corresponding；
According to the field beyond described tables of data full-text search field, send the second data storage to described underlying database node
Instruction；Described second instruction data storage is used for indicating described underlying database node to store described tables of data full-text search field
The data that other fields in addition are corresponding.
Method the most according to claim 1, it is characterised in that the described metadata according to described tables of data determines described number
According to the full-text search field of table, specifically include:
If the data of the field storage of described tables of data exceed the greatest length of described field, it is determined that described field is in full
Search field；Or,
If the keyword in good grounds index field is retrieved in described tables of data, it is determined that described field is inspection in full
Rope field.
Method the most according to claim 1 and 2, it is characterised in that also include:
Before determine the full-text search field of described tables of data according to the metadata of described tables of data, by described tables of data by row
Cutting；
Then determine the full-text search field of described tables of data according to the metadata of described tables of data, specifically include:
Often row is needed the data of storage, determines the described full-text search field often gone according to the metadata of described tables of data.
Method the most according to claim 1, it is characterised in that described first instruction data storage is used for indicating described full text
Retrieval back end stores the data that described full-text search field is corresponding, specifically includes:
Indicating described full-text search back end is that described full-text search field creates index or updates described full-text search number
Index according to node storage.
5. the method carrying out data retrieval, it is characterised in that be applied in parallel database system, described parallel database
System includes controlling node and back end；Described back end includes full-text search back end and underlying database node；
Described method includes:
Described control node receives the retrieval request that client sends；
According to described retrieval request, determine field to be retrieved and tables of data to be retrieved；
Obtain the metadata of tables of data to be retrieved, and according to the metadata of described tables of data to be retrieved, determine described word to be retrieved
Full-text search field in Duan；
According to the full-text search field in described field to be retrieved, send the first retrieval to described full-text search back end and refer to
Order, described first search instruction retrieves the full-text search in described field to be retrieved for indicating described full-text search back end
The data that field is corresponding；
According to other field beyond full-text search field in described field to be retrieved, send the to described underlying database node
Two search instructions, described second search instruction is used for indicating in field to be retrieved described in described underlying database Nodes Retrieval in full
The data that other field beyond search field is corresponding；
The retrieval result that reception full-text search back end and underlying database node each return, and by full-text search data section
The retrieval result that point and underlying database node each return carries out convergence processing, will converge result as complete retrieval result
Return to described client.
Method the most according to claim 5, it is characterised in that the described metadata according to described tables of data to be retrieved, really
Full-text search field in fixed described field to be retrieved includes:
If described field to be retrieved existing the data that at least one field stores in described tables of data to be retrieved exceed institute
State the greatest length of at least one field, it is determined that at least one field described is full-text search field；Or,
If described field to be retrieved there is a need to carry out, according to the keyword in index field, the field retrieved, it is determined that institute
The field that stating needs to carry out retrieving according to the keyword in index field is full-text search field.
7. one kind for carrying out the control node of data storage, it is characterised in that is applied in parallel database system, described also
Row Database Systems include described control node and back end；Described back end includes full-text search back end and bottom
Database node；Described control node includes:
Receive unit, for receiving the data storage request that client sends；
Creating unit, creates tables of data for the data storage request received according to described reception unit；
Determining unit, the metadata of the tables of data for creating according to described creating unit determines the full-text search of described tables of data
Field；
Transmitting element, for according to the described full-text search field determining that unit determines, sends out to described full-text search back end
Send the first instruction data storage；Described first instruction data storage is used for indicating the storage of described full-text search back end described entirely
The data that literary composition search field is corresponding；According to the described field determined beyond the tables of data full-text search field that unit determines, to institute
State underlying database node and send the second instruction data storage；Described second instruction data storage is used for indicating described bottom data
Storehouse node stores the data that other fields beyond described tables of data full-text search field are corresponding.
Control node the most according to claim 7, it is characterised in that described determine that unit is specifically in described tables of data
The data of field storage when exceeding the greatest length of described field, determine that described field is full-text search field；At described number
When retrieving according to the keyword in index field with good grounds in table, determine that described field is full-text search field.
9. according to the control node described in claim 7 or 8, it is characterised in that described control node also includes:
Described, cutting unit, for determining that unit determines the full-text search of described tables of data according to the metadata of described tables of data
Before field, described tables of data is pressed row cutting；
Described determine unit, be additionally operable to often row is needed the data of storage, according to the metadata of described tables of data determine described often
The full-text search field of row.
Control node the most according to claim 7, it is characterised in that described first instruction data storage is used for indicating institute
State full-text search back end and store the data that described full-text search field is corresponding, specifically include: indicate described full-text search number
It is that described full-text search field creates index or updates the index of described full-text search back end storage according to node.
11. 1 kinds for carrying out the control node of data retrieval, it is characterised in that is applied in parallel database system, described
Parallel database system includes controlling node and back end；Described back end includes full-text search back end and bottom number
According to storehouse node；Described control node includes:
Receive unit, for receiving the retrieval request that client sends；
Acquiring unit, for the retrieval request received according to described reception unit, obtains field to be retrieved and data to be retrieved
Table；
Determine unit, for according to described retrieval request, determine field to be retrieved and tables of data to be retrieved；According to described to be retrieved
The metadata of tables of data, determines the full-text search field in described field to be retrieved；
Transmitting element, for according to the described full-text search field determined in the field to be retrieved that unit determines, to described full text
Retrieval back end sends the first search instruction, and described first search instruction is used for indicating described full-text search back end to retrieve
The data that full-text search field in described field to be retrieved is corresponding；According to described determine in the field to be retrieved that unit determines complete
Other field beyond literary composition search field, sends the second search instruction to described underlying database node, and described second retrieval refers to
Order is for indicating in field to be retrieved described in described underlying database Nodes Retrieval other field pair beyond full-text search field
The data answered；
Receive unit, for the retrieval result receiving full-text search back end and underlying database node each returns；
Converge unit, each return for full-text search back end and the underlying database node that described reception unit is received
The retrieval result returned carries out convergence processing；Described transmitting element, is additionally operable to return converging result as complete retrieval result
To described client.
12. control nodes according to claim 11, it is characterised in that described determine that unit is specifically for described to be checked
Rope field exists the data that at least one field stores in described tables of data to be retrieved and exceedes at least one field described
Greatest length, determines that at least one field described is full-text search field；Described field to be retrieved there is a need to according to index
When keyword in field carries out the field retrieved, determine that described needs carry out the word retrieved according to the keyword in index field
Section is full-text search field.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2012/080963 WO2014036684A1 (en) | 2012-09-04 | 2012-09-04 | Method and device for storing and retrieving data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103891244A CN103891244A (en) | 2014-06-25 |
| CN103891244B true CN103891244B (en) | 2016-11-16 |
Family
ID=50236434
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201280001730.2A Active CN103891244B (en) | 2012-09-04 | 2012-09-04 | A kind of method and device carrying out data storage and search |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103891244B (en) |
| WO (1) | WO2014036684A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107239568B (en) * | 2017-06-27 | 2020-04-14 | 石化盈科信息技术有限责任公司 | Distributed index implementation method and device |
| CN110019231B (en) * | 2017-12-26 | 2021-06-04 | 中国移动通信集团山东有限公司 | Method and node for dynamic association of parallel databases |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5717912A (en) * | 1993-01-13 | 1998-02-10 | Novell, Inc. | Method and apparatus for rapid full text index creation |
| CN1987853A (en) * | 2005-12-23 | 2007-06-27 | 北大方正集团有限公司 | Searching method for relational data base and full text searching combination |
| CN101894143A (en) * | 2010-06-28 | 2010-11-24 | 北京用友政务软件有限公司 | Federated search and search result integrated display method and system |
| CN101916280A (en) * | 2010-08-17 | 2010-12-15 | 上海云数信息科技有限公司 | Parallel computing system and method for carrying out load balance according to query contents |
| CN102025550A (en) * | 2010-12-20 | 2011-04-20 | 中兴通讯股份有限公司 | System and method for managing data in distributed cluster |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001092831A (en) * | 1999-09-21 | 2001-04-06 | Toshiba Corp | Device and method for document retrieval |
| CN102054007B (en) * | 2009-11-10 | 2012-10-31 | 北大方正集团有限公司 | Searching method and searching device |
| CN102136003A (en) * | 2011-03-25 | 2011-07-27 | 上海交通大学 | Large-scale distributed storage system |
| CN102265277B (en) * | 2011-06-01 | 2014-03-05 | 华为技术有限公司 | Operation method and device for data memory system |
-
2012
- 2012-09-04 CN CN201280001730.2A patent/CN103891244B/en active Active
- 2012-09-04 WO PCT/CN2012/080963 patent/WO2014036684A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5717912A (en) * | 1993-01-13 | 1998-02-10 | Novell, Inc. | Method and apparatus for rapid full text index creation |
| CN1987853A (en) * | 2005-12-23 | 2007-06-27 | 北大方正集团有限公司 | Searching method for relational data base and full text searching combination |
| CN101894143A (en) * | 2010-06-28 | 2010-11-24 | 北京用友政务软件有限公司 | Federated search and search result integrated display method and system |
| CN101916280A (en) * | 2010-08-17 | 2010-12-15 | 上海云数信息科技有限公司 | Parallel computing system and method for carrying out load balance according to query contents |
| CN102025550A (en) * | 2010-12-20 | 2011-04-20 | 中兴通讯股份有限公司 | System and method for managing data in distributed cluster |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2014036684A1 (en) | 2014-03-13 |
| CN103891244A (en) | 2014-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10810191B2 (en) | Limiting scans of loosely ordered and/or grouped relations in a database | |
| CN106547796B (en) | Database execution method and device | |
| US7689553B2 (en) | Execution cost reduction of sampled queries in a database | |
| CN102163218B (en) | Graph-index-based graph database keyword vicinity searching method | |
| CN103729471B (en) | Data base query method and device | |
| US9146983B2 (en) | Creating a semantically aggregated index in an indexer-agnostic index building system | |
| US10853361B2 (en) | Scenario based insights into structure data | |
| CN102831122B (en) | Data storage method, inquiring method and inquiring device for workflow table | |
| US10970300B2 (en) | Supporting multi-tenancy in a federated data management system | |
| US9342572B2 (en) | Workflow processing system and method with database system support | |
| CN106777108A (en) | A kind of data query method and apparatus based on mixing storage architecture | |
| US8843507B2 (en) | Serving multiple search indexes | |
| Abraham et al. | Distributed storage and querying techniques for a semantic web of scientific workflow provenance | |
| CN106484694B (en) | Full-text search method and system based on distributed data base | |
| CN104239377A (en) | Platform-crossing data retrieval method and device | |
| Bota et al. | Composite retrieval of heterogeneous web search | |
| CN105164673A (en) | Query integration across databases and file systems | |
| CN109740034A (en) | The case-involving information query method of enterprise and device based on graphic data base | |
| US20140372412A1 (en) | Dynamic filtering search results using augmented indexes | |
| CN106202416A (en) | Table data write method and device, table data read method and device | |
| CN101520804A (en) | File searching system and method based on SQL database | |
| Bergamaschi et al. | Keyword-based search over databases: a roadmap for a reference architecture paired with an evaluation framework | |
| CN103891244B (en) | A kind of method and device carrying out data storage and search | |
| CN104376014B (en) | Resource issue and querying method in a kind of structured P 2 P network | |
| CN103823805B (en) | Community-based correlation note commending system and recommendation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220217 Address after: 550025 Huawei cloud data center, jiaoxinggong Road, Qianzhong Avenue, Gui'an New District, Guiyang City, Guizhou Province Patentee after: Huawei Cloud Computing Technologies Co.,Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: HUAWEI TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |