SlideShare is now on Android. 15 million presentations at your fingertips.  Get the app

×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

Linked Data Universe - Large Scale Computing Tasks for the HPI FutureSOC-Lab

by Senior Researcher at Hasso Plattner Institute of IT Systems Engineering, University of Potsdam on Jun 16, 2010

  • 2,916 views

 

Statistics

Views

Total Views
2,916
Views on SlideShare
2,897
Embed Views
19

Actions

Likes
8
Downloads
58
Comments
2

3 Embeds 19

http://www.slideshare.net 10
http://linkeddata.uriburner.com 7
http://www.twylah.com 2

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

CC Attribution-NonCommercial-NoDerivs LicenseCC Attribution-NonCommercial-NoDerivs LicenseCC Attribution-NonCommercial-NoDerivs License

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel

12 of 2 previous next

  • kidehen Kingsley Idehen, CEO, Software Company at OpenLink Software Redo as formatting went wrong:

    Nice presentation!

    Little points to fix., if possible.

    35/71

    -- use generic HTTP URIs so that you can use a single URI for Referring-to Things and Looking up (Accessing) their Structured Representation

    -- use RDF to produce Structured Representations of these Things. 14/71

    -- Virtuoso Sponger (a bubble in the LOD Cloud) enables generation of an RDF based description for any HTTP accessible resource.

    The URIBurner instance at (http://uriburner.com and the LOD Cloud Cache at:

    http://lod.openlinksw.com are live examples of progressively populated Linked Data Spaces).

    -- PingTheSemanticWeb (PTSW) is another progressively populated Linked Data Space

    -- PTSW + Virtuoso Sponger add a dynamic dimension to the LOD triple count game which basically takes LOD (deep Web) way beyond 15 Billion Triples, In short, we’ve stopped counting :-)


    57/71 Note all of the following showcase Entity Ranking (Data Ranking) based of Link coefficients. You can even order SPARQL queries by Entity Rank.
    3 years ago
    Are you sure you want to
    Your message goes here
    Processing…
  • kidehen Kingsley Idehen, CEO, Software Company at OpenLink Software Nice presentation!
    Little points to fix., if possible.

    35/71
    -- use generic HTTP URIs so that you can use a single URI for Referring-to Things and Looking up (Accessing) their Structured Representation
    -- use RDF to produce Structured Representations of these Things.

    14/71

    -- Virtuoso Sponger (a bubble in the LOD Cloud) enables generation of an RDF based description for any HTTP accessible resource. The URIBurner instance at (http://uriburner.com and the LOD Cloud Cache at: http://lod.openlinksw.com are live examples of progressively populated Linked Data Spaces).

    -- PingTheSemanticWeb (PTSW) is another progressively populated Linked Data Space

    PTSW + Virtuoso Sponger add a dynamic dimension to the LOD triple count game which basically takes LOD (deep Web) way beyond 15 Billion Triples, In short, we've stopped counting :-)

    57/71
    Note all of the following showcase Entity Ranking (Data Ranking) based of Link coefficients;





    You can even order SPARQL queries by Entity Rank.
    3 years ago
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Linked Data Universe - Large Scale Computing Tasks for the HPI FutureSOC-Lab Linked Data Universe - Large Scale Computing Tasks for the HPI FutureSOC-Lab Presentation Transcript