Books and journals Case studies Expert Briefings Open Access
Advanced search

The data-literature interlinking service: Towards a common infrastructure for sharing data-article links

Adrian Burton (Australian National Data Service, Melbourne, Australia)
Hylke Koers (Elsevier BV, Amsterdam, The Netherlands)
Paolo Manghi (Institute of Information Science and Technology – CNR, Pisa, Italy)
Sandro La Bruzzo (Institute of Information Science and Technology – CNR, Pisa, Italy)
Amir Aryani (Australian National Data Service, Melbourne, Australia)
Michael Diepenbroek (PANGAEA, Bremen, Germany)
Uwe Schindler (PANGAEA, Bremen, Germany)

Program: electronic library and information systems

ISSN: 0033-0337

Publication date: 3 April 2017

Abstract

Purpose

Research data publishing is today widely regarded as crucial for reproducibility, proper assessment of scientific results, and as a way for researchers to get proper credit for sharing their data. However, several challenges need to be solved to fully realize its potential, one of them being the development of a global standard for links between research data and literature. Current linking solutions are mostly based on bilateral, ad hoc agreements between publishers and data centers. These operate in silos so that content cannot be readily combined to deliver a network graph connecting research data and literature in a comprehensive and reliable way. The Research Data Alliance (RDA) Publishing Data Services Working Group (PDS-WG) aims to address this issue of fragmentation by bringing together different stakeholders to agree on a common infrastructure for sharing links between datasets and literature. The paper aims to discuss these issues.

Design/methodology/approach

This paper presents the synergic effort of the RDA PDS-WG and the OpenAIRE infrastructure toward enabling a common infrastructure for exchanging data-literature links by realizing and operating the Data-Literature Interlinking (DLI) Service. The DLI Service populates and provides access to a graph of data set-literature links (at the time of writing close to five million, and growing) collected from a variety of major data centers, publishers, and research organizations.

Findings

To achieve its objectives, the Service proposes an interoperable exchange data model and format, based on which it collects and publishes links, thereby offering the opportunity to validate such common approach on real-case scenarios, with real providers and consumers. Feedback of these actors will drive continuous refinement of the both data model and exchange format, supporting the further development of the Service to become an essential part of a universal, open, cross-platform, cross-discipline solution for collecting, and sharing data set-literature links.

Originality/value

This realization of the DLI Service is the first technical, cross-community, and collaborative effort in the direction of establishing a common infrastructure for facilitating the exchange of data set-literature links. As a result of its operation and underlying community effort, a new activity, name Scholix, has been initiated involving the technological level stakeholders such as DataCite and CrossRef.

Keywords

  • RDA
  • Data citation
  • Scholarly communication
  • Data-literature links
  • Data-publication interlinking
  • OpenAIRE

Acknowledgements

The authors would like to thank the PDS-WG members and representatives from CrossRef, DataCite, The National Data Service, ORCID, The Research Data Alliance, ICSU World Data Systems, and the RMap project for many valuable discussions and constructive interactions. This work is partially funded by the EU projects RDA Europe (FP7-INFRASTRUCTURES-2013-2, Grant Agreement: 632756) and OpenAIRE2020 (H2020-EINFRA-2014-1, Grant Agreement: 643410).

Citation

Burton, A., Koers, H., Manghi, P., La Bruzzo, S., Aryani, A., Diepenbroek, M. and Schindler, U. (2017), "The data-literature interlinking service: Towards a common infrastructure for sharing data-article links", Program: electronic library and information systems, Vol. 51 No. 1, pp. 75-100. https://doi.org/10.1108/PROG-06-2016-0048

Download as .RIS

Publisher

:

Emerald Publishing Limited

Copyright © 2017, Emerald Publishing Limited

Please note you do not have access to teaching notes

You may be able to access teaching notes by logging in via Shibboleth, Open Athens or with your Emerald account.
Login
If you think you should have access to this content, click the button to contact our support team.
Contact us

To read the full version of this content please select one of the options below

You may be able to access this content by logging in via Shibboleth, Open Athens or with your Emerald account.
Login
To rent this content from Deepdyve, please click the button.
Rent from Deepdyve
If you think you should have access to this content, click the button to contact our support team.
Contact us
Emerald Publishing
  • Opens in new window
  • Opens in new window
  • Opens in new window
  • Opens in new window
© 2021 Emerald Publishing Limited

Services

  • Authors Opens in new window
  • Editors Opens in new window
  • Librarians Opens in new window
  • Researchers Opens in new window
  • Reviewers Opens in new window

About

  • About Emerald Opens in new window
  • Working for Emerald Opens in new window
  • Contact us Opens in new window
  • Publication sitemap

Policies and information

  • Privacy notice
  • Site policies
  • Modern Slavery Act Opens in new window
  • Chair of Trustees governance statement Opens in new window
  • COVID-19 policy Opens in new window
Manage cookies

We’re listening — tell us what you think

  • Something didn’t work…

    Report bugs here

  • All feedback is valuable

    Please share your general feedback

  • Member of Emerald Engage?

    You can join in the discussion by joining the community or logging in here.
    You can also find out more about Emerald Engage.

Join us on our journey

  • Platform update page

    Visit emeraldpublishing.com/platformupdate to discover the latest news and updates

  • Questions & More Information

    Answers to the most commonly asked questions here