Curation Services
IU Indianapolis DataWorks is a fully curated open access data repository. IU Indianapolis researchers, students, and staff may deposit data to IU Indianapolis DataWorks subject to our collection policies. Data sets submitted to IU Indianapolis DataWorks are immediately reviewed by a data curator to ensure that data are in a format and structure that facilitates long-term access, discovery, and reuse. Repository services include curation, discovery and access, and preservation.
Curation
All data submitted undergo data-level curation procedures as described by the Data Curation Network project. Curation includes:
- Documentation: Work with authors to create additional data documentation, e.g., readme template
- Metadata creation: Apply standardized metadata to enhance discovery
- Quality control/Quality assurance: Open files, detect/request missing files and/or information (e.g., what do “blank” cells mean?)
- Creative Commons Licenses: Assist authors in choosing an appropriate license
- DataCite DOIs: Register metadata with unique persistent URLs that ensure long-term citability
- Chain of custody: Maintains the chain of custody for datasets via our repository technology system, DSpace, which is based on the OAIS standard for tracking the integrity and authenticity of all digital objects housed in the system
Discovery and access
IU Indianapolis DataWorks is a publicly available collection of digital research data generated by IU Indianapolis researchers, students, and staff. Anyone can search and download the data housed in the repository, instantly or by request. All data sets are fully indexed and search engine optimized for broad findability. During the deposit process, we will create rich dataset-level metadata and a DOI (via DataCite) to maximize discovery.
Preservation
IU Indianapolis DataWorks provides long-term preservation of digital data files using services such as migration (limited format types), secure backup, bit-level checksums, and disaster recovery mechanisms in place.
Note: Adapted from The Data Repository for U of M