CN103455641B - Crossing repeated retrieval system and method - Google Patents
Crossing repeated retrieval system and method Download PDFInfo
- Publication number
- CN103455641B CN103455641B CN201310455978.2A CN201310455978A CN103455641B CN 103455641 B CN103455641 B CN 103455641B CN 201310455978 A CN201310455978 A CN 201310455978A CN 103455641 B CN103455641 B CN 103455641B
- Authority
- CN
- China
- Prior art keywords
- data
- retrieval
- sentence
- nodes
- retrieval result
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 239000003550 marker Substances 0.000 claims description 18
- 230000008569 process Effects 0.000 claims description 17
- 238000012544 monitoring process Methods 0.000 claims description 7
- 235000013399 edible fruits Nutrition 0.000 claims description 5
- 238000001514 detection method Methods 0.000 claims description 3
- 238000002372 labelling Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000007689 inspection Methods 0.000 description 5
- 238000000151 deposition Methods 0.000 description 4
- 230000003993 interaction Effects 0.000 description 4
- 230000002452 interceptive effect Effects 0.000 description 4
- 239000000203 mixture Substances 0.000 description 4
- 238000013500 data storage Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 201000010099 disease Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a crossing repeated retrieval system and method. The system comprises a distributed storage manager and a retrieval separator. The distributed storage manager is used for recording information of data storing nodes. The retrieval separator comprises a sentence splitting unit, a sentence sending unit, a node result receiving unit and a retrieval result generating unit. The sentence splitting unit is used for splitting received retrieving condition sentences into sentence groups corresponding to one or multiple data storing nodes according to the information of the data storing nodes. The sentence sending unit is used for sending each sentence in the sentence groups to the corresponding data storing node. The node result receiving unit is used for receiving node retrieving result data corresponding to each sentence. The retrieval result generating unit is used for generating retrieval result data according to all of the node retrieving result data. According to the technical scheme, complication of sentence retrieving through data can be reduced, especially in the cloud computing technology, data joint retrieval of multiple nodes can be implemented more easily in the environment where data is stored in a distributed manner according to the content.
Description
Technical field
The present invention relates to data retrieval technology field, intersect the repeatedly system of retrieval and one kind in particular to a kind of
The method intersecting repeatedly retrieval.
Background technology
Cloud storage is in cloud computing (cloud computing) conceptive extension and a new concept developed,
Refer to, by functions such as cluster application, grid or distributed file systems, deposit various types of in a large number in network
Storage equipment gathers collaborative work by application software, jointly externally provides of data storage and Operational Visit function to be
System.Cloud storage is classified often through according to data content, and data is stored on different data memory nodes.But work as
In application, then need to fetch data from these different back end, this is accomplished by data query merging treatment, prior art
Process is merged to data by data buffer storage.But in specific application in practice, the data of data memory node storage
There is identical content, data query has not been just simple merging treatment in this case in addition it is also necessary to the multiple operation such as duplicate removal,
So lead to the operand that data merges drastically big.
Especially for the application in area medical information, in central hospital, general hospital, Community Health Station etc.
Data memory node, deposits the data of same patient.In actual applications, need by inquiry, obtain this patient in all numbers
Disease according to memory node treats data.This relates to data query and merges, because data is to be distributed to according to content distribution rule
Each data memory node.
Accordingly, it would be desirable to a kind of new retrieval technique, the complexity of data query sentence can be simplified, especially in cloud computing skill
It is easier to realize the data aggregate inquiry of multinode in the environment of according to content distributed storage in art.
Content of the invention
The present invention is based on the problems referred to above it is proposed that a kind of new retrieval technique, can simplify data query sentence
Complexity, it is easier to realize the data of multinode in the environment of according to content distributed storage especially in cloud computing technology
Conjunctive query.
In view of this, the present invention proposes a kind of system intersecting repeatedly retrieval, including Distributed Storage Manager and inspection
Rope separator, wherein, described Distributed Storage Manager is used for the information of record data memory node；Described retrieval separator bag
Include：Sentence split cells, for the information according to the data memory node of record, by the described search condition sentence receiving
It is split as the sentence group corresponding to one or more described data memory nodes；Sentence transmitting element, for by described sentence group
In every sentence send to corresponding data memory node；Node result receiving unit, for receiving corresponding to every sentence
Nodes Retrieval result data；Retrieval result signal generating unit, for according to all of described Nodes Retrieval result data, it is right to generate
The retrieval result data of search condition sentence described in Ying Yu.
In this technical scheme, by search condition sentence is split into more simple sentence, thus reducing retrieval
The grammer complexity of conditional statement, advantageously reduces the calculated load of system.Meanwhile, by by split the sentence that obtains send to
Corresponding memory node, to obtain corresponding Nodes Retrieval result data respectively, recombinant is final retrieval result data, from
And solve for the data aggregate inquiry according to the multinode in the environment of content distributed storage.
It is preferable that the information of described data memory node includes address data classification in technique scheme.
Wherein, for the mode of data classification, can according to the actual requirements and specifically be defined, such as a kind of concrete
Embodiment be：Classified according to business domains, thus in complicated query composition, remaining able to guarantee higher hit
Range.
It is preferable that also including in technique scheme：Volatile data base, for storing all of described Nodes Retrieval
Result data；And described retrieval result signal generating unit includes：Merging treatment subelement, for storing to described ephemeral data
Data in storehouse merges process, to generate the retrieval result data corresponding to described search condition sentence.
In this technical scheme, by setting up volatile data base, convenient to carry out to the Nodes Retrieval knot from each node
Fruit data merges process, thus removing repetition, wrong data, so that the retrieval result data ultimately generating more accurately is closed
Reason.
It is preferable that described retrieval separator also includes in technique scheme：Receive judging unit, for judging
State whether volatile data base receives all of described Nodes Retrieval result data；And described retrieval result signal generating unit also wraps
Include：Labelling subelement, in the case of being no in the described judged result receiving judging unit, for needing to merge process
Data arrange corresponding marker bit, with by described merging treatment subelement in described judged result in the case of be, according to
Described marker bit is processed accordingly.
In this technical scheme, before the Nodes Retrieval result data of all nodes not yet receiving, due to still depositing
In the interaction of data, if directly processing to the data having been received by, the problems such as corrupt data may be led to, therefore, only
Be first to need data to be processed be marked, waiting receive all data after, processed accordingly according still further to marker bit,
Thus being conducive to the safe handling of data, it is to avoid corrupt data.
It is preferable that described retrieval separator also includes in technique scheme：State detection unit, works as monitoring
Front data retrieval state；Control of authority unit, for controlling described system only when completing the inspection to described search condition sentence
During rope operation, just allow to provide corresponding retrieval result data to outside.
In this technical scheme, by the monitoring to data retrieval status, thus avoid in data processing just to
Outside open data permission, prevents from interfering the accuracy it is ensured that data to data retrieval and processing procedure.
According to another aspect of the invention it is also proposed that a kind of intersect the method repeatedly retrieved, including：Step 202, according to
The information of the data memory node of record, the described search condition sentence receiving is split as corresponding to one or more institutes
State the sentence group of data memory node；Step 204, every sentence in described sentence group is sent to corresponding data storage section
Point, to obtain corresponding Nodes Retrieval result data；Step 206, according to all of described Nodes Retrieval result data, it is right to generate
The retrieval result data of search condition sentence described in Ying Yu.
In this technical scheme, by search condition sentence is split into more simple sentence, thus reducing retrieval
The grammer complexity of conditional statement, advantageously reduces the calculated load of system.Meanwhile, by by split the sentence that obtains send to
Corresponding memory node, to obtain corresponding Nodes Retrieval result data respectively, recombinant is final retrieval result data, from
And solve for the data aggregate inquiry according to the multinode in the environment of content distributed storage.
It is preferable that described step 202 includes in technique scheme：The information of described data memory node includes ground
Location data classification.
Wherein, for the mode of data classification, can according to the actual requirements and specifically be defined, such as a kind of concrete
Embodiment be：Classified according to business domains, thus in complicated query composition, remaining able to guarantee higher hit
Range.
It is preferable that described step 206 also includes in technique scheme：By all of described Nodes Retrieval number of results
According to storing to volatile data base；Merge process to storing the data to described volatile data base, to generate corresponding to institute
State the retrieval result data of search condition sentence.
In this technical scheme, by setting up volatile data base, convenient to carry out to the Nodes Retrieval knot from each node
Fruit data merges process, thus removing repetition, wrong data, so that the retrieval result data ultimately generating more accurately is closed
Reason.
It is preferable that described step 206 also includes in technique scheme：If described volatile data base not yet receives
All of described Nodes Retrieval result data, then for needing the data merging process to arrange corresponding marker bit, and work as institute
When stating volatile data base and receiving all of described Nodes Retrieval result data, processed accordingly according to described marker bit.
In this technical scheme, before the Nodes Retrieval result data of all nodes not yet receiving, due to still depositing
In the interaction of data, if directly processing to the data having been received by, the problems such as corrupt data may be led to, therefore, only
Be first to need data to be processed be marked, waiting receive all data after, processed accordingly according still further to marker bit,
Thus being conducive to the safe handling of data, it is to avoid corrupt data.
It is preferable that also including in technique scheme：Monitor current data retrieval state；Wherein, only right when completing
During the search operaqtion of described search condition sentence, just allow to provide corresponding retrieval result data to outside.
In this technical scheme, by the monitoring to data retrieval status, thus avoid in data processing just to
Outside open data permission, prevents from interfering the accuracy it is ensured that data to data retrieval and processing procedure.
By above technical scheme, the complexity of data query sentence can be simplified, especially in cloud computing technology, more hold
In the environment of according to content distributed storage, easily realize the data aggregate inquiry of multinode.
Brief description
Fig. 1 shows the schematic block diagram intersecting the repeatedly system of retrieval according to an embodiment of the invention；
Fig. 2 shows the schematic flow diagram intersecting the repeatedly method of retrieval according to an embodiment of the invention；
Fig. 3 shows that execution according to an embodiment of the invention intersects the idiographic flow schematic diagram of repeatedly retrieval.
Specific embodiment
In order to be more clearly understood that the above objects, features and advantages of the present invention, below in conjunction with the accompanying drawings and specifically real
Mode of applying is further described in detail to the present invention.It should be noted that in the case of not conflicting, the enforcement of the application
Feature in example and embodiment can be mutually combined.
Elaborate a lot of details in the following description in order to fully understand the present invention, but, the present invention also may be used
To be implemented different from other modes described here using other, therefore, protection scope of the present invention is not described below
Specific embodiment restriction.
Fig. 1 shows the schematic block diagram intersecting the repeatedly system of retrieval according to an embodiment of the invention.
As shown in figure 1, intersecting the system 100 of repeatedly retrieval according to an embodiment of the invention, including distributed storage pipe
Reason device 102 and retrieval separator 104, wherein, described Distributed Storage Manager 102 is used for the letter of record data memory node
Breath；Described retrieval separator 104 includes：Sentence split cells 1041, for the information according to the data memory node of record,
The described search condition sentence receiving is split as the sentence group corresponding to one or more described data memory nodes；Sentence
Transmitting element 1042, for sending every sentence in described sentence group to corresponding data memory node；Node result connects
Receive unit 1043, for receiving the Nodes Retrieval result data corresponding to every sentence；Retrieval result signal generating unit 1044, is used for
According to all of described Nodes Retrieval result data, generate the retrieval result data corresponding to described search condition sentence.
In this technical scheme, by search condition sentence is split into more simple sentence, thus reducing retrieval
The grammer complexity of conditional statement, advantageously reduces the calculated load of system.Meanwhile, by by split the sentence that obtains send to
Corresponding memory node, to obtain corresponding Nodes Retrieval result data respectively, recombinant is final retrieval result data, from
And solve for the data aggregate inquiry according to the multinode in the environment of content distributed storage.
It is preferable that the information of described data memory node includes address data classification in technique scheme.
Wherein, for the mode of data classification, can according to the actual requirements and specifically be defined, such as a kind of concrete
Embodiment be：Classified according to business domains, thus in complicated query composition, remaining able to guarantee higher hit
Range.
It is preferable that also including in technique scheme：Volatile data base 106, for storing all of described node inspection
Rope result data；And described retrieval result signal generating unit 1044 includes：Merging treatment subelement 1044A, for store to
Data in described volatile data base 106 merges process, to generate the retrieval result corresponding to described search condition sentence
Data.
In this technical scheme, by setting up volatile data base 106, convenient to carry out to the Nodes Retrieval from each node
Result data merges process, thus removing repetition, wrong data, so that the retrieval result data ultimately generating more accurately is closed
Reason.
It is preferable that described retrieval separator 104 also includes in technique scheme：Receive judging unit 1045, be used for
Judge whether described volatile data base 106 receives all of described Nodes Retrieval result data；And the life of described retrieval result
Unit 1044 is become also to include：Labelling subelement 1044B, for the feelings being no in the described judged result receiving judging unit 1045
Under condition, the data for needing to merge process arranges corresponding marker bit, with by described merging treatment subelement 1044A in institute
State judged result for, in the case of being, being processed accordingly according to described marker bit.
In this technical scheme, before the Nodes Retrieval result data of all nodes not yet receiving, due to still depositing
In the interaction of data, if directly processing to the data having been received by, the problems such as corrupt data may be led to, therefore, only
Be first to need data to be processed be marked, waiting receive all data after, processed accordingly according still further to marker bit,
Thus being conducive to the safe handling of data, it is to avoid corrupt data.
It is preferable that described retrieval separator 104 also includes in technique scheme：State detection unit 1046, is used for
Monitor current data retrieval state；Control of authority unit 1047, for controlling described system 100 only when completing to described retrieval
During the search operaqtion of conditional statement, just allow to provide corresponding retrieval result data to outside.
In this technical scheme, by the monitoring to data retrieval status, thus avoid in data processing just to
Outside open data permission, prevents from interfering the accuracy it is ensured that data to data retrieval and processing procedure.
Fig. 2 shows the schematic flow sheet intersecting the repeatedly method of retrieval according to an embodiment of the invention.
As shown in Fig. 2 the method intersecting repeatedly retrieval according to an embodiment of the invention, including：Step 202, according to
The information of the data memory node of record, the described search condition sentence receiving is split as corresponding to one or more described
The sentence group of data memory node；Step 204, every sentence in described sentence group is sent to corresponding data storage section
Point, to obtain corresponding Nodes Retrieval result data；Step 206, according to all of described Nodes Retrieval result data, it is right to generate
The retrieval result data of search condition sentence described in Ying Yu.
In this technical scheme, by search condition sentence is split into more simple sentence, thus reducing retrieval
The grammer complexity of conditional statement, advantageously reduces the calculated load of system.Meanwhile, by by split the sentence that obtains send to
Corresponding memory node, to obtain corresponding Nodes Retrieval result data respectively, recombinant is final retrieval result data, from
And solve for the data aggregate inquiry according to the multinode in the environment of content distributed storage.
It is preferable that described step 202 includes in technique scheme：The information of described data memory node includes ground
Location data classification.
Wherein, for the mode of data classification, can according to the actual requirements and specifically be defined, such as a kind of concrete
Embodiment be：Classified according to business domains, thus in complicated query composition, remaining able to guarantee higher hit
Range.
It is preferable that described step 206 also includes in technique scheme：By all of described Nodes Retrieval number of results
According to storing to volatile data base；Merge process to storing the data to described volatile data base, to generate corresponding to institute
State the retrieval result data of search condition sentence.
In this technical scheme, by setting up volatile data base, convenient to carry out to the Nodes Retrieval knot from each node
Fruit data merges process, thus removing repetition, wrong data, so that the retrieval result data ultimately generating more accurately is closed
Reason.
It is preferable that described step 206 also includes in technique scheme：If described volatile data base not yet receives
All of described Nodes Retrieval result data, then for needing the data merging process to arrange corresponding marker bit, and work as institute
When stating volatile data base and receiving all of described Nodes Retrieval result data, processed accordingly according to described marker bit.
In this technical scheme, before the Nodes Retrieval result data of all nodes not yet receiving, due to still depositing
In the interaction of data, if directly processing to the data having been received by, the problems such as corrupt data may be led to, therefore, only
Be first to need data to be processed be marked, waiting receive all data after, processed accordingly according still further to marker bit,
Thus being conducive to the safe handling of data, it is to avoid corrupt data.
It is preferable that also including in technique scheme：Monitor current data retrieval state；Wherein, only right when completing
During the search operaqtion of described search condition sentence, just allow to provide corresponding retrieval result data to outside.
In this technical scheme, by the monitoring to data retrieval status, thus avoid in data processing just to
Outside open data permission, prevents from interfering the accuracy it is ensured that data to data retrieval and processing procedure.
Fig. 3 shows that execution according to an embodiment of the invention intersects the idiographic flow schematic diagram of repeatedly retrieval.
As shown in figure 3, the idiographic flow that execution intersection is repeatedly retrieved according to an embodiment of the invention includes：
Step 302, after the search condition sentence receiving outside input, starts to examine based on the searching system of the present invention
Rope affairs simultaneously initialize.
Step 304, search condition sentence is split as multiple.Specifically, due to applying to the ring of content distributed storage
Under border, thus by splitting to search condition sentence, advantageously reduce the complexity of sentence, thus respectively from each data
Memory node enters line retrieval, to obtain corresponding Nodes Retrieval result data.
Step 306, the Nodes Retrieval result data of all nodes obtaining is merged, obtains corresponding to initial inspection
The retrieval result of rope conditional statement.Specifically, the node inspection of each back end can be received by setting up volatile data base
Rope result data, and complete the merging treatment to all Nodes Retrieval result datas in this volatile data base.Wherein, for conjunction
And the data of process such as in processing procedure, need to carry out to delete, change, and temporarily pass through its marker bit of modification and be identified, and untrue
Just processed.
Step 308, the processing condition data in monitoring volatile data base, if receive the Nodes Retrieval of all back end
Result data, then enter step 310, otherwise return to step 306.
Step 310, judges retrieval service termination.
Step 312, according to the marker bit of data, is processed accordingly to data.Meanwhile, open systemss externally export number
According to interface, provide inquiry to this retrieval result etc. operate.
Technical scheme is described in detail above in association with accompanying drawing, the invention provides what a kind of intersection was repeatedly retrieved
System and a kind of method of the multiple retrieval of intersection, can simplify the complexity of data query sentence, especially in cloud computing technology,
It is easier to realize the data aggregate inquiry of multinode in the environment of according to content distributed storage.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for the skill of this area
For art personnel, the present invention can have various modifications and variations.All within the spirit and principles in the present invention, made any repair
Change, equivalent, improvement etc., should be included within the scope of the present invention.
Claims (6)
1. a kind of system intersecting repeatedly retrieval is it is characterised in that include Distributed Storage Manager and retrieval separator, its
In,
Described Distributed Storage Manager is used for the information of record data memory node；
Described retrieval separator includes：
Sentence split cells, for the information according to the data memory node of record, the search condition receiving sentence is torn open
It is divided into the sentence group corresponding to one or more described data memory nodes；
Sentence transmitting element, for sending every sentence in described sentence group to corresponding data memory node；
Node result receiving unit, for receiving the Nodes Retrieval result data corresponding to every sentence；
Retrieval result signal generating unit, for according to all of described Nodes Retrieval result data, generating corresponding to described retrieval bar
The retrieval result data of part sentence；
Volatile data base, for storing all of described Nodes Retrieval result data；
Wherein, described retrieval result signal generating unit includes：
Merging treatment subelement, for merging process to storing the data to described volatile data base, to generate correspondence
Retrieval result data in described search condition sentence；
Described retrieval separator also includes：
Receive judging unit, for judging whether described volatile data base receives all of described Nodes Retrieval result data；
Described retrieval result signal generating unit also includes：
Labelling subelement, in the case of being no in the described judged result receiving judging unit, for needing to merge place
Reason data arrange corresponding marker bit, with by described merging treatment subelement in described judged result in the case of be, press
Processed accordingly according to described marker bit.
2. the system intersecting repeatedly retrieval according to claim 1 is it is characterised in that the information of described data memory node
Including the classification of address data.
3. the system intersecting repeatedly retrieval according to claim 1 and 2 is it is characterised in that described retrieval separator also wraps
Include：
State detection unit, for monitoring current data retrieval state；
Control of authority unit, for controlling described system only when completing the search operaqtion to described search condition sentence, just permits
Permitted to provide corresponding retrieval result data to outside.
4. a kind of method intersecting repeatedly retrieval is it is characterised in that include：
Step 202, the information of the data memory node according to record, by the search condition receiving sentence be split as corresponding to
The sentence group of one or more described data memory nodes；
Step 204, every sentence in described sentence group is sent to corresponding data memory node, to obtain corresponding node
Retrieval result data；
Step 206, according to all of described Nodes Retrieval result data, generates the retrieval knot corresponding to described search condition sentence
Fruit data, all of described Nodes Retrieval result data is stored to volatile data base, to storing to described volatile data base
Data merge process, with generate corresponding to described search condition sentence retrieval result data；And if described interim
Data base not yet receives all of described Nodes Retrieval result data, then for needing the data setting merging process corresponding
Marker bit, and when described volatile data base receives all of described Nodes Retrieval result data, according to described marker bit
Processed accordingly.
5. the method intersecting repeatedly retrieval according to claim 4 is it is characterised in that described step 202 includes：
The information of described data memory node includes address data classification.
6. the method that the intersection according to claim 4 or 5 is repeatedly retrieved is it is characterised in that also include：
Monitor current data retrieval state；
Wherein, only when completing the search operaqtion to described search condition sentence, just allow to provide corresponding retrieval knot to outside
Fruit data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310455978.2A CN103455641B (en) | 2013-09-29 | 2013-09-29 | Crossing repeated retrieval system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310455978.2A CN103455641B (en) | 2013-09-29 | 2013-09-29 | Crossing repeated retrieval system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103455641A CN103455641A (en) | 2013-12-18 |
| CN103455641B true CN103455641B (en) | 2017-02-22 |
Family
ID=49738004
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310455978.2A Active CN103455641B (en) | 2013-09-29 | 2013-09-29 | Crossing repeated retrieval system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103455641B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105930407B (en) * | 2016-04-18 | 2019-05-17 | 北京思特奇信息技术股份有限公司 | A kind of inter-library relation query method of distributed data base and system |
| CN109117426B (en) * | 2017-06-23 | 2023-06-09 | 金篆信科有限责任公司 | Distributed database query method, device, equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6081805A (en) * | 1997-09-10 | 2000-06-27 | Netscape Communications Corporation | Pass-through architecture via hash techniques to remove duplicate query results |
| US6615209B1 (en) * | 2000-02-22 | 2003-09-02 | Google, Inc. | Detecting query-specific duplicate documents |
| US6658423B1 (en) * | 2001-01-24 | 2003-12-02 | Google, Inc. | Detecting duplicate and near-duplicate files |
| CN1790322A (en) * | 2004-12-17 | 2006-06-21 | 国际商业机器公司 | Method and system of creating a logical table from multiple differently formatted physical tables |
| US7155427B1 (en) * | 2002-10-30 | 2006-12-26 | Oracle International Corporation | Configurable search tool for finding and scoring non-exact matches in a relational database |
| US7657515B1 (en) * | 2007-03-30 | 2010-02-02 | Alexa Internet | High efficiency document search |
| 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 |
| CN102708121A (en) * | 2011-02-18 | 2012-10-03 | 微软公司 | Dynamic distributed query execution over heterogeneous sources |
| CN103186563A (en) * | 2011-12-28 | 2013-07-03 | 腾讯科技（深圳）有限公司 | Data retrieval method and system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070011142A1 (en) * | 2005-07-06 | 2007-01-11 | Juergen Sattler | Method and apparatus for non-redundant search results |
| US7756798B2 (en) * | 2007-03-06 | 2010-07-13 | Oracle International Corporation | Extensible mechanism for detecting duplicate search items |
| US8145643B2 (en) * | 2007-12-04 | 2012-03-27 | Yahoo! Inc. | Time based ordering of provided mobile content |
| US20110004608A1 (en) * | 2009-07-02 | 2011-01-06 | Microsoft Corporation | Combining and re-ranking search results from multiple sources |
| US9767132B2 (en) * | 2011-10-10 | 2017-09-19 | Salesforce.Com, Inc. | Systems and methods for real-time de-duplication |
| CN108388632B (en) * | 2011-11-15 | 2021-11-19 | 起元科技有限公司 | Data clustering, segmentation, and parallelization |
-
2013
- 2013-09-29 CN CN201310455978.2A patent/CN103455641B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6081805A (en) * | 1997-09-10 | 2000-06-27 | Netscape Communications Corporation | Pass-through architecture via hash techniques to remove duplicate query results |
| US6615209B1 (en) * | 2000-02-22 | 2003-09-02 | Google, Inc. | Detecting query-specific duplicate documents |
| US6658423B1 (en) * | 2001-01-24 | 2003-12-02 | Google, Inc. | Detecting duplicate and near-duplicate files |
| US7155427B1 (en) * | 2002-10-30 | 2006-12-26 | Oracle International Corporation | Configurable search tool for finding and scoring non-exact matches in a relational database |
| CN1790322A (en) * | 2004-12-17 | 2006-06-21 | 国际商业机器公司 | Method and system of creating a logical table from multiple differently formatted physical tables |
| US7657515B1 (en) * | 2007-03-30 | 2010-02-02 | Alexa Internet | High efficiency document search |
| 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 |
| CN102708121A (en) * | 2011-02-18 | 2012-10-03 | 微软公司 | Dynamic distributed query execution over heterogeneous sources |
| CN103186563A (en) * | 2011-12-28 | 2013-07-03 | 腾讯科技（深圳）有限公司 | Data retrieval method and system |
Non-Patent Citations (1)
| Title |
|---|
| 分布式检索系统架构及核心技术研究;吴广印;《情报学报》;20130709;第32卷(第6期);第601-609页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103455641A (en) | 2013-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9946748B2 (en) | Efficient join-filters for parallel processing | |
| CN112860777B (en) | Data processing method, device and equipment | |
| CN113067883B (en) | Data transmission method, device, computer equipment and storage medium | |
| US20110276578A1 (en) | Obtaining file system view in block-level data storage systems | |
| CN109522228B (en) | Interface automation test data construction method, device, platform and storage medium | |
| US20040225697A1 (en) | Storage operation management program and method and a storage management computer | |
| CN110737680A (en) | Cache data management method and device, storage medium and electronic equipment | |
| US7313572B2 (en) | Attribute partitioning for user extensibility | |
| KR20060045720A (en) | Method and system for query mapping for tasks | |
| CN106055478A (en) | Method and device for detecting memory leak | |
| US20080059436A1 (en) | Providing a visual representation of a sub-set of a visual program | |
| CN109408689A (en) | Data capture method, device, system and electronic equipment | |
| CN105872127B (en) | A kind of IP address management system | |
| CN106936812B (en) | File privacy disclosure detection method based on Petri network in cloud environment | |
| CN114443699A (en) | Information query method, apparatus, computer equipment, and computer-readable storage medium | |
| CN108255620A (en) | A kind of business logic processing method, apparatus, service server and system | |
| CN106980572A (en) | The on-line debugging method and system of distributed system | |
| CN105183542A (en) | Memory management method and system | |
| CN107016039A (en) | The method and Database Systems of database write-in | |
| CN113760297B (en) | Strategic class division method, system, computer equipment and medium | |
| CN103455641B (en) | Crossing repeated retrieval system and method | |
| US20080005183A1 (en) | Method And Apparatus for Propagating Tables While Preserving Cyclic Foreign Key Relationships | |
| CN112579454B (en) | Task data processing method, device and equipment | |
| CN111897837A (en) | Data query method, device, equipment and medium | |
| CN104050264A (en) | Method and device for generating SQL statement |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: PKU HEALTHCARE IT CO., LTD. Free format text: FORMER OWNER: FOUNDER INTERNATIONAL CO., LTD. Effective date: 20150203 Free format text: FORMER OWNER: FOUNDER INTERNATIONAL (BEIJING) CO., LTD. Effective date: 20150203 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 215123 SUZHOU, JIANGSU PROVINCE TO: 100080 HAIDIAN, BEIJING |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20150203 Address after: 100080, No. 19, No. 52 West Fourth Ring Road, Beijing, Haidian District Applicant after: Peking University Medical Information Technology Co.,Ltd. Address before: Suzhou City, Jiangsu Province, Suzhou Industrial Park 215123 Xinghu Street No. 328 Creative Industry Park founder International Building Applicant before: FOUNDER INTERNATIONAL Co.,Ltd. Applicant before: Founder International Co.,Ltd. (Beijing) |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20240202 Granted publication date: 20170222 |