Search results

The capability of the current Union Catalogue application, which assists the cooperation between 232 libraries throughout Greece, is discussed. Using this application, librarians can search for desired scientific journals, locate possible provider libraries and select some of them. Afterwards they can monitor the status of the order until it is completed. The librarians providing articles can examine their pending orders in their screen and handle them by locating the printed journal, sending the article in the designated way and updating the order status. The capability of a successor application, already under preparation, is also discussed. This new version will allow easier – and independent of other libraries – updating of journal data, the capability of using external sources of journal collections and also information about article details, for detecting articles in journals, as well as the exploration of electronic sources of full text archives for providing articles without human intervention.

This paper aims to describe how approaches such as semantic based query rewritings and FRBR work entities composition could solve existing problems and improve the overall behavior of a mediated based meta‐search environment. Moreover, it aims to present meta‐Composer, which is a meta‐search engine without query failures that composes work level entities for display, as well as an autonomous open service for discovering substitutions of unsupported access points, in the context of the Z39.50 environment.

Semantic Access Point Network (SAPN) engine, which is a system for substitution of unsupported access points by exploiting semantic access point information from an RDFS description, was extended as a query rewriting system taking into account user preferences for recall and precision. Additionally, the Library of Congress FRBR display tool was extended to create, in the first place, MARC21, UNIMARC and MODS wrappers for the production of work‐expression‐manifestation identifiers, and, secondly, the composition of work clusters. Finally, pazpar2, the open source meta‐search engine was used as both the middleware and the client platform for the integration of all the above components and the development of meta‐Composer.

Consistent extension of the meta‐search search functionality is possible from the lowest common denominator of the supported access points through semantic based query rewritings. Furthermore, enabling query specificity, which restricts the resulting records, could really improve the overall performance of the system and allow for more space for other extensions. Work centric result presentation gives a more compact and coherent view to the user compared to the typical record‐based de‐duplicated display.

The technical limitation for retrieving all the results from all sources, especially for large result sets, indicates the need for further research for the development of heuristics in order to find the best sources for enriching the results by unique work clusters. The absence of tools, such as authority files, limits the accuracy of the FRBRization process and the discovery of correlations between related works.

Consistent meta‐search services require widespread use of international metadata standards and communication protocols.

The SAPN technology enforces implicitly the semantic interoperability in the context of the Z39.50 protocol. meta‐Composer is an open service which offers meta‐search within valuable sources world wide and it also provides the potential to evaluate new services. The SAPN open service gives the ability to any other mediator or client, to extend and improve consistently its search functionality, in the same context and by using web services technology.

This paper aims to propose a toolset that enables individual digital collections owners to satisfy the requirements of aggregators even in cases where their IT and software infrastructure is limited and does not support them inherently. Managers of repositories/digital collections face the challenge of exposing their data via Open Archives Initiative – Protocol for Metadata Harvesting (OAI-PMH) to multiple aggregators and conforming to their possibly differing requirements, for example on output metadata schemas and selective harvesting.

The authors developed a software server that is able to wrap existing systems or even metadata records in plain files as OAI-PMH sources. They analysed the functionality of OAI-PMH data providers in a flow of discrete steps and used a software library to modularise the software for these steps so that the whole process can be easily customised to the needs of each pair of OAI-PMH data provider and service provider. The developed server includes a mechanism for the implementation of schema mappings using an XML specification that can be defined by non-IT personnel, for example metadata experts. The server has been applied in various real-life use cases, in particular for providing content to Europeana.

It has been concluded through real-life use cases that it is indeed possible and feasible in practice to expose metadata records of digital collections via OAI-PMH even when the data sources do not support the required protocols and standards. Even advanced OAI-PMH features like selective harvesting can be supported. Mappings between input and output schemas in many practical cases can be implemented entirely or to a large extent as XML specifications by metadata experts instead of software developers.

Exposing data via OAI-PMH to aggregators like Europeana is made feasible/easier for digital collections owners, even when their software infrastructure does not inherently support the required protocols and standards.

The approach is original and applicable in practice to diverse technology environments, effectively addressing the indisputable fact of the heterogeneity of software and systems used to implement digital repositories and collections worldwide.

The purpose of this paper is to focus on duplicate record detection algorithms used for detection in bibliographic databases.

Individual algorithms, their application process for duplicate detection and their results are described based on available literature (published articles), information found at various library web sites and follow‐up e‐mail communications.

Algorithms are categorized according to their application as a process of a single step or two consecutive steps. The results of deletion, merging, and temporary and virtual consolidation of duplicate records are studied.

The paper presents an overview of the duplication detection algorithms and an up‐to‐date state of their application in different library systems.