org.openrdf.concepts.skos.mapping
Interface MappingResource

All Superinterfaces:

Entity, Resource

All Known Subinterfaces:

AND, NOT, OR

public interface MappingResource
extends Resource

Method Summary

Set<Object>	getSkosBroadMatchs() If 'concept A has-broad-match concept B' then the set of resources properly indexed against concept A is a subset of the set of resources properly indexed against concept B.
Set<Object>	getSkosExactMatchs() If two concepts are an 'exact-match' then the set of resources properly indexed against the first concept is identical to the set of resources properly indexed against the second.
Set<Object>	getSkosMajorMatchs() If 'concept A has-major-match concept B' then the set of resources properly indexed against concept A shares more than 50% of its members with the set of resources properly indexed against concept B.
Set<Object>	getSkosMappingRelations() The super-property of all properties expressing information about how to create mappings between concepts frmo different conceptual schemes.
Set<Object>	getSkosMinorMatchs() If 'concept A has-minor-match concept B' then the set of resources properly indexed against concept A shares less than 50% but greater than 0 of its members with the set of resources properly indexed against concept B.
Set<Object>	getSkosNarrowMatchs() If 'concept A has-narrow-match concept B' then the set of resources properly indexed against concept A is a superset of the set of resources properly indexed against concept B.
void	setSkosBroadMatchs(Set<?> value) If 'concept A has-broad-match concept B' then the set of resources properly indexed against concept A is a subset of the set of resources properly indexed against concept B.
void	setSkosExactMatchs(Set<?> value) If two concepts are an 'exact-match' then the set of resources properly indexed against the first concept is identical to the set of resources properly indexed against the second.
void	setSkosMajorMatchs(Set<?> value) If 'concept A has-major-match concept B' then the set of resources properly indexed against concept A shares more than 50% of its members with the set of resources properly indexed against concept B.
void	setSkosMappingRelations(Set<?> value) The super-property of all properties expressing information about how to create mappings between concepts frmo different conceptual schemes.
void	setSkosMinorMatchs(Set<?> value) If 'concept A has-minor-match concept B' then the set of resources properly indexed against concept A shares less than 50% but greater than 0 of its members with the set of resources properly indexed against concept B.
void	setSkosNarrowMatchs(Set<?> value) If 'concept A has-narrow-match concept B' then the set of resources properly indexed against concept A is a superset of the set of resources properly indexed against concept B.

Methods inherited from interface org.openrdf.concepts.rdfs.Resource

getRdfsComment, getRdfsIsDefinedBy, getRdfsLabel, getRdfsMembers, getRdfsSeeAlso, getRdfTypes, getRdfValues, setRdfsComment, setRdfsIsDefinedBy, setRdfsLabel, setRdfsMembers, setRdfsSeeAlso, setRdfTypes, setRdfValues

Methods inherited from interface org.openrdf.elmo.Entity

getElmoManager, getQName

Method Detail

getSkosBroadMatchs

Set<Object> getSkosBroadMatchs()

If 'concept A has-broad-match concept B' then the set of resources properly indexed against concept A is a subset of the set of resources properly indexed against concept B.

setSkosBroadMatchs

void setSkosBroadMatchs(Set<?> value)

If 'concept A has-broad-match concept B' then the set of resources properly indexed against concept A is a subset of the set of resources properly indexed against concept B.

getSkosExactMatchs

Set<Object> getSkosExactMatchs()

If two concepts are an 'exact-match' then the set of resources properly indexed against the first concept is identical to the set of resources properly indexed against the second. Therefore the two concepts may be interchanged in queries and subject-based indexes.

setSkosExactMatchs

void setSkosExactMatchs(Set<?> value)

If two concepts are an 'exact-match' then the set of resources properly indexed against the first concept is identical to the set of resources properly indexed against the second. Therefore the two concepts may be interchanged in queries and subject-based indexes.

getSkosMajorMatchs

Set<Object> getSkosMajorMatchs()

If 'concept A has-major-match concept B' then the set of resources properly indexed against concept A shares more than 50% of its members with the set of resources properly indexed against concept B.

setSkosMajorMatchs

void setSkosMajorMatchs(Set<?> value)

If 'concept A has-major-match concept B' then the set of resources properly indexed against concept A shares more than 50% of its members with the set of resources properly indexed against concept B.

getSkosMappingRelations

Set<Object> getSkosMappingRelations()

The super-property of all properties expressing information about how to create mappings between concepts frmo different conceptual schemes.

setSkosMappingRelations

void setSkosMappingRelations(Set<?> value)

The super-property of all properties expressing information about how to create mappings between concepts frmo different conceptual schemes.

getSkosMinorMatchs

Set<Object> getSkosMinorMatchs()

If 'concept A has-minor-match concept B' then the set of resources properly indexed against concept A shares less than 50% but greater than 0 of its members with the set of resources properly indexed against concept B.

setSkosMinorMatchs

void setSkosMinorMatchs(Set<?> value)

If 'concept A has-minor-match concept B' then the set of resources properly indexed against concept A shares less than 50% but greater than 0 of its members with the set of resources properly indexed against concept B.

getSkosNarrowMatchs

Set<Object> getSkosNarrowMatchs()

If 'concept A has-narrow-match concept B' then the set of resources properly indexed against concept A is a superset of the set of resources properly indexed against concept B.

setSkosNarrowMatchs

void setSkosNarrowMatchs(Set<?> value)

If 'concept A has-narrow-match concept B' then the set of resources properly indexed against concept A is a superset of the set of resources properly indexed against concept B.