Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent erik-mannens.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent rik-van-de-walle.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent martin-ebner.
- item-5 previous item-4.
- paper-21 type InProceedings.
- paper-21 label "A Restful Interface for RDF Stream Processors".
- paper-21 sameAs paper-21.
- paper-21 abstract "This poster proposes a minimal, backward compatible and combinable restful interface for RDF Stream Engine.".
- paper-21 hasAuthorList authorList.
- paper-21 isPartOf poster-demo-proceedings.
- paper-21 title "A Restful Interface for RDF Stream Processors".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent marco-balduini.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent emanuele-della-valle.
- item-2 previous item-1.
- paper-22 type InProceedings.
- paper-22 label "TripleRush".
- paper-22 sameAs paper-22.
- paper-22 abstract "TripleRush is a parallel in-memory triple store designed to address the need for efficient graph stores that answer queries over large-scale graph data fast. To that end it leverages a novel, graph-based architecture. Specifically, TripleRush is built on our parallel and distributed graph processing framework Signal/Collect. The index structure is represented as a graph where each index vertex corresponds to a triple pattern. Partially matched queries are routed in parallel along different paths of this index structure. We show experimentally that TripleRush takes about a third of the time to answer queries compared to the fastest of three state-of-the-art triple stores, when measuring time as the geometric mean of all queries for two common benchmarks.".
- paper-22 hasAuthorList authorList.
- paper-22 isPartOf poster-demo-proceedings.
- paper-22 title "TripleRush".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent philip-stutz.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent mihaela-verman.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent lorenz-fischer.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent abraham-bernstein.
- item-4 previous item-3.
- paper-23 type InProceedings.
- paper-23 label "DRETa: Extracting RDF from Wikitables".
- paper-23 sameAs paper-23.
- paper-23 abstract "Tables are widely used in Wikipedia articles to display relational information – they are inherently concise and information rich. However, aside from info-boxes, there are no automatic methods to exploit the integrated content of these tables. We thus present DRETa: a tool that uses DBpedia as a reference knowledge-base to extract RDF triples from generic Wikipedia tables.".
- paper-23 hasAuthorList authorList.
- paper-23 isPartOf poster-demo-proceedings.
- paper-23 title "DRETa: Extracting RDF from Wikitables".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent emir-munoz.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent aidan-hogan.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent alessandra-mileo.
- item-3 previous item-2.
- paper-24 type InProceedings.
- paper-24 label "Adding Time to Linked Data: A Generic Memento proxy through PROV".
- paper-24 sameAs paper-24.
- paper-24 abstract "Linked Data resources change rapidly over time, making a valid consistent state difficult. As a solution, the Memento framework offers content negotiation in the datetime dimension. However, due to a lack of formally described versioning, every server needs a costly custom implementation. In this poster paper, we exploit published provenance of Linked Data resources to implement a generic Memento servics. Based on the w3c prov standard, we propose a loosely coupled architecture that offers a Memento interface to any Linked Data service publishing provenance.".
- paper-24 hasAuthorList authorList.
- paper-24 isPartOf poster-demo-proceedings.
- paper-24 title "Adding Time to Linked Data: A Generic Memento proxy through PROV".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent miel-vander-sande.
- item-1 next item-2.
- item-2 type ListItem.