Weaving a Social Data Web with Semantic Pingback

Tramp, Sebastian; Frischmuth, Philipp; Ermilov, Timofey; Auer, Sören

doi:10.1007/978-3-642-16438-5_10

Cited by 20 publications

(13 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors of [5] mimic the social media pingback mechanism and suggest that whenever a reference to a remote resource is made from a local triplestore, the corresponding remote triplestore should be notified and update its underlying repository with accordingly produced triples. Such an approach faces trust issues, since remote triplestores should be granted write access to the triplestore they reference.…”

Section: Lod Backlinksmentioning

confidence: 99%

“…Quite recently, a number of approaches emerged trying to increase the degree of interlinking between LOD repositories through the identification and management of the backlinks of their URIs ( [1], [5], UK PSI backlinking service 6 , Dipper 7 ). In the LOD context, backlinks are defined as the references that are made from triples of remote triplestores to the locally defined URIs of a given triplestore.…”

Section: Lod Backlinksmentioning

confidence: 99%

“…The social media community also realized that backlinks could significantly improve the connectivity of its underlying information resources. Thus, various social media vendors utilized pingback or traceback mechanisms that enable authors of a weblog entry or article to obtain immediate feedback, when other people reference their work [5].…”

Section: Lod Backlinksmentioning

confidence: 99%

See 2 more Smart Citations

A decentralized infrastructure for the efficient management of resources in the web of data

Stefanidakis

Papadakis

2012

Proceedings of the 4th International Workshop on Semantic Web Information Management

View full text Add to dashboard Cite

A key requirement in linking open data refers to the rendering of such data easy to explore and consume. Such a requirement is critical for the overall quality of linked data in terms of consistency and interlinking. Although the provision of dereferenceable URIs is a step towards the right direction, current status of the semantic web indicates that such a feature alone is not enough. After all, as Berners Lee stressed, a URI is just an identifier for a resource not a recipe for its retrieval.In this paper, a decentralized infrastructure is presented capable of efficiently managing the URIs that are being consumed within the web of data. The proposed work is based on the registry, a place where triplestores may store information about their local URI entities. Such information evolves around backlinks that are defined as the references that are made from triples of remote triplestores to the locally defined URIs of a given triplestore. The registries communicate with each other through a lightweight protocol that facilitates the management and retrieval of URI entities across the LOD cloud.

show abstract

Section: Lod Backlinksmentioning

confidence: 99%

Section: Lod Backlinksmentioning

confidence: 99%

Section: Lod Backlinksmentioning

confidence: 99%

See 1 more Smart Citation

A decentralized infrastructure for the efficient management of resources in the web of data

Stefanidakis

Papadakis

2012

Proceedings of the 4th International Workshop on Semantic Web Information Management

View full text Add to dashboard Cite

show abstract

“…Most related work on dataset change detection and propagation focuses on distributed publish/subscribe systems [7,3], resource link maintenance [8,10], target synchronization [5], partial replicas [9], data-shipping [11], lazy updates [2], and real-time update notification [10,6]. In [7], the authors propose a peer-to-peer publish/subscribe system for events described in RDF.…”

Section: Related Workmentioning

confidence: 99%

Interest-Based RDF Update Propagation

Endris

Faisal

Orlandi

et al. 2015

The Semantic Web - ISWC 2015

Self Cite

View full text Add to dashboard Cite

Many LOD datasets, such as DBpedia and LinkedGeoData, are voluminous and process large amounts of requests from diverse applications. Many data products and services rely on full or partial local LOD replications to ensure faster querying and processing. While such replicas enhance the flexibility of information sharing and integration infrastructures, they also introduce data duplication with all the associated undesirable consequences. Given the evolving nature of the original and authoritative datasets, to ensure consistent and up-to-date replicas frequent replacements are required at a great cost. In this paper, we introduce an approach for interest-based RDF update propagation, which propagates only interesting parts of updates from the source to the target dataset. Effectively, this enables remote applications to 'subscribe' to relevant datasets and consistently reflect the necessary changes locally without the need to frequently replace the entire dataset (or a relevant subset). Our approach is based on a formal definition for graphpattern-based interest expressions that is used to filter interesting parts of updates from the source. We implement the approach in the iRap framework and perform a comprehensive evaluation based on DBpedia Live updates, to confirm the validity and value of our approach.

show abstract

“…One possibility is that various algorithms make use of shared vocabularies for publishing results of mapping, merging, repair or enrichment steps. After one service published its new findings in one of these commonly understood vocabularies, notification mechanisms (such as Semantic Pingback [11]) can notify relevant other services (which subscribed to updates for this particular data domain), or the original data publisher, that new improvement suggestions are available. Given proper management of provenance information, improvement suggestions can later (after acceptance by the publisher) become part of the original dataset.…”

Section: The Linked Data Life-cyclementioning

confidence: 99%

Introduction to LOD2

Auer

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. In this introductory chapter we give a brief overview on the Linked Data concept, the Linked Data lifecycle as well as the LOD2 Stack -an integrated distribution of aligned tools which support the whole life cycle of Linked Data from extraction, authoring/creation via enrichment, interlinking, fusing to maintenance. The stack is designed to be versatile; for all functionality we define clear interfaces, which enable the plugging in of alternative third-party implementations. The architecture of the LOD2 Stack is based on three pillars: (1) Software integration and deployment using the Debian packaging system. (2) Use of a central SPARQL endpoint and standardized vocabularies for knowledge base access and integration between the different tools of the LOD2 Stack. (3) Integration of the LOD2 Stack user interfaces based on REST enabled Web Applications. These three pillars comprise the methodological and technological framework for integrating the very heterogeneous LOD2 Stack components into a consistent framework.The Semantic Web activity has gained momentum with the widespread publishing of structured data as RDF. The Linked Data paradigm has therefore evolved from a practical research idea into a very promising candidate for addressing one of the biggest challenges in the area of intelligent information management: the exploitation of the Web as a platform for data and information integration as well as for search and querying. Just as we publish unstructured textual information on the Web as HTML pages and search such information by using keyword-based search engines, we are already able to easily publish structured information, reliably interlink this information with other data published on the Web and search the resulting data space by using more expressive querying beyond simple keyword searches. The Linked Data paradigm has evolved as a powerful enabler for the transition of the current document-oriented Web into a Web of interlinked Data and, ultimately, into the Semantic Web. The term Linked Data here refers to a set of best practices for publishing and connecting structured data on the Web. These best practices have been adopted by an increasing number of data providers over the past three years, leading to the creation of a global data space that contains many billions of assertions -the Web of Linked Data (cf. Fig. 1).In that context LOD2 targets a number of research challenges: improve coherence and quality of data published on the Web, close the performance gap between relational and RDF data management, establish trust on the Linked Data Web and generally lower the entrance barrier for data publishers and users. The LOD2 project tackles these challenges by developing:• enterprise-ready tools and methodologies for exposing and managing very large amounts of structured information on the Data Web.• a testbed and bootstrap network of high-quality multi-domain, multi-lingual ontologies from sources such as Wikipedia and OpenStreetMap.• algorithms based on machine learning for automatically i...

show abstract

Weaving a Social Data Web with Semantic Pingback

Cited by 20 publications

References 5 publications

A decentralized infrastructure for the efficient management of resources in the web of data

A decentralized infrastructure for the efficient management of resources in the web of data

Interest-Based RDF Update Propagation

Introduction to LOD2

Contact Info

Product

Resources

About