Matches in ScholarlyData for { ?s ?p ?o. }
- 70 label "Data as a Service: The Semantic Web Redeployed".
- 70 sameAs 70.
- 70 abstract "Ad-hoc querying is crucial to access information from Linked Data, yet publishing queryable RDF datasets on the web is not a trivial exercise. The most compelling argument to support this claim is that the Web contains hundreds of thousands of data documents, while only 300 SPARQL endpoints are provided. Even worse, the SPARQL endpoints we do have are often unstable, may not comply with the standards, and may differ in supported features. In other words, hosting data online is easy, but publishing Linked Data via a queryable API such as SPARQL appears to be too difficult. As a consequence, in practice, there is no single uniform way to query the LOD cloud today. In this paper, we therefore combine a large-scale Linked Data publication project (LOD Laundromat) with a low-cost server-side interface (Triple Pattern Frag- ments), in order to bridge the gap between the web of downloadable data documents and the web of live queryable data. The result is a repeat- able, low-cost, open-source-based data publication process. To demon- strate its applicability, we made over 550.000 data documents available as data APIs, consisting of over 21 billion triples.".
- 70 hasAuthorList authorList.
- 70 isPartOf proceedings.
- 70 keyword "API".
- 70 keyword "Data Publishing".
- 70 keyword "Web Services".
- 70 title "Data as a Service: The Semantic Web Redeployed".
- 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 laurens-rietveld.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ruben-verborgh.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent wouter-beek.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent miel-vander-sande.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent stefan-schlobach.
- item-5 previous item-4.
- 72 creator alessandro-solimando.
- 72 creator carsten-binnig.
- 72 creator christoph-pinkel.
- 72 creator dominique-ritze.
- 72 creator ernesto-jimenez-ruiz.
- 72 creator martin-g-skjaeveland.
- 72 creator wolfgang-may.
- 72 type InProceedings.
- 72 label "RODI: A Benchmark for Relational-to-Ontology Data Integration".
- 72 sameAs 72.
- 72 abstract "A major challenge in information management today is the integration of huge amounts of data distributed across multiple data sources. One suggested approach to this problem is ontology-based data integration where legacy data systems are integrated via a common on- tology that represents a unified global view over all data sources. In many domains (e.g., biology, medicine) there exist established ontolo- gies to integrate data from existing data sources. However, data is often not natively born using these ontologies. Instead, much data resides in relational databases. Therefore, mappings that relate the legacy data sources to the ontology need to be constructed. Recent techniques and systems that automatically construct such mappings have been devel- oped. The quality metrics of these systems are, however, often only based on self-designed, highly biased benchmarks. This paper introduces a new publicly available benchmarking suite called RODI which is designed to cover a wide range of integration challenges in Relational-to-Ontology Data Integration scenarios. RODI provides a set of different relational data sources and ontologies as well as a scoring function with which the performance of relational-to-ontology mapping construction systems may be evaluated.".
- 72 hasAuthorList authorList.
- 72 isPartOf proceedings.
- 72 keyword "Benchmark".
- 72 keyword "Mapping Generation".
- 72 keyword "OBDA".
- 72 keyword "R2RML".
- 72 keyword "RDB2RDF".
- 72 title "RODI: A Benchmark for Relational-to-Ontology Data Integration".
- 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 hasItem item-6.
- authorList hasItem item-7.
- authorList hasLastItem item-7.
- item-1 type ListItem.
- item-1 hasContent christoph-pinkel.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent carsten-binnig.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ernesto-jimenez-ruiz.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent wolfgang-may.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent dominique-ritze.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent martin-g-skjaeveland.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent alessandro-solimando.
- item-7 previous item-6.
- 83 creator matthias-klusch.
- 83 creator patrick-kapahnke.
- 83 creator xiaoqi-cao.
- 83 type InProceedings.
- 83 label "SPSC: Efficient Composition of Semantic Services in Unstructured P2P Networks".
- 83 sameAs 83.
- 83 abstract "We present a novel approach, called SPSC, for the efficient composition of semantic services in unstructured peer-to-peer (P2P) networks. With SPSC, the peers are jointly planning complex IOPE-chained workflows of services in OWL-S together with their respective signature variable bindings in order to answer a given composition request. For this purpose, each peer exploits its local observation-based knowledge about the semantic overlay to contribute to the actual semantic service workflow, as well as to support the further exploration of alternatives in a heuristically pruned search space within the given TTL. In particular, the local query routing decisions are based on the application of two strategies for a guided composition plan branching and memorization of potentially helpful services. We show that the composition planning process with SPSC is sound and provide a lower bound of its completeness in terms of total recall of solutions for a given composition request, if they exist in the network. Our experimental evaluation revealed that SPSC can achieve a high cumulative recall with relatively low traffic overhead.".
- 83 hasAuthorList authorList.
- 83 isPartOf proceedings.
- 83 keyword "P2P computing".