|
|||
|
This is version 35.
It is not the current version, and thus it cannot be edited. OverviewThe following operations are described in more detail below.
interface ISemanticMediation { search( ConceptExpression, Set<ResourceType>, RemoteSearchFlag ) :: Set<ResourceID> query( QueryExpression, RemoteSearchFlag ) :: Set<QueryResult> }
Search: Simple Concept-Based Searching
search( ConceptExpression, Set<ResourceType>, RemoteSearchFlag ) :: Set<ResourceID> The arguments for this service are:
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). 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 searchingIn general, the search operation requires access to all semantic annotations (i.e., for remote searches all remote annotations) to find matching resources. Because of this requirement, as the number of semantic annotations increases, this operation can become expensive. 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. The additional services are: getRepositories() :: Set<RepositoryID> getResources() :: Set<ResourceID> partialSearch( ConceptExpression, ResourceID ) :: Set<ConceptExpression>Using these operations, the search algorithm would procede as follows. First, the search algorithm contacts a remote repository ... This needs some work: what we want to do is, e.g., ask S1 it's resources (e.g., R1, R2, and R3) and then "ship" the expressions (C1 and C2)/R1, (C1 and C2)/R2, and (C1 and C2)/R3 only to S1, which would return R1/match, R2/C1, R3/C2, and then we would want to do something similar with S2: ask it what resources it has, then ship (C1 and C2)/RX to S2 except if X=2 or X=3, in which case we would ship (R2/C2) and (R3/C1), and so on
Here a semantic type is a concept expression generated from a semantic annotation. Providing and index over a resource's
|
This material is based upon work supported by the National Science Foundation under award 0225676. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF). Copyright 2004 Partnership for Biodiversity Informatics, University of New Mexico, The Regents of the University of California, and University of Kansas |