1. A computer-implemented method for answering a database-based query of a computerized database system, said method comprising: generating a canonical individual ind′ with respect to a role and a concept, for an existential restriction in an ontology used in said computerized database system; converting implicit data in original data into explicit data by using said canonical individual ind′ and said ontology; retrieving an answer meeting all query conditions in a query from said original data and said converted explicit data; and normalizing a concept axiom and a role axiom in said ontology into an atomic concept subsumption axiom sub⊂sup, an intersection concept subsumption axiom sub1 ∩sub2 ⊂sup, an existential restriction left subsumption axiom ∃role.sub⊂sup, an existential restriction right subsumption axiom sub⊂∃role.sup, a role subsumption axiom role1 ⊂role2, and a role chain subsumption axiom role1 °role2 ⊂role3, wherein sub represents a subclass concept, sup represents a superclass concept, and role represents a role; wherein said step of converting implicit data in original data into explicit data by using said canonical individual ind′ and said ontology comprises: generating triple data with respect to said original data and said canonical individual ind′ based on said normalized concept axiom and said role axiom using said original data and said canonical individual ind′ and a corresponding role and concept.
1. A computer-implemented method for answering a database-based query of a computerized database system, said method comprising: generating a canonical individual ind′ with respect to a role and a concept, for an existential restriction in an ontology used in said computerized database system; converting implicit data in original data into explicit data by using said canonical individual ind′ and said ontology; retrieving an answer meeting all query conditions in a query from said original data and said converted explicit data; and normalizing a concept axiom and a role axiom in said ontology into an atomic concept subsumption axiom sub⊂sup, an intersection concept subsumption axiom sub1 ∩sub2 ⊂sup, an existential restriction left subsumption axiom ∃role.sub⊂sup, an existential restriction right subsumption axiom sub⊂∃role.sup, a role subsumption axiom role1 ⊂role2, and a role chain subsumption axiom role1 °role2 ⊂role3, wherein sub represents a subclass concept, sup represents a superclass concept, and role represents a role; wherein said step of converting implicit data in original data into explicit data by using said canonical individual ind′ and said ontology comprises: generating triple data with respect to said original data and said canonical individual ind′ based on said normalized concept axiom and said role axiom using said original data and said canonical individual ind′ and a corresponding role and concept. 2. The method according to claim 1 , further comprising: generating a base path starting from a named individual and ending at a canonical individual according to said original data and said converted explicit data; determining whether said query has a fork; and rewriting said query by appending a first query condition if said query has said fork and a root variable of said fork is matched with said canonical individual according to said original data and said converted explicit data, wherein said first query condition is an existing base path is required such that all matching variables in said fork are nodes directly or indirectly located in said base path.