Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies Jesse Weaver

Question is for the Presentation: Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies
Question is asked by: Jesse Weaver
The Question is: Line 3 in the algorithm presented in Table 1 iterates over all of disjoint subclasses of class v. What if class v has subclasses that are not disjoint? How would it handle this condition? Also, line 9 of the same algorithm uses a threshold τ. What value of τ is used in the second experiment (generating contextual mappings)?
Answered By: Joshua Taylor
Answer: As presented, I do not think that ContextMatch would be capable of handling non-disjoint subclasses in the expected manner. It also wouldn't seem to handle individuals whose most specific class are not leaves.

Question answer	As presented, I do not think that ContextMatch would be capable of handling non-disjoint subclasses in the expected manner. It also wouldn't seem to handle individuals whose most specific class are not leaves.
Question answered by	Joshua Taylor +
Question asked	Line 3 in the algorithm presented in Table … Line 3 in the algorithm presented in Table 1 iterates over all of disjoint subclasses of class v. What if class v has subclasses that are not disjoint? How would it handle this condition? Also, line 9 of the same algorithm uses a threshold τ. What value of τ is used in the second experiment (generating contextual mappings)? periment (generating contextual mappings)?
Question asked by	Jesse Weaver +
Question for the Presentation	Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies +