Science Environment for Ecological Knowledge
Ecoinformatics site parent site of Partnership for Biodiversity Informatics site parent site of SEEK - Home
Science Environment for Ecological Knowledge









 

 

 



SMS Service Interfaces

Difference between version 38 and version 37:

Line 39 was replaced by line 39
- ! Optimized searching
+ ! Optimized Remote Searching
At line 43 added 1 line.
+
Line 47 was replaced by line 48
- getResources( RepositoryID ) :: Set<ResourceID>
+ getResources( RepositoryID, Set<ResourceType> ) :: Set<ResourceID>
Removed line 51
- Using these operations, the search algorithm would procede as follows. First, the search algorithm contacts a remote repository ...
Line 53 was replaced by line 53
- 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
+ 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.
Line 56 was replaced by line 56
- Here a semantic type is a concept expression generated from a semantic annotation. Providing and index over a resource's
+ !! {{Query}}: Complex Concept-Based Searching

Back to SMS Service Interfaces, or to the Page History.