Scalable Integration and Processing of Linked Data @ WWW’11
The LarKC team is proud to announce that its tutorial “Scalable Integration and Processing of Linked Data” was accepted at this year’s International World Wide Web Conference 2011 (WWW’11) that will take place from March 28th to April 1st, 2011 in Hyderabad, India.
Abstract of the Tutorial
The goal of this tutorial is to introduce, motivate and de- tail techniques for integrating heterogeneous structured data from across the Web. Inspired by the growth in Linked Data publishing, our tutorial aims at educating Web researchers and practitioners about this new publishing paradigm. The tutorial will show how Linked Data enables uniform access, parsing and interpretation of data, and how this novel wealth of structured data can potentially be exploited for creating new applications or enhancing existing ones.
As such, the tutorial will focus on Linked Data publishing and related Semantic Web technologies, introducing scalable techniques for crawling, indexing and automatically in- tegrating structured heterogeneous Web data through reasoning.
Topics
The tutorial will cover following topics:
- Introduction to RDF and Linked Data
- Scalable Linked Data Crawling
- Scalable RDF Indexing Techniques
- Reasoning: Motivation and Overview
- Scalable Distributed Reasoning over Map-Reduce
- Hands-on: Implementing a LarKC Work- flow
Website: http://sild.cs.vu.nl/