CN103617265B - A kind of ontology query engine based on ontology semantic information optimizes system - Google Patents
A kind of ontology query engine based on ontology semantic information optimizes system Download PDFInfo
- Publication number
- CN103617265B CN103617265B CN201310641921.1A CN201310641921A CN103617265B CN 103617265 B CN103617265 B CN 103617265B CN 201310641921 A CN201310641921 A CN 201310641921A CN 103617265 B CN103617265 B CN 103617265B
- Authority
- CN
- China
- Prior art keywords
- query
- query statement
- terminology
- atom
- variable
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A kind of ontology query engine based on ontology semantic information optimizes system, comprises query statement pretreatment module: query statement changes into disjunctive normal form representation；Query interface and inquiry atom to query statement are classified, and differentiate the query statement for terminology；Call query engine and query statement originally is changed into a series of block query statements of asserting of correspondence；Query statement derivation module: to asserting block query statement, is inquired about terminology in atom and knowledge base and combines and form a temporary transient knowledge base, and the hiding information inference knowledge base being newly formed comprised by inference machine is out；Query optimization module: according to the hiding information derived by dependency rule, former query statement is optimized, is asserting that on block, lookup result the result on terminology are combined and obtain final result.The present invention reaches to shorten the effect of query time, can be widely applied to current semantic net developing instrument, plays the effect optimizing its query engine.
Description
Technical field
The present invention proposes a kind of Ontology query language query engine based on ontology semantic information and optimizes system, belongs to semantic net semantic
Inquiry field.
Background technology
Recently as the fast development of semantic net, Ontology data volume is increasing, has had many for developing semantic net
The instrument of program, wherein query engine is the important component part of developing instrument, but the query engine of these developing instruments is at place
Manage performance in the inquiry of big data general.The present invention is then to develop a kind of effect reaching Optimizing Queries based on system thereon.
At present, Semantic query optimization technology is broadly divided into two aspects: one is to ontology file such as resource description framework
Or effective Indexing Mechanism set up by network ontology language (OWL) document (RDF)；Another kind is to Ontology query language
Optimize.The invention belongs to latter.The parent map pattern of RDF is mainly carried out excellent by the technology about second method at present
Change, by triple order in Ontology Query statement is adjusted reaching the purpose of Optimizing Queries time.But the method is uncomfortable
With with this purpose.
Unlike other technologies, the present invention is laid particular emphasis on and is optimized query statement by the semantic information in body, gives full play to
The feature of semantic net, owing to data store organisation not requirement, the query engine that can be widely applied to existing developing instrument rises
Effect to Optimizing Queries.
Summary of the invention
The technology of the present invention solves problem: overcome the deficiencies in the prior art, it is provided that a kind of Ontology Query based on ontology semantic information draws
Holding up optimization system, Ontology query language statement is optimized by the semantic information related to the use of in body so that query statement obtains
Simplify, improve the efficiency of user's inquiry.
The technology of the present invention solution: a kind of ontology query engine based on ontology semantic information optimizes system, including: inquiry language
Sentence pretreatment module, query statement derivation module and query optimization module；Wherein:
Query statement pretreatment module: query statement resolves into a series of simple conjunctive query, will change into analysis by query statement
Taking normal form, have only to afterwards inquire about each conjunctive query statement, Query Result is the union of each conjunctive query result；
For single conjunctive query, query interface therein is divided into terminology variable and asserts block variable two class, inquiry atom is also divided
Become two big classes, i.e. assert block atom and terminology atom；Individually being put forward by terminology atom, composition pertains only to terminology information
Query statement, call query engine, on terminology inquire about, by Query Result successively replacement query statement terminology become
Amount, forms a series of query statement pertaining only to assert block message；Described terminology variable represent this occurrences at RDF,
Concept and the position of attribute in triple, assert that block variable then occurs from the position of example, and described RDF is resource description frame
Frame, a kind of markup language for describing web resource, terminology atom then relates to the inquiry atom of terminology information, its
He is then to assert block atom；
Query statement derivation module: for single block query statement of asserting, changes into each inquiry atom and asserts that block breaks accordingly
Speech, each variable becomes asserting an example in block, the knowledge base new with terminology composition；For new knowledge base, use
It is made inferences by ontology inference machine, and ontology inference machine utilizes the semantic information in body to make inferences, and draws in knowledge base implicit
Information, including the uniformity in judgemental knowledge storehouse, draw implicit triple relation according to dependency rule, believed by Ontology
Breath derives a series of implicit information；
Query optimization module: be optimized former query statement according to the implicit information derived, obtains the most succinct looking into
Ask statement；To assert that block query statement calls query engine and asserting that block obtains result and ties mutually with the Query Result on terminology
Close, i.e. can get the result of former query statement.
In described query optimization module, according to the implicit information derived, former query statement is optimized, obtains the simplest
Clean query statement is implemented as follows:
(1) if reasoning show that knowledge base is inconsistent, then explanation query statement is problematic, can not get Query Result, now looks into
Inquiry result is meaningless, so need not optimize；
(2) it is owl:sameAs for the triple predicate position derived, i.e. individual equivalence relation, represent two individualities
Two variablees if subject and object are all variable, are then merged into a variable by identical triple, if there being a constant
It is i.e. the value of this variable query with a variable then this constant；
(3) being the triple of rdf:type for the triple predicate position derived, wherein subject position is variable, object
Position is concept, then according to object position concept definition, and owl:equiventClass attribute, i.e. class equivalence relation, represent two
Individual class is identical, then replace correspondence inquiry atom.Make sure to keep in mind the inquiry atom replaced can not comprise its dependent variable；
(4) if inquiry atom comprise (？x,rdf:type,C1), (？x,rdf:type,C2), the statement of i.e. individual type
Triple, represents？X is the individuality of C1 class, is also the individuality of C2 class simultaneously, andThen can eliminate
(？x,rdf:type,C2), it is similar to by sub-attribute elimination method；
(5) if inquiry atom comprise (？x,rdf:type,C1), (？X, p, o), and (p, rdfs:domain, C1), i.e.
Definition territory statement triple, represents that the definition territory of attribute p is C1, then can eliminate (？x,rdf:type,C1)。
(6) by above step, the query statement that can be more simplified.
Individually being put forward by terminology atom in described query statement pretreatment module, composition pertains only to the inquiry language of terminology information
During sentence, if only one of which terminology atom in query statement (？x,subClassOf,？Y), i.e. subtype triple, represent
？X is？The subclass of y, then be focused to find out all individualities meeting condition at term, and substitute original query statement by these concepts
In？X and？y；If only one of which terminology inquiry atom (？X, subClassOf, y), wherein y is constant, and？x
Be not the most query statement it is to be understood that value xnIn one, originally？The Query Value of x should be all subclasses of y, this kind of situation
？X can only replace forming a query statement with y.
Inquiry atom is changed into by described query statement derivation module when asserting that block is asserted, as (？X, rdf:type, Person),
The triple of i.e. individual type declarations, represents？X is the individuality of Person class, then will generate an example entitled？X's
This concept class of the body representative of Person, i.e. people.
Present invention advantage compared with prior art is:
(1) present invention is by utilizing the semantic information in terminology, reaches the effect of Optimizing Queries statement, improves user and looks into
The efficiency ask.
(2) present invention is processing terminology typically, and asserts when blocks of data amount is the biggest, owing to optimization process only have invoked term
Collection information, consumes little, therefore can reduce in a large number at the query time asserting on block by optimizing, and the knowledge base in reality is big
Partly belong to this situation, further increase the efficiency of user's inquiry.
(3) system of the present invention can combine with existing query engine, is applied to the actual development of semantic net, improves application
Scope.
Accompanying drawing explanation
Fig. 1 is present system frame diagram；
Fig. 2 is flowchart of the present invention；
Fig. 3 is query engine flowchart.
Detailed description of the invention
As shown in Figure 1, 2, in a kind of ontology query engine optimization system based on ontology semantic information of the present invention, RDF uses
(Subject-Verb object) triple structure organization data, knowledge base comprises asserts block and terminology two parts, and terminology is to retouch
State the set of field concept and association attributes, assert that block is to describe class and the set of association attributes example.Simple its shape of conjunctive query
Such as q (x1,...,xn)←a1,...,am；xnIt is the variable of query statement, amIt is that the RDF triple about constraint inquiry is asserted
It is referred to as inquiring about atom (query atom), xnAlso it is amIn element, in triple with？Add a word to represent such as？X,
Other amIn constant represent with common words, specifically comprising the following steps that of optimization
Query statement pretreatment module:
Step one: query statement resolves into a series of simple conjunctive query, will change into disjunctive normal form by query statement, afterwards
Having only to inquire about each conjunctive query statement, Query Result is the union of each conjunctive query result；
Step 2: for single conjunctive query, by query interface x thereinnIt is divided into two classes, terminology variable and assert block variable,
Then will inquiry atom amIt is also divided into two big classes, asserts block atom and terminology atom；
Step 3: terminology atom is individually put forward, composition pertains only to the query statement of terminology information, calls query engine,
Terminology is inquired about, by the terminology variable in Query Result successively replacement query statement, result in formation of a series of pertaining only to
Assert the query statement of block message；
Query statement derivation module:
Step 4: for single block query statement of asserting, changes into each inquiry atom and asserts that block is asserted accordingly, Mei Gebian
Quantitative change is to assert an example in block, the knowledge base new with terminology composition；
Step 5: for new knowledge base, uses ontology inference machine to make inferences it, and ontology inference machine can utilize in body
Semantic information make inferences, draw in knowledge base implicit information, including the uniformity in judgemental knowledge storehouse, according to dependency rule
Draw implicit triple relation etc..So derive a series of implicit information by ontology semantic information；
Query optimization module:
Step 6: be optimized former query statement according to the implicit information derived, obtains the most succinct query statement；
Step 7: by assert block query statement call query engine assert block obtain result and with step 3 looking into about terminology
Inquiry result combines, and i.e. can get the result of former query statement.
Wherein, in step 2, terminology variable represents this occurrences concept and position of attribute in RDF triple, disconnected
Speech block variable then occurs from the position of example, and terminology atom then relates to the inquiry atom of terminology information such as
(？x,subClassOf,？Y), other are then to assert that block atom, concrete differentiating method have had correlative study.
Wherein, in step 3, terminology atom is formed the query statement about terminology information, such as in query statement only one
Individual terminology atom (？x,subClassOf,？Y), then it is focused to find out all individualities meeting condition at term, and general with these
Read and substitute in original query statement？X and？y.If only one of which terminology inquiry atom (？X, subClassOf, y),
Wherein y is constant, and？X be not the most query statement it is to be understood that value xnIn one, originally？The Query Value of x should be y's
All subclasses, this kind of situation？X can only replace forming a query statement with y.
Wherein, in step 4, inquiry atom is changed into and assert that block is asserted, as (？X, rdf:type, Person), then will be raw
Become an example entitled？The Person class of x.
Wherein, in step 5, in six, new knowledge base can be made inferences by existing inference machine, obtain implicit information, so
After in the following order process:
(1) if reasoning show that knowledge base is inconsistent, then explanation query statement is problematic, can not get Query Result.
(2) it is the triple of owl:sameAs for the triple predicate position derived, if subject and object are all to become
Amount, then be merged into a variable by two variablees, if having a constant and a variable, this constant is i.e. this variable query
Value.
(3) being the triple of rdf:type for the triple predicate position derived, wherein subject position is variable, object
Position is concept, then according to object position concept definition, if any owl:equiventClass attribute, then replace correspondence inquiry former
Son.Make sure to keep in mind the inquiry atom replaced can not comprise its dependent variable.
(4) if inquiry atom comprise (？x,rdf:type,C1), (？x,rdf:type,C2), andThen can disappear
Go (？x,rdf:type,C2).It is similar to by sub-attribute elimination method.
(5) if inquiry atom comprise (？x,rdf:type,C1), (？X, p, o), and (p, rdfs:domain, C1), then
Can eliminate (？x,rdf:type,C1)。
Above-mentioned 5 rules, rule 1-3 is the rule that the present invention creates, and rule 4 and 5 is to combine other technologies to be applied at this
In system, actual development system also can add other rules.Query statement can be made to obtain letter by the process of above 5 rules
Change.
As it is shown on figure 3, query engine implement process.
(1) query statement syntax parsing: query statement is carried out morphological analysis and syntactic analysis, it is judged that whether this query statement
Grammaticality.
(2) chart-pattern extracts: analyze chart-pattern (available triple express) from query statement, subgraph template the most to be matched,
For expressing query intention.
(3) graph pattern matching: carry out mating finding Query Result with data set by chart-pattern.
(4) Query Result feedback: according to the setting feedback query result of query statement.
Below in conjunction with concrete example, the present invention is described in detail further, specifically comprises the following steps that
1, data prepare
It is used for verifying that system effect, LUBM are the benchmark of test bodies query language performance firstly the need of preparing some data, bag
Containing university this voxel data Univ-Bench, for test data set, LUBM provides data producer UBA to be used for producing
Test data based on Univ-Bench body.Use UBA 3 different size of data sets of generation, its triple number,
Example number, take up room (MB) be respectively Lubm1 (82415,20659,8), Lubm2 (516116,129533,
50), Lubm3 (1052895,263427,102).
2, system development
Have developed a query engine combined with Jena and optimize system, Jena is the application development tool of Semantic Web,
Thering is provided the query function for Ontology, its query engine does not considers to be optimized from semantic level, therefore available native system enters
Row optimizes, and performs 10 query statements first by Jena respectively for above 3 data, draws average lookup time.
Then native system is combined with Jena query engine, illustrates Optimization Steps with wherein query statement, inquire about language
Sentence is: find out each laboratory leader, and the employee that the laboratory of his work is engaged.It is expressed as:
q(x,y)←(？x,rdf:type,？c).
(？c,rdfs:subclassof,person).(？x,ishaedof,？z)
.(？x,workat,？o).(？o,hasamember,？y)
Wherein q (x, y) represents that the value looked for required for this query statement is variable x and variable y, represent respectively laboratory leader,
With laboratory employee.A string triple after ← is then used to bound variable x and variable y's, it is to be noted that at inquiry unit
In, variable money all adds？As differentiation.
(1) this query statement has been conjunctive query, need not process.
(2) in query interface,？C is terminology variable, and remaining variables is to assert block variable,
(？C, rdfs:subclassof, person) it is terminology atom, remaining is to assert block atom.
(3) incite somebody to action (？C, rdfs:subclassof, person) call Jena query engine and inquire about on terminology, draw
All subclasses of person class, owing to meeting the special circumstances mentioned by step 3,？C can only substitute with person.
(4) obtain one to pertain only to assert that the query statement q' of block message is as follows:
q'(x,y)←(？x,rdf:type,person).
(？x,isheadof,？z).(？x,workat,？o).
(？o,hasamember,？y)
By this query statement, generate assert block message comprise (？X, rdf:type, person) etc. triple, now？Become
The part of Instance Name rather than represent variable, is combined with terminology and to form new knowledge base.
(5) can be drawn by reasoning, (？X, rdf:type, chair), (？z,owl:sameAs,？The hiding information such as o).
(6) according to (？X, rdf:type, chair) in the middle owl:equiventClass attribute of chair concept, it is equivalent to
Person class and the common factor of isheadof, its replacement query atom available (？X, rdf:type, person) and
(？x,isheadof,？The hiding information that z), obtains according to the 5th step (？z,owl:sameAs,？O), can be by？Z and？O closes
Be a variable, then and pass through (isheadof, rdf:subPorperty, workat) can eliminate (？x,workat,？O) pass through
Query statement after above-mentioned steps simplifies is:
q'(x,y)←(？x,rdf:type,chair).
.(？x,islead,？o).(？o,hasamember,？y)
Then on Jena, perform this query statement i.e. can get identical result.
3, Comparative result
Query time and optimization spent time before optimizing and after optimization can see table:
| Time (s) | Lumb1 | Lumb2 | Lumb3 |
| Before optimization | 0.38 | 5.2 | 20 |
| The optimization time | 0.15 | 0.15 | 0.15 |
| After optimization | 0.2 | 4.1 | 14 |
By upper table, after employing the system of invention, for the biggest data volume, the average lookup time of Jena reduces
More, and it is constant for optimizing the consumed time, big so that with data quantitative change, effect of optimization becomes apparent from.This also demonstrates this
Bright being applicable to inquires about the knowledge base asserting that blocks of data amount is the biggest.Certainly, present system also can be applied and the looking into of other developing instruments
Ask the optimization of engine such as Sesame.
Non-elaborated part of the present invention belongs to techniques well known.
Above example is only in order to illustrative not limiting technical scheme, and any without departing from spirit and scope of the invention repaiies
Change or local is replaced, all should contain in the middle of scope of the presently claimed invention.What the present invention did not described in detail partly belongs to ability
Territory known technology.
Claims (4)
1. an ontology query engine based on ontology semantic information optimizes system, it is characterised in that including: query statement is located in advance
Reason module, query statement derivation module and query optimization module；Wherein:
Query statement pretreatment module: query statement resolves into a series of simple conjunctive query, will change into analysis by query statement
Taking normal form, have only to afterwards inquire about each conjunctive query statement, Query Result is the union of each conjunctive query result；
For single conjunctive query, query interface therein is divided into terminology variable and asserts block variable two class, inquiry atom is also divided
Become two big classes, i.e. assert block atom and terminology atom；Individually being put forward by terminology atom, composition pertains only to terminology information
Query statement, call query engine, on terminology inquire about, by Query Result successively replacement query statement terminology become
Amount, forms a series of query statement pertaining only to assert block message；Described terminology variable represents that this occurrences is at RDF tri-
Concept and the position of attribute in tuple, assert that block variable then occurs from the position of example, and described RDF is resource description framework,
A kind of markup language for describing web resource, terminology atom then relates to the inquiry atom of terminology information, and other are then
It is to assert block atom；
Query statement derivation module: for single block query statement of asserting, changes into each inquiry atom and asserts that block breaks accordingly
Speech, each variable becomes asserting an example in block, the knowledge base new with terminology composition；For new knowledge base, use
It is made inferences by ontology inference machine, and ontology inference machine utilizes the semantic information in body to make inferences, and draws in knowledge base implicit
Information, including the uniformity in judgemental knowledge storehouse, draw implicit triple relation according to dependency rule, believed by Ontology
Breath derives a series of implicit information；
Query optimization module: be optimized former query statement according to the implicit information derived, obtains the most succinct looking into
Ask statement；To assert that block query statement calls query engine and asserting that block obtains result and ties mutually with the Query Result on terminology
Close, i.e. can get the result of former query statement.
Ontology query engine based on ontology semantic information the most according to claim 1 optimizes system, it is characterised in that:
In described query optimization module, according to the implicit information derived, former query statement is optimized, obtains the most succinct
Query statement is implemented as follows:
(1) if reasoning show that knowledge base is inconsistent, then explanation query statement is problematic, can not get Query Result, now looks into
Inquiry result is meaningless, it is not necessary to optimize；
(2) it is owl:sameAs for the triple predicate position derived, i.e. individual equivalence relation, represent two individualities
Two variablees if subject and object are all variable, are then merged into a variable by identical triple, if there being a constant
It is i.e. the value of this variable query with a variable then this constant；
(3) being the triple of rdf:type for the triple predicate position derived, wherein subject position is variable, object
Position is concept, then according to object position concept definition owl:equiventClass attribute, i.e. and class equivalence relation, represent two
Class is identical, then replace correspondence inquiry atom, can not comprise its dependent variable in the inquiry atom of replacement；
(4) if inquiry atom comprises the triple of two individual type declarations, represent respectively？X is C1The individuality of class, with
Time be also C2The individuality of class, wherein？X represents the variable in query statement, C1、C2For the concept class in knowledge base, andThen can eliminate；
(5) if inquiry atom comprises two triple and represents respectively？X is C1The individuality of class,？X by attribute p and other
Individual association, wherein？X represents the variable in query statement, C1For the concept class in knowledge base, p is the attribute in knowledge base,
And the definition territory of attribute p is C1, then expression can be eliminated？X is C1The individual triple of class；
(6) by above step, the query statement more simplified.
Ontology query engine based on ontology semantic information the most according to claim 1 optimizes system, it is characterised in that: institute
State in query statement pretreatment module and terminology atom is individually put forward, when composition pertains only to the query statement of terminology information,
If only one of which subtype triple terminology atom in query statement, represent？X is？The subclass of y, wherein？x、？Y generation
Variable in table query statement, then be focused to find out all individualities meeting condition at term, and substitute original inquiry by these concepts
In statement？X and？y；If only one of which subtype triple terminology inquiry atom, represent？X is the subclass of y, wherein
？X represents the variable in query statement, and y is constant, represents certain Ontological concept in knowledge base；And？X is not the most inquiry language
Sentence it is to be understood that value xnIn one, xnNeed to obtain the Variables Sequence of result for query statement, originally？The Query Value of x should
For all subclasses of y, this kind of situation？X can only replace forming a query statement with y.
Ontology query engine based on ontology semantic information the most according to claim 1 optimizes system, it is characterised in that:
Inquiry atom is changed into by described query statement derivation module when asserting that block is asserted, such as the triple of individual type declarations, represent
？X is the individuality of Person class, wherein？X represents the variable in query statement, and Person is that represent people in knowledge base this is general
The body read, then will generate an example entitled？The individuality of the Person class of x.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310641921.1A CN103617265B (en) | 2013-12-03 | 2013-12-03 | A kind of ontology query engine based on ontology semantic information optimizes system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310641921.1A CN103617265B (en) | 2013-12-03 | 2013-12-03 | A kind of ontology query engine based on ontology semantic information optimizes system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103617265A CN103617265A (en) | 2014-03-05 |
| CN103617265B true CN103617265B (en) | 2016-08-31 |
Family
ID=50167968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310641921.1A Expired - Fee Related CN103617265B (en) | 2013-12-03 | 2013-12-03 | A kind of ontology query engine based on ontology semantic information optimizes system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103617265B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104915420B (en) * | 2015-06-10 | 2019-12-31 | 百度在线网络技术（北京）有限公司 | Knowledge base data processing method and system |
| US10984195B2 (en) * | 2017-06-23 | 2021-04-20 | General Electric Company | Methods and systems for using implied properties to make a controlled-english modelling language more natural |
| CN109976805B (en) * | 2019-03-31 | 2022-09-09 | 东南大学 | Event-driven architecture mode identification method based on ontology |
| CN110110044B (en) * | 2019-04-11 | 2020-05-05 | 广州探迹科技有限公司 | Method for enterprise information combination screening |
| CN111259041A (en) * | 2020-02-26 | 2020-06-09 | 山东理工大学 | Scientific and technological expert resource virtualization and semantic reasoning retrieval method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101853257A (en) * | 2009-03-31 | 2010-10-06 | 国际商业机器公司 | System and method for transformation of SPARQL query |
| CN102693310A (en) * | 2012-05-28 | 2012-09-26 | 无锡成电科大科技发展有限公司 | Resource description framework querying method and system based on relational database |
-
2013
- 2013-12-03 CN CN201310641921.1A patent/CN103617265B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101853257A (en) * | 2009-03-31 | 2010-10-06 | 国际商业机器公司 | System and method for transformation of SPARQL query |
| CN102693310A (en) * | 2012-05-28 | 2012-09-26 | 无锡成电科大科技发展有限公司 | Resource description framework querying method and system based on relational database |
Non-Patent Citations (3)
| Title |
|---|
| New method for query answering in semantic web;Lin Peiguang 等;《Journal of Southeast University(English Edition)》;20060930;第22卷(第3期);第319-323页 * |
| 基于属性相关性的SPARQL查询优化方法;吕彬 等;《计算机研究与发展》;20091231;第46卷(第z2期);第119-125页 * |
| 混合语义约简和选择估值优化SPARQL;叶育鑫 等;《电子学报》;20100531;第38卷(第5期);第1205-1210页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103617265A (en) | 2014-03-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lambrix et al. | SAMBO—a system for aligning and merging biomedical ontologies | |
| CN103617265B (en) | A kind of ontology query engine based on ontology semantic information optimizes system | |
| Marx et al. | Logic on MARS: Ontologies for Generalised Property Graphs. | |
| CN101566988A (en) | Method, system and device for searching fuzzy semantics | |
| CN104239513A (en) | Semantic retrieval method oriented to field data | |
| San Martın et al. | SNQL: A social networks query and transformation language | |
| Taheriyan et al. | A graph-based approach to learn semantic descriptions of data sources | |
| CN103279458B (en) | A kind of structure of domain body and instantiation method | |
| CN102135905A (en) | User customization-based body matching system and method | |
| CN106557967A (en) | A kind of product-design knowledge builds processing method | |
| Ra et al. | The mixed ontology building methodology using database information | |
| Zaiß | Instance-based ontology matching and the evaluation of matching systems. | |
| Lubyte et al. | Extracting Ontologies from Relational Databases. | |
| CN106708475A (en) | Northbound data conversion method and apparatus | |
| Futia et al. | Training neural language models with sparql queries for semi-automatic semantic mapping | |
| Gupta et al. | Semantic query optimisation with ontology simulation | |
| CN102930030A (en) | Ontology-based intelligent semantic document indexing reasoning system | |
| Fürber et al. | Using semantic web technologies for data quality management | |
| An et al. | Maintaining semantic mappings between database schemas and ontologies | |
| CN103235802A (en) | Method and system for obtaining complex demands of user | |
| CN103973799B (en) | A kind of resource environment data decision support platform | |
| Orsi | Context based querying of dynamic and heterogeneous information sources. | |
| Gonçalves et al. | $\Upsilon $-DB: A system for data-driven hypothesis management and analytics | |
| Hu et al. | Research and implementation of domain-specific ontology building from relational database | |
| Walha et al. | From user generated content to social data warehouse: Processes, operations and data modelling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180202 Address after: 518000 Guangdong, Futian District, Shenzhen, Shenzhen, Futian District, Futian District, Shenyang Street, Shennan Road, Shenzhen International Innovation Center, 18 building Patentee after: Shenzhen Air Technology Co., Ltd. Address before: 518057 Virtual University Park A501, Nanshan District hi-tech South District, Shenzhen, Guangdong Patentee before: Research Institute of Beihang University in Shenzhen |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160831 Termination date: 20171203 |