CN104679764A - Method and device for searching graph data - Google Patents
Method and device for searching graph data Download PDFInfo
- Publication number
- CN104679764A CN104679764A CN201310625517.5A CN201310625517A CN104679764A CN 104679764 A CN104679764 A CN 104679764A CN 201310625517 A CN201310625517 A CN 201310625517A CN 104679764 A CN104679764 A CN 104679764A
- Authority
- CN
- China
- Prior art keywords
- mark
- summit
- diagram data
- retrieval
- key word
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Abstract
The invention provides a method and a device for searching graph data. The method comprises the steps of determining keywords to be searched at present, wherein the keywords include a first identifier capable of uniquely identifying the first top point in a graph, and a second identifier capable of uniquely identifying the side associated with the first top point in the graph; searching the graph data through a first access index according to the keywords to obtain a third identifier which can uniquely identify a second top point associated with the first top point in the graph. According to the method, the operation from some top point of one graph to another associated top point by side traversing involves only one index access, so that the graph data search efficiency can be increased.
Description
Technical field
The present invention relates to diagram data process field, particularly relate to a kind of diagram data search method and device.
Background technology
Resource description framework (Resource Description Framework, RDF) is the technical standard of the group echo language that World Wide Web Consortium (w3c) proposes, to describe and to express the content and structure of Web resource more galore.Particularly, RDF can be specifically designed to and express about the metadata of Web resource, and the title of such as Web page, author and modification time, the copyright of Web document and License Info, certain is shared the available planning chart etc. of resource.But after this concept vague generalization of Web resource, RDF can be used for expressing the information about any things that can be identified on Web.Along with the development of the network description based on semanteme, RDF data grows is applied in semantic net related application manyly.
Figure is the set on related multiple summit and limit in database, is the maximum effect territory of graphic operation and calculating, and in storage, RDF tlv triple data can be described as graph structure.
RDF tlv triple data are made up of subject, predicate and object three elements, summit in figure is subject in RDF tlv triple data or object, the limit connected between two summits represents predicate, and (limit in figure is logically directed edge, object is pointed to by subject in direction), express a basic affirmation by the way.Illustrate as follows.
< example 1>
A RDF tlv triple < Yao Ming birthplace is Shanghai >, as shown in Figure 1, subject is Yao Ming, object is Shanghai, be respectively two summits in Fig. 1, limit in figure represents predicate " birthplace is ", and object is pointed to by subject in direction, and such statement have expressed Yao Ming and is born in Shanghai that this is true.
Multiple above-mentioned RDF tlv triple data can describe a figure, or are called knowledge network.Illustrate as follows.
< example 2>
A RDF tlv triple < Shanghai is had to be under the jurisdiction of Chinese > in example 1 equally again, can find out that the object " Shanghai " of Article 1 tlv triple becomes the subject of Article 2 tlv triple, so the 3rd RDF tlv triple < Yao Ming height is that 226cm> can illustrate " Yao Ming " also as the subject of this article of tlv triple, multiple above-mentioned tlv triple just constitutes complete figure, as shown in Figure 2.
After RDF tlv triple data are described as above-mentioned graph structure, w3c also defines the query language-sparql for RDF data.But, sparql language is adopted to carry out figure when traveling through retrieval, traversed the operation of another incident vertex by limit by certain summit of a figure, generally need the access relating to two secondary indexs, be specially and find by a certain summit traversal the limit associated with this summit, searched the incident vertex on this summit more further by the limit found, efficiency is not high.
Summary of the invention
The object of this invention is to provide a kind of diagram data search method and device, only related to the access of a secondary index by certain summit of a figure by the operation that limit traverses another incident vertex, improve the recall precision of diagram data.
To achieve these goals, embodiments provide a kind of diagram data search method, described method comprises:
Determine the current key word needing retrieval, described key word comprises the first mark and the second mark, wherein said first mark can the first summit in figure described in unique identification, the limit that described second mark can associate with described first summit in figure described in unique identification;
According to described key word in described diagram data by the retrieval of an access index, obtain the 3rd mark, the second summit that wherein said 3rd mark can associate with described first summit in figure described in unique identification.
Above-mentioned diagram data search method, wherein, after obtaining the 3rd mark, described method also comprises:
Identify the described 3rd again as current the first mark needed in the key word of retrieval, return and perform the described step determining the key word of current needs retrieval, until complete whole retrieval.
Above-mentioned diagram data search method, wherein, before the key word determining current needs retrieval, described method also comprises:
Described diagram data is set up index according to the vertex information on described first summit prestored, in described vertex information, at least comprises described first mark, the second mark and the 3rd mark;
Described according to the retrieval by an access index in described diagram data of described key word, obtain the 3rd mark and be specially:
By the retrieval of an access index in described diagram data, obtain identify with described first and described second identify equal corresponding described 3rd mark.
Above-mentioned diagram data search method, wherein, described according to the retrieval by an access index in described diagram data of described key word, obtain the 3rd mark and be specially:
Retrieved by the depth-first of an access index in described diagram data according to described key word, obtain the 3rd mark.
Above-mentioned diagram data search method, wherein, described diagram data is resource description framework RDF data.
Above-mentioned diagram data search method, wherein, described first summit is specially the subject in described RDF data;
The limit that described and described first summit associates is specially predicate corresponding with described subject in described RDF data;
The second summit that described and described first summit associates is specially object corresponding with described subject in described RDF data.
To achieve these goals, the embodiment of the present invention additionally provides a kind of diagram data indexing unit, and described device comprises:
Key word determination module, for determining the current key word needing retrieval, described key word comprises the first mark and the second mark, wherein said first mark can the first summit in figure described in unique identification, the limit that described second mark can associate with described first summit in figure described in unique identification;
Retrieval module, according to described key word in described diagram data by the retrieval of an access index, obtain the 3rd mark, the second summit that wherein said 3rd mark can associate with described first summit in figure described in unique identification.
Above-mentioned diagram data indexing unit, wherein, described device also comprises:
Processing module, for again needing in the key word of retrieval first to identify as current described 3rd mark, returns described key word determination module, until complete whole retrieval.
Above-mentioned diagram data indexing unit, wherein, described device also comprises:
Module set up in index, for described diagram data is set up index according to the vertex information on described first summit prestored, at least comprises described first mark, the second mark and the 3rd mark in described vertex information;
Described retrieval module is specially:
By the retrieval of an access index in described diagram data, obtain identify with described first and described second identify equal corresponding described 3rd mark.
Above-mentioned diagram data indexing unit, wherein, described retrieval module is specially:
Retrieved by the depth-first of an access index in described diagram data, obtain the 3rd mark.
Above-mentioned diagram data indexing unit, wherein, described diagram data is resource description framework RDF data.
Above-mentioned diagram data indexing unit, wherein, described first summit is specially the subject in described RDF data;
The limit that described and described first summit associates is specially predicate corresponding with described subject in described RDF data;
The second summit that described and described first summit associates is specially object corresponding with described subject in described RDF data.
The embodiment of the present invention is first for diagram data sets up index, described index sets up according to the vertex information on the first summit prestored, the first mark is at least comprised in vertex information, second mark and the 3rd mark, correspond respectively to the mark on the first summit, the mark on the limit associated with the first summit and the mark on the second summit associated with the first summit, retrieve as key word according to the first mark in vertex information and the second mark, determine three mark corresponding with described key word, the mark on the second summit namely associated with the first summit, in above process, the process traversing the second summit by the first summit only relate to the operation of an access index, compared with needing the operation of twice access index in prior art, recall precision improves 50% in theory.
Accompanying drawing explanation
Fig. 1 is the exemplary plot of a RDF tlv triple in prior art;
Fig. 2 is the graph structure of RDF tlv triple in prior art;
The schematic flow sheet of the diagram data search method that Fig. 3 provides for the embodiment of the present invention;
What Fig. 4 provided for the embodiment of the present invention sets up the retrieval schematic diagram after index by vertex information;
The structural representation of the diagram data indexing unit that Fig. 5 provides for the embodiment of the present invention.
Embodiment
For the embodiment of the present invention will be solved technical matters, technical scheme and advantage clearly, be described in detail below in conjunction with the accompanying drawings and the specific embodiments.
Embodiments provide a kind of diagram data search method, described method as shown in Figure 3, comprising:
Step 31, determine the current key word needing retrieval, described key word comprises the first mark and the second mark, and wherein said first mark can the first summit in figure described in unique identification, the limit that described second mark can associate with described first summit in figure described in unique identification;
Step 32, according to described key word in described diagram data by the retrieval of an access index, obtain the 3rd mark, the second summit that wherein said 3rd mark can associate with described first summit in figure described in unique identification.
In the method that the embodiment of the present invention provides, retrieval key word comprise can unique identification first summit first mark, and can second of limit identifying of associating with described first summit of unique identification, according to described key word, by the retrieval of an access index in described diagram data, just can obtain can obtaining the 3rd mark on the second summit associated with described first summit by unique identification, compared with needing the operation of twice access index in prior art, recall precision improves 50% in theory.
In actual applications, generally recurrence to the retrieval of diagram data, that is after confirming the 3rd mark on the second summit, also need to retrieve the summit associated with the second summit further, now the 3rd mark just needs, as current the first mark needed in the key word of retrieval, to proceed retrieval, until search complete, namely, after obtaining the 3rd mark, described method also comprises:
Step 33, identifies the described 3rd again as current the first mark needed in the key word of retrieval, returns and perform the described step determining the key word of current needs retrieval, until complete whole retrieval.
In order to according to the retrieval of described key word only by an access index in described diagram data, can just obtain described 3rd mark, preferably, before the key word determining current needs retrieval, described method also comprises:
Described diagram data is set up index according to the vertex information on described first summit prestored, in described vertex information, at least comprises described first mark, the second mark and the 3rd mark;
Correspondingly, step 32 just can be specially:
By the retrieval of an access index in described diagram data, obtain identify with described first and described second identify equal corresponding described 3rd mark.
In embodiments of the present invention, not only store in the vertex information on the first summit can unique identification self first mark, also stored for the mark on all neighbours limits and the neighbours summit associated with the first summit, corresponding second mark and the 3rd mark respectively, the index of diagram data is set up according to this vertex information, and the existing any-mode can setting up index can be adopted to realize.When retrieving, only needing access one secondary index, preferably, being retrieved by depth-first, just can obtain the 3rd mark on the second summit, wherein the 3rd be identified in the vertex information prestored identify with first and second identify equal corresponding, as shown in Figure 4.
After finding the second summit, just can obtain the vertex information on this second summit, when needing to carry out graph traversal based on the vertex information recurrence on the second summit retrieved, second summit is also just again as the first summit, both the self the 3rd mark was identified as first in key word again, return and perform after step 31 reaffirmed new key word, proceed retrieval, until complete retrieval.
In above-mentioned diagram data search method, described diagram data is resource description framework RDF data.
Accordingly, described first summit is specially the subject in described RDF data;
The limit that described and described first summit associates is specially predicate corresponding with described subject in described RDF data;
The second summit that described and described first summit associates is specially object corresponding with described subject in described RDF data.
When the method provided according to the embodiment of the present invention is retrieved RDF data, detailed process is as follows:
Step 1, prestore the vertex information on the first summit, first summit is subject in RDF data, the first mark of this subject is included in described vertex information, second of all predicates corresponding with this subject identify and the 3rd the identifying of all objects corresponding with this subject, RDF data store all in the manner described above, illustrate as follows:
< example 3>
A certain subject is " Yao Ming ", then this first summit is Yao Ming, the vertex information on the first summit comprise can this subject of unique identification " Yao Ming " the first mark, can unique identification all will " Yao Ming " as the predicate of subject the second mark and can unique identification all by " Yao Ming " the 3rd the identifying of object as subject.
Step 2, sets up index according to the vertex information on the first summit, that is sets up index for all subjects, and this step can adopt the existing any-mode can setting up index to realize;
Step 3, determine the current key word needing retrieval, the first mark of subject and the second mark of predicate is included in key word, during initial retrieval, the first mark and second identifies known, when needs carry out recursion searches, 3rd mark on the second summit retrieved is identified as first again, reconfigures as key word with known the second new mark;
Step 4, according to key word by the retrieval of access one secondary index, preferably, is retrieved by depth-first, just can obtain identifying with first in the vertex information prestored and second identify equal the 3rd corresponding mark;
Step 5, using the 3rd mark retrieved again as current the first mark needed in the key word of retrieval, returns and performs step 3, until retrieval terminates.
In actual applications, the path segments information can specified by the traverse path in sparql query statement, second mark of the incidence edge using current first summit to store and the 3rd mark of incident vertex carry out being combined in path indexing searching, the second mark stored on this summit after finding next summit and the 3rd mark, again as new key word, recursively carry out graph traversal.
In above process, when traversing by limit the second summit associated with the first summit from the first summit, only need the retrieval relating to an access index, retrieve from the first summit the limit associated with needing elder generation in prior art, compared with the search operaqtion being retrieved twice access index on the second summit associated with the first summit again by the limit associated, improve recall precision, and the recall precision improved can reach 50% in theory.
Below by specific embodiment, said process is further described.
< embodiment one >
Sparql statement when retrieving is as follows:
select ?square
Where
{ Yao Ming birthplace city.
City is under the jurisdiction of country.
Country area square}
What above-mentioned query statement described is meant to need inquiry path:
Yao Ming → birthplace → which city → be under the jurisdiction of → which country → area → be how many, final hope obtains the territory area of Yao Ming birthplace the country one belongs to.
When so adopting prior art to retrieve, said process relates to 6 retrievals to index altogether and accesses.
According to the method that the embodiment of the present invention provides, before retrieving, all subjects be not only include in the vertex information on first summit of Yao Ming can this subject of unique identification " Yao Ming " first mark, further comprises can unique identification all by " Yao Ming " as subject predicate second mark and can unique identification all will " Yao Ming " as subject object the 3rd identify, other subjects store equally in the manner described above, and establish index according to vertex information.
When the method so adopting the embodiment of the present invention to provide is retrieved, the step of traversal is:
First, the starting point " Yao Ming " in path, " birthplace " two value are known, the first mark in the vertex information on corresponding first summit of difference and the second mark, use these two elements as key word (Yao Ming, birthplace), only need to carry out primary retrieval to index, just can find the 3rd mark on corresponding second summit unique with key word, described hypothesis has found " Shanghai " summit;
Secondly, due to path next step in " being under the jurisdiction of " known, " Shanghai " that so uses previous step to inquire is as current the first mark needed in the new key word of retrieval, " be under the jurisdiction of " as the second mark in new key word, namely new key word is (Shanghai, be under the jurisdiction of), index is retrieved again, supposes to have found " China " summit;
Finally, identical with step 2, according to new key word (China, area), index is retrieved again, until inquire the summit of " 9,600,000 square kilometres ".
Obviously can find out, utilize the method that the embodiment of the present invention provides, relate to 3 retrievals to index altogether and access, in theory recall precision is improve 50%.
The embodiment of the present invention is first for diagram data sets up index, described index sets up according to the vertex information on the first summit prestored, the first mark is at least comprised in vertex information, second mark and the 3rd mark, correspond respectively to the mark on the first summit, the mark on the limit associated with the first summit and the mark on the second summit associated with the first summit, retrieve as key word according to the first mark in vertex information and the second mark, determine three mark corresponding with described key word, the mark on the second summit namely associated with the first summit, in above process, the process traversing the second summit by the first summit only relate to the operation of an access index, compared with needing the operation of twice access index in prior art, recall precision improves 50% in theory.
The embodiment of the present invention additionally provides a kind of diagram data indexing unit, and described device as shown in Figure 5, comprising:
Key word determination module, for determining the current key word needing retrieval, described key word comprises the first mark and the second mark, wherein said first mark can the first summit in figure described in unique identification, the limit that described second mark can associate with described first summit in figure described in unique identification;
Retrieval module, according to described key word in described diagram data by the retrieval of an access index, obtain the 3rd mark, the second summit that wherein said 3rd mark can associate with described first summit in figure described in unique identification.
Above-mentioned diagram data indexing unit, wherein, described device also comprises:
Processing module, for again needing in the key word of retrieval first to identify as current described 3rd mark, returns described key word determination module, until complete whole retrieval.
Above-mentioned diagram data indexing unit, wherein, described device also comprises:
Module set up in index, for described diagram data is set up index according to the vertex information on described first summit prestored, at least comprises described first mark, the second mark and the 3rd mark in described vertex information;
Described retrieval module is specially:
By the retrieval of an access index in described diagram data, obtain identify with described first and described second identify equal corresponding described 3rd mark.
Above-mentioned diagram data indexing unit, wherein, described retrieval module is specially:
Retrieved by the depth-first of an access index in described diagram data, obtain the 3rd mark.
Above-mentioned diagram data indexing unit, wherein, described diagram data is resource description framework RDF data.
Above-mentioned diagram data indexing unit, wherein, described first summit is specially the subject in described RDF data;
The limit that described and described first summit associates is specially predicate corresponding with described subject in described RDF data;
The second summit that described and described first summit associates is specially object corresponding with described subject in described RDF data.
The above is only the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the premise without departing from the principles of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (12)
1. a diagram data search method, is characterized in that, described method comprises:
Determine the current key word needing retrieval, described key word comprises the first mark and the second mark, wherein said first mark can the first summit in figure described in unique identification, the limit that described second mark can associate with described first summit in figure described in unique identification;
According to described key word in described diagram data by the retrieval of an access index, obtain the 3rd mark, the second summit that wherein said 3rd mark can associate with described first summit in figure described in unique identification.
2. diagram data search method as claimed in claim 1, is characterized in that, after obtaining the 3rd mark, described method also comprises:
Identify the described 3rd again as current the first mark needed in the key word of retrieval, return and perform the described step determining the key word of current needs retrieval, until complete whole retrieval.
3. diagram data search method as claimed in claim 2, is characterized in that, before the key word determining current needs retrieval, described method also comprises:
Described diagram data is set up index according to the vertex information on described first summit prestored, in described vertex information, at least comprises described first mark, the second mark and the 3rd mark;
Described according to the retrieval by an access index in described diagram data of described key word, obtain the 3rd mark and be specially:
By the retrieval of an access index in described diagram data, obtain identify with described first and described second identify equal corresponding described 3rd mark.
4. diagram data search method as claimed in claim 3, is characterized in that, described according to the retrieval by an access index in described diagram data of described key word, obtains the 3rd mark and is specially:
Retrieved by the depth-first of an access index in described diagram data according to described key word, obtain the 3rd mark.
5. the diagram data search method as described in any one of claim 1-4, is characterized in that, described diagram data is resource description framework RDF data.
6. diagram data search method as claimed in claim 5, it is characterized in that, described first summit is specially the subject in described RDF data;
The limit that described and described first summit associates is specially predicate corresponding with described subject in described RDF data;
The second summit that described and described first summit associates is specially object corresponding with described subject in described RDF data.
7. a diagram data indexing unit, is characterized in that, described device comprises:
Key word determination module, for determining the current key word needing retrieval, described key word comprises the first mark and the second mark, wherein said first mark can the first summit in figure described in unique identification, the limit that described second mark can associate with described first summit in figure described in unique identification;
Retrieval module, according to described key word in described diagram data by the retrieval of an access index, obtain the 3rd mark, the second summit that wherein said 3rd mark can associate with described first summit in figure described in unique identification.
8. diagram data indexing unit as claimed in claim 7, it is characterized in that, described device also comprises:
Processing module, for again needing in the key word of retrieval first to identify as current described 3rd mark, returns described key word determination module, until complete whole retrieval.
9. diagram data indexing unit as claimed in claim 8, it is characterized in that, described device also comprises:
Module set up in index, for described diagram data is set up index according to the vertex information on described first summit prestored, at least comprises described first mark, the second mark and the 3rd mark in described vertex information;
Described retrieval module is specially:
By the retrieval of an access index in described diagram data, obtain identify with described first and described second identify equal corresponding described 3rd mark.
10. diagram data indexing unit as claimed in claim 9, it is characterized in that, described retrieval module is specially:
Retrieved by the depth-first of an access index in described diagram data, obtain the 3rd mark.
11. diagram data indexing units as described in any one of claim 7-10, it is characterized in that, described diagram data is resource description framework RDF data.
12. diagram data indexing units as claimed in claim 11, it is characterized in that, described first summit is specially the subject in described RDF data;
The limit that described and described first summit associates is specially predicate corresponding with described subject in described RDF data;
The second summit that described and described first summit associates is specially object corresponding with described subject in described RDF data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310625517.5A CN104679764A (en) | 2013-11-28 | 2013-11-28 | Method and device for searching graph data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310625517.5A CN104679764A (en) | 2013-11-28 | 2013-11-28 | Method and device for searching graph data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104679764A true CN104679764A (en) | 2015-06-03 |
Family
ID=53314825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310625517.5A Pending CN104679764A (en) | 2013-11-28 | 2013-11-28 | Method and device for searching graph data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104679764A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106354729A (en) * | 2015-07-16 | 2017-01-25 | 阿里巴巴集团控股有限公司 | Graph data handling method, device and system |
| CN106411702A (en) * | 2016-09-13 | 2017-02-15 | 深圳市华傲数据技术有限公司 | Asynchronous message sending method and system based on graph computation engine |
| CN106776815A (en) * | 2016-11-24 | 2017-05-31 | 上海交通大学 | RDMA based on multi-mode switching friendly SPARQL querying methods |
| CN107391533A (en) * | 2017-04-18 | 2017-11-24 | 阿里巴巴集团控股有限公司 | Generate the method and device of graphic data base Query Result |
| CN110110034A (en) * | 2019-05-10 | 2019-08-09 | 天津大学深圳研究院 | A kind of RDF data management method, device and storage medium based on figure |
| CN110263225A (en) * | 2019-05-07 | 2019-09-20 | 南京智慧图谱信息技术有限公司 | Data load, the management, searching system of a kind of hundred billion grades of knowledge picture libraries |
-
2013
- 2013-11-28 CN CN201310625517.5A patent/CN104679764A/en active Pending
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106354729A (en) * | 2015-07-16 | 2017-01-25 | 阿里巴巴集团控股有限公司 | Graph data handling method, device and system |
| CN106354729B (en) * | 2015-07-16 | 2020-01-07 | 阿里巴巴集团控股有限公司 | Graph data processing method, device and system |
| CN106411702A (en) * | 2016-09-13 | 2017-02-15 | 深圳市华傲数据技术有限公司 | Asynchronous message sending method and system based on graph computation engine |
| CN106411702B (en) * | 2016-09-13 | 2019-08-20 | 深圳市华傲数据技术有限公司 | Asynchronous message sending method and system based on figure computing engines |
| CN106776815A (en) * | 2016-11-24 | 2017-05-31 | 上海交通大学 | RDMA based on multi-mode switching friendly SPARQL querying methods |
| CN106776815B (en) * | 2016-11-24 | 2020-07-14 | 上海交通大学 | RDMA friendly SPARQ L query method based on multi-mode switching |
| CN107391533A (en) * | 2017-04-18 | 2017-11-24 | 阿里巴巴集团控股有限公司 | Generate the method and device of graphic data base Query Result |
| CN107391533B (en) * | 2017-04-18 | 2020-04-07 | 阿里巴巴集团控股有限公司 | Method and device for generating query result of graphic database |
| CN110263225A (en) * | 2019-05-07 | 2019-09-20 | 南京智慧图谱信息技术有限公司 | Data load, the management, searching system of a kind of hundred billion grades of knowledge picture libraries |
| CN110110034A (en) * | 2019-05-10 | 2019-08-09 | 天津大学深圳研究院 | A kind of RDF data management method, device and storage medium based on figure |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103049575B (en) | A kind of academic conference search system of topic adaptation | |
| CN104679764A (en) | Method and device for searching graph data | |
| US7890493B2 (en) | Translating a search query into multiple languages | |
| CN102156711B (en) | Cloud storage based power full text retrieval method and system | |
| Gentile et al. | Unsupervised wrapper induction using linked data | |
| WO2014209810A2 (en) | Methods and apparatuses for mining synonymous phrases, and for searching related content | |
| US20140297653A1 (en) | Ontology-based query method and apparatus | |
| CN107992608B (en) | SPARQL query statement automatic generation method based on keyword context | |
| CN104516949A (en) | Webpage data processing method and apparatus, query processing method and question-answering system | |
| CN106227788A (en) | Database query method based on Lucene | |
| US9971782B2 (en) | Document tagging and retrieval using entity specifiers | |
| CN103955514A (en) | Image feature indexing method based on Lucene inverted index | |
| CN102915381B (en) | Visual network retrieval based on multi-dimensional semantic presents system and presents control method | |
| CN106202450A (en) | A kind of source code relied on based on makefile file analyzes method | |
| CN103106197A (en) | Method and system for hierarchical data showing | |
| CN103559270A (en) | Method for storing and managing entries | |
| CN105183729A (en) | Method and device for retrieving audio/video content | |
| Zeng et al. | Collective list-only entity linking: A graph-based approach | |
| Fränti et al. | Location-based search engine for multimedia phones | |
| Ghanbarpour et al. | A model-based keyword search approach for detecting top-k effective answers | |
| Manguinhas et al. | A geo-temporal web gazetteer integrating data from multiple sources | |
| Laddha et al. | Semantic tourism information retrieval interface | |
| CN103530291A (en) | Keyword release word developing method and device thereof suitable for search engine | |
| Yan et al. | RDF knowledge graph keyword type search using frequent patterns | |
| CN103729422A (en) | Information fragment associative output method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150603 |
|
| WD01 | Invention patent application deemed withdrawn after publication |