Introduction of Linked Data – From Cataloging to Catalinking Susan Howell, Cataloging and Metadata Librarian Jian Anna Xiong, Government Information Librarian 4/23/2019, CALA Midwest Chapter Virtual Annual Conference

Outline What is linked data? Four principles of linked data Is your linked open data 5 star? Best universal practices Why linked data for libraries? Future trends Challenges How to prepare for future? Linked data at Morris Library Further reading References

https://www.data.gv.at/linked-data/

What is linked data? https://www.supplychain247.com/article/3_challenges_for_the_web_according_to_tim_berners_lee

Boyd, A & Ballegooie M. v. , 2013. Slide 9

Four Principles of Linked Data Use URIs as names for things Use HTTP URIs so that people can look up those names. When someone looks up a URI, provide useful information, using the standards (RDF, SPARQL) Include links to other URIs. so that they can discover more things.

Is your Linked Open Data 5 Star? Available on the Web to be Open Data Available as machine-readable structured data Non-proprietary format Use open standards from World Wide Web Consortium (W3C) Link your data to other people’s data

Best Universal Practices Prepare stakeholders Select a dataset Model the data Specify an appropriate license Good URIs for linked data Use standard vocabularies Convert data Provide machine access to data Announce new data sets Recognize the social contract

Why Linked Data for Libraries? Why do we need linked data for libraries? In Boyd and Ballegooie’s presentation, they found that only 16% people start their research with library catalogues, the largest percentage of people start their information search with Google and other search engine. Although libraries have a huge store of valuable, reliable data, the library catalogues are self contained data silos with no connection to the data on the Web. MARC is not popular outside the library community. On the contrary, linked data can provide a framework for sharing semantically rich data in a Web-friendly way. It will allow libraries to be part of the Web of Data. Boyd, A & Ballegooie M. v. , 2013. Slide 5

Why Library Linked Data is important to the Future of Bibliographic Control To combine the best of libraries and the best of the Web, Library metadata must be on the Web Data must be open, usable by others (Boyd, A & Ballegooie M. v. , 2013. Slide 6)

https://commonplace.net/linked-data-for-libraries/ Idea Illustration https://commonplace.net/linked-data-for-libraries/

Future Trends: From Cataloging to Catalinking https://www.ontotext.com/linked-data-libraries/

Future Trends (Continues) https://www.slideshare.net/rjw/three-linked-data-choices-for-libraries

https://www. slideshare

Future Trends (Continues) https://www.ontotext.com/linked-data-libraries/

Challenges Finding a method to convert MARC-based data into linked data Designing Integrated Library Systems (ILS) that can make use of linked data Developing URIs for data elements

How to prepare for future Start practicing with small collections Get involved with developing ontologies and vocabularies Get involved with linked data projects in data communities outside of libraries Advocate for linked data with vendors

Linked Data at SIUC Morris Library https://siu.edu/libraries/

Wood River Township, Madison County, Illinois

susan

Recommendations for further reading Coyle, K. (2012). Linked Data Tools: Connecting on the Web. Retrieved from https://www.alastore.ala.org/content/linked-data-tools- connecting-web Weber, M. B. (2015). Rethinking library technical services: Redefining our profession for the future. Lanham, Maryland: Rowman & Littlefield. Hooland, S. v., & Verborgh, R. (2015) Linked Data for Libraries, Archives and Museums. How to clean, link and publish your metadata. London : Facet Publishing. Godby, C. J., Wang, S., & Mixter, J. (2015). Library linked data in the Cloud: OCLC’s experiments with new models of resource description. San Rafael, California : Morgan & Claypool.

References Archer, P., Goedertier, S., & Loutas, N. (2012) Deliverable: D7 Study on persistent URIs with identification of best practices and recommendations on the topic for the MSx and the EC. European Union: Interoperability Solutions for European Public Administrations. Baker, T., Bermes, E., et al. (2011) Library Liked Data Incubator Group Final Report. Retrieved from https://www.w3.org/2005/Incubator/lld/XGR-lld-20111025/ Berners-Lee, T. (2009) Linked Data. in Design Issues. Retrieved from www.w3.org/DesignIssues/LinkedData.html Bowen, J. (2010) “Moving Library Metadata Toward Linked Data: Opportunities Provided by the eXtensible Catalog.” International Conference on Dublin Core and Metadata Applications. DC-2010-Pittsburge Proceedings. Retrieved from http://dcpapers.dublincore.org/pubs/article/view/1010 Boyd, A & Ballegooie M. v. (2013, February 1). Library linked data and the future of bibliographic control. Retrieved from https://www.slideshare.net/ITSToronto/linked-data-olita-2013 Byrne, G. & Goddard, L. (2010) “The Strongest Link: Libraries and Linked Data.” D-Lib Magazine 16 (11/12). Retrieved from http://www.dlib.org/dlib/november10/byrne/11byrne.html Divison of Highways. Illinois Department of Transportation. (1958) Wood River Township, Madison County, Illinois. Carbondale, IL: Southern Illinois University Carbondale. Retrieved from http://collections.carli.illinois.edu/cdm/landingpage/collection/sic_maps Howarth, L.C. (2012) FRBR and Linked Data: Connecting FRBR and Linked Data. Cataloging & Classification Quarterly, 50:5-7, 763-776. Linked data. (n.d.). Retrieved from http://linkeddata.org/ Schilling, V. (2012) "Transforming Library Metadata into Linked Library Data", American Library Association. Retrieved from http://www.ala.org/alcts/resources/org/cat/research/linked-data TED. (2009, March 13). Berners-Lee, T: The next web of open, linked data [Video file]. Retrieved from https://www.youtube.com/watch?v=OM6XIICm_qo W3C Working Group. (2013) Best Practices for Publishing Linked Data. Retrieved from https://dvcs.w3.org/hg/gld/raw-file/default/bp/index.html

The End! Thank You!