Versioned Triple Pattern Fragments: A Low-cost Linked Data Interface Feature for Web Archives

نویسندگان

  • Ruben Taelman
  • Miel Vander Sande
  • Ruben Verborgh
  • Erik Mannens
چکیده

Linked Datasets typically evolve over time because triples can be removed from or added to datasets, which results in different dataset versions. While most attention is typically given to the latest dataset version, a lot of useful information is still present in previous versions and its historical evolution. In order to make this historical information queryable at Web scale, a low-cost interface is required that provides access to different dataset versions. In this paper, we add a versioning feature to the existing Triple Pattern Fragments interface for queries at, between and for versions, with an accompanying vocabulary for describing the results, metadata and hypermedia controls. This interface feature is an important step into the direction of making versioned datasets queryable on the Web, with a low publication cost and effort.

منابع مشابه

Triple Pattern Fragments: A low-cost knowledge graph interface for the Web

Billions of Linked Data triples exist in thousands of RDF knowledge graphs on the Web, but few of those graphs can be queried live from Web applications. Only a limited number of knowledge graphs are available in a queryable interface, and existing interfaces can be expensive to host at high availability. To mitigate this shortage of live queryable Linked Data, we designed a low-cost Triple Pat...

متن کامل

SWEEP: a Streaming Web Service to Deduce Basic Graph Patterns from Triple Pattern Fragments

The Triple Pattern Fragments (TPF) interface demonstrates how it is possible to publish Linked Data at low-cost while preserving data availability. But, data providers hosting TPF servers are not able to analyze the SPARQL queries they execute because they only receive and evaluate subqueries with one triple pattern. Understanding the executed SPARQL queries is important for data providers for ...

متن کامل

Low-Cost Queryable Linked Data through Triple Pattern Fragments

For publishers of Linked Open Data, providing queryable access to their dataset is costly. Those that offer a public sparql endpoint often have to sacrifice high availability; others merely provide non-queryable means of access such as data dumps. We have developed a client-side query execution approach for which servers only need to provide a lightweight triple-pattern-based interface, enablin...

متن کامل

dbpedia's Triple Pattern Fragments: Usage Patterns and Insights

Queryable Linked Data is published through several interfaces, including sparql endpoints and Linked Data documents. In October 2014, the dbpedia Association announced an official Triple Pattern Fragments interface to its popular dbpedia dataset. This interface proposes to improve the availability of live queryable data by dividing query execution between clients and servers. In this paper, we ...

متن کامل

Substring Filtering for Low-Cost Linked Data Interfaces

Recently, Triple Pattern Fragments (tpfs) were introduced as a low-cost server-side interface when high numbers of clients need to evaluate sparql queries. Scalability is achieved by moving part of the query execution to the client, at the cost of elevated query times. Since the tpf interface purposely does not support complex constructs such as sparql filters, queries that use them need to be ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017