Show simple item record

dc.contributor.authorΚαπιδάκης, Σαράντοςel_GR
dc.contributor.authorΣφακάκης, Μιχάληςel_GR
dc.contributor.authorKapidakis, Sarantosen
dc.contributor.authorSfakakis, Michalisen
dc.descriptionΠεριέχει το πλήρες κείμενοel_GR
dc.description.abstractA 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. © Springer-Verlag Berlin Heidelberg 2006.en
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 4172 LNCS, 2006, Pages 445-448en
dc.titleA semantics-based graph for the Bib-1 Access Points of the Z39.50 protocolen
dc.subject.JITAΠηγές πληροφορησης, υποστήριξη, δίαυλοιen
dc.subject.JITAInformation sources, supports, channelsen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record