LinkedData

From Code4Lib
Jump to: navigation, search

02/23 AM Tutorial, Attendees: 48

02/23 PM Workshop, Attendees 35

  • 12:30 - 14:00 -- Lunch
  • 14:00 - 14:30 -- Go FOAF Yourself (everyone create a simple FOAF file, and link it up to someone else)
  • 14:30 - 16:30 -- Breakout Sessions
  • 16:30 - 17:00 -- Regroup/Wrap-up/Think about potential breakout topics for folks who want to continue discussion throughout conf.

Aims and Overview

The aim of this tutorial is to provide participants with a detailed conceptual understanding of how to publish Linked Data on the Web, and a gentle introduction to the practical and technical steps that make up the publishing process. In addition the tutorial will cover best practices in topics such as minting URIs for published data sets, vocabulary selection, choosing what RDF data to expose, and interlinking distributed data sets. Specific patterns will be presented for publishing different forms of data set, such as data from static files, relational databases and existing Web APIs. Participants will also be shown how to debug published data.

The second focus of the tutorial will be applications that consume Linked Data from the Web. We will give an overview about existing Linked Data browsers, Web of Data search engines as well as Linked Data Mashups and cover the existing software frameworks that can be used to build applications on top of the Data Web.

Lastly the tutorial will be to provide a collaborative space to explore putting some of the ideas of linked data into practice. The idea is that people can split off into groups, or work independently on adding linked data support to an existing application, exploring modeling issues of what vocabularies to use for particular data sets, and brain storming about new vocabularies that may be needed in the library world.

The tutorial will combine presentations by the tutors with demonstrations, interactive sessions, and group discussion. Other than a broad technical understanding of the Web development and Web publishing process, and a basic conceptual understanding of the Semantic Web, there are no pre-requisites for participation in the tutorial, which will be of interest to the full spectrum of code4lib2009 attendees, including researchers, developers, data managers/publishers and those seeking to commercially exploit the Semantic Web by publishing Linked Data.

Program Outline

02/22 8PM pre-preconf drink/planning

Let's keep the drink/planning simple, as in, stick to the Hotel bar/restaurant rather than roving. This is assuming the hotel bar/restaurant provides a practical space for our drinking+planning activities. It is open to both organizers and attendees, since the hope is that this line will blur anyhow.


Possible Afternoon Breakout Session Topics

  • parsing rdf data
  • crawling rdf data
  • exploring/visualizing linked data
  • publishing linked data Best Practice Recipes for Publishing RDF Vocabularies (jphipps?)
  • publishing w/ semantic media-wiki (lbjay)
  • publishing w/ drupal (charper?, jdatema?)
  • rdfa
  • bibont
  • oai-ore
  • talis platform
  • ruleml/owl/rdfs limitations/possibilities
  • rdf data and the catalog/bibont
  • linking authority data (howto)
  • "When things break"
  • vocabulary discovery
  • sparql querying/endpoints

Possible Outcomes for Afternoon Session

  • Gain familiarity w/ processing RDF
  • Build a simple representation of the conf or preconf in Linked data.
  • Build crawlers to play with the data piles or LOD conf stuff
  • FOAF Book Raffle
  • Exhibit display

Workshop Leaders

  • Dan Chudnov
  • Ian Davis
  • Mike Giarlo
  • Corey Harper
  • Jay Luker
  • Jon Phipps
  • Ross Singer
  • Ed Summers

Discussion

Resources

For inclusion in handout materials

This list could conceivably include a few single-page figures, charts, graphs, Lolcats or other helpful imagery. I think realistically the handout should be no more than about 20-25 double-sided pages.


Resources/Examples from other domains


Bibliography

Anything that won't fit in the handout will be listed in a bibliography at the end.