Transcript KIT PPT Master

http://code.google.com/p/ldspider
Crawler c = new Crawler(1); // no of threads: 1
Frontier frontier = new BasicFrontier();
frontier.add(new URI(http://dbpedia.org/resource/Karlsruhe“);
NodeCollector nc = new NodeCollector();
c.setOutputCallback(nc); // collect all Nodes in result
// breadth-first, hop-1
c.evaluateBreadthFirst(frontier, 1, -1);
System.out.println(nc.getContent());
1
15.03.2010
Andreas Harth
Data Summaries for On-Demand Queries over Linked Data
KIT – University of the State of Baden-Wuerttemberg and
National Laboratory of the Helmholtz Association
Linked Data Access with ldspider
API to access Linked Data
Lightweight implementation in Java
GPL at Google Code (http://code.google.com/p/ldspider)
Different crawling strategies (breadth-first, load-balancing)
Multithreading
Including RDF/XML parser
Adheres to robots.txt protocol
Flexible configuration/application with callbacks and hooks
2
15.03.2010
Andreas Harth
Data Summaries for On-Demand Queries over Linked Data
KIT – University of the State of Baden-Wuerttemberg and
National Laboratory of the Helmholtz Association