Information Retrieval: Application Service Definition and Protocol Specification, Z39.50-1995
Information Retrieval: Application Service Definition and Protocol Specification, Z39.50-1995
Enhance the interoperability of the library search systems with zSAPN
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Semantic Based Substitution of Unsupported Access Points in the Library Meta-search Environments
ECDL '08 Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries
| Hi-index | 0.00 |
A graph of Access Points can be used as a tool in a number of applications such as, clarification and better understanding of their semantics and inter-relations, query transformations, more precise query formulation, etc. We apply a procedure to create a graph of the Access Points, according to their subset relationship, based on the official semantics of the Bib-1 Access Points of the Z39.50 protocol. In our three-step method, we first construct the relationship graph of the Access Points by testing for subset relationship between any two Access Points, and assigning each Access Point a weight value designating the number of the Access Points, which are subsets to it. In the second step, we apply a topological sorting algorithm on the graph, and finally in the last step, we reject the redundant subset relationships of the Access Points.