SMS Service Interfaces

This is version 45. It is not the current version, and thus it cannot be edited.
[Back to current version]   [Restore this version]

Overview

The following lists the semantic mediation service interfaces:

interface ISemanticMediation {

   search( ConceptExpression, Set<ResourceType>, RemoteFlag )  ::  Set<ResourceID>

   query( QueryExpression, RemoteFlag )  ::  Set<QueryResult>

   compatible( ResourceID, ResourceID, Connection, RemoteFlag )  ::  Boolean
 
   searchCompatible( ResourceID, Port, RemoteFlag ) :: Set<ResourceID>




   getSemanticType( ResourceID, String, RemoteSearchFlag ) :: ConceptExpression

   connect( ResourceID, ResourceID, RemoteSearchFlag ) :: 
}   

The rest of this page describes each of these services and their dependencies.

Search: Simple Concept-Based Searching

search( ConceptExpression, Set<ResourceType>, RemoteSearchFlag )  ::  Set<ResourceID>

The arguments for this service are:

1. A search term represented as a description-logic concept expression;
2. A set of resource types, e.g., "actor" and/or "dataset"; and
3. A flag denoting whether local or remote repositories are searched

We assume that (via a GUI) an initial search string has been converted to a description-logic concept expression. A concept expression can be single concept (like "Biomass") or a complex formula (including nested disjunctive and conjunctive formulas, and so on). We assume each concept is associated to the ontology it is defined in (e.g., where the ontology is implied by the concept identifier).

The search service depends on the following kepler object manager services:

getResourceType( ResourceID )  ::  ResourceType

getSemanticAnnotations( RemoteSearchFlag )  ::  Set<SemanticAnnotationID>

getOntology( OntologyID )  ::  Set<Ontology>

The first operation returns the resource type of a given resource identifier (an LSID). The second operation returns the set of semantic annotations known to the kepler object manager (including annotations stored on remote repositories depending on the value of the search flag). The last operation returns the ontology for a given ontology identifier (also a resource id).

Optimized Remote Searching

In general, the search operation requires access to all semantic annotations to find matching resources. For example, consider a search expression A and B, i.e., a resource must contribute to both concept A and concept B. To find appropriate matches for this search term, the algorithm must look for annotations that explicitly state A and B as well as those that state only A and only B (which taken together make A and B). Note that an annotation that states only A may be in one repository, while an annotation that states only B may be in another. Thus, for remote searches, the search algorithm must gather and consider all remote annotations to find matching resources. The search operation is inherently centralized because of this situation.

We may reduce the cost of search by adding additional services that can be executed locally at each repository and by altering the search algorithm, making it slightly less centralized. The additional services are:

getRepositories()  ::  Set<RepositoryID>

getResources( RepositoryID, Set<ResourceType> )  ::  Set<ResourceID>

partialSearch( RepositoryID, ConceptExpression, ResourceID )  ::  Set<ConceptExpression>

Using these operations, the search algorithm would procede as follows, assuming that the remote search flag has been selected. With the getRepositories service, the algorithm first obtains the available repositories from the local kepler object manager. The algorithm selects the first returned repository and with the getRepositories service, obtains the relevant resources in the respository. For each resource in the repository, the partialSearch service is used, which returns the parts of the concept expression that the resource matches (e.g., just the concept A). The algorithm then moves to the next repository, performing the same steps. However, for those resources already having partial matches (from the previous step), the algorithm reformulates the search term given to partialSearch to include only the additional required parts of the concept expression (e.g., just the concept B). Once a complete match is found, the resource is considered a match and is not further checked. Finally, the algorithm repeats the process until all repositories have been examined.

Query: Complex Concept-Based Searching

query( QueryExpression, RemoteSearchFlag )  ::  Set<QueryResult>