Designing Metadata Harvesting Framework for OAI-based LIS Repositories: A Prototype
<p>The paper provides an overview over the functionalities of the proposed harvesting model (BURA – Burdwan University Research Archive) and describes the activities involved in harvesting resources from OAI compliant LIS (Library and Information Science) repositories. Repositories, registered...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Regional Information Center for Science and Technology (RICeST)
2016-12-01
|
| Series: | International Journal of Information Science and Management |
| Online Access: | https://ijism.ricest.ac.ir/index.php/ijism/article/view/938 |
| Summary: | <p>The paper provides an overview over the functionalities of the proposed harvesting model (BURA – Burdwan University Research Archive) and describes the activities involved in harvesting resources from OAI compliant LIS (Library and Information Science) repositories. Repositories, registered in OpenDOAR database, containing 'Library and Information Science' as one of the key subject have been considered and finally 117 repositories have been short listed on the basis of framed criteria. The purpose of this paper is to report an integrated Web-enabled distributed harvesting model that can extract and update metadata index efficiently from any OAI-PMH driven repositories on global scale. The findings suggest that LIS repositories are not up to the global standards and lack contents compared to others disciplinary repositories. It should follow open standards and should respect essence of interoperability. The model may be an interoperability solution to the professional librarians in designing and developing federated search option for multiple repositories from a single-window search interface. Thus, it may be concluded that this proposed harvesting framework may work as a guiding tool to those who plan to set up new OAI-based service provider.</p><p>DOR: <span>98.1000/1726-8125.2017.15.73.0.1.68.101</span></p> |
|---|---|
| ISSN: | 2008-8302 2008-8310 |