SPARQL Web-Querying Infrastructure: Ready for Action?

@inproceedings{Aranda2013SPARQLWI,
  title={SPARQL Web-Querying Infrastructure: Ready for Action?},
  author={Carlos Buil Aranda and A. Hogan and J{\"u}rgen Umbrich and P. Vandenbussche},
  booktitle={SEMWEB},
  year={2013}
}
Hundreds of public SPARQL endpoints have been deployed on the Web, forming a novel decentralised infrastructure for querying billions of structured facts from a variety of sources on a plethora of topics. But is this infrastructure mature enough to support applications? For 427 public SPARQL endpoints registered on the DataHub, we conduct various experiments to test their maturity. Regarding discoverability, we find that only one-third of endpoints make descriptive meta-data available, making… Expand
Processing Aggregate Queries in a Federation of SPARQL Endpoints
TLDR
This work proposes a set of query processing strategies and the associated Cost-based Optimizer for Distributed Aggregate queries (CoDA) for executing aggregate SParQL queries over federations of SPARQL endpoints and shows that CoDA significantly improves performance over current state-of-the-art systems. Expand
Querying Linked Data: An Experimental Evaluation of State-of-the-Art Interfaces
TLDR
This paper stress test the different interfaces and backends of existing RDF interfaces and identifies their strengths and weaknesses, and examines the influence of the backend on the performance of these interfaces. Expand
Enabling Web-Scale Knowledge Graphs Querying
TLDR
The aim of this research is to develop a new generation of smart clients and servers to balance the load between servers and clients, with the best possible query execution performance, and at the same time reducing data transfer volume, by combining SPARQL endpoints, TPF and shipping compressed KG partitions. Expand
Balloon Fusion: SPARQL rewriting based on unified co-reference information
TLDR
Balloon Fusion, a SParQL 1.1 rewriting and query federation service build on crawling and consolidating co-reference relationships in over 100 reachable Linked Data SPARQL Endpoints, shows the technical feasibility and critically reflects the current status of the Linked Open Data cloud. Expand
Scheduling for SPARQL Endpoints
TLDR
This paper studies, and evaluates through simulation, the applicability of a few algorithms to scheduling queries received at a SPARQL endpoint, and finds them to be effective and to significantly enhance the allocation of resources. Expand
Querying Datasets on the Web with High Availability
TLDR
The Linked Data Fragments concept is formalized, aaclient-side sparql query processing algorithm that uses a dynamic iterator pipeline, and servers' availability under load is verified, indicating that, at the cost of lower performance, query techniques with triple pattern fragments lead to high availability. Expand
Integration of Web APIs and Linked Data Using SPARQL Micro-Services - Application to Biodiversity Use Cases
TLDR
This paper argues that full SPARQL Query expressiveness can be supported efficiently without jeopardizing servers availability and demonstrates how this architecture can be used to dynamically assign dereferenceable URIs to Web API resources that do not have URIs beforehand, thus literally “bringing” Web APIs into the Web of Data. Expand
Efficient Query Processing for SPARQL Federations with Replicated Fragments
TLDR
FEDRA is proposed, a framework for querying Linked Data that takes advantage of client-side data replication, and performs a source selection algorithm that aims to reduce the number of selected public SPARQL endpoints, execution time, and intermediate results. Expand
A Hybrid Approach to Perform Efficient and Effective Query Execution Against Public SPARQL Endpoints
TLDR
This work proposes a novel hybrid architecture that relies on shipping policies to improve the performance of SPARQL endpoints, and exploits human and machine query processing computation to enhance the quality of Linked Data sets. Expand
Towards More Intelligent SPARQL Querying Interfaces
Over years, the Web of Data has grown significantly. Various interfaces such as SPARQL endpoints, data dumps, and Triple Pattern Fragments (TPF) have been proposed to provide access to this data.Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
DBpedia SPARQL Benchmark - Performance Assessment with Real Queries on Real Data
TLDR
It is argued that a pure SPARQL benchmark is more useful to compare existing triple stores and provide results for the popular triple store implementations Virtuoso, Sesame, Jena-TDB, and BigOWLIM. Expand
Federating queries in SPARQL 1.1: Syntax, semantics and evaluation
TLDR
How a query evaluation system can be implemented for that federation extension of SPARQL 1.1 and some static optimization techniques and reusing a query engine used for data-intensive science are described, so as to deal with large amounts of intermediate and final results. Expand
SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions
In order to leverage the full potential of the Semantic Web it is necessary to transparently query distributed RDF data sources in the same way as it has been possible with federated databases forExpand
An Empirical Study of Real-World SPARQL Queries
TLDR
This paper analyzes 3 million real-world SPARQL queries extracted from logs of the DBPedia and SWDF public endpoints to find which are the most used language elements both from syntactical and structural perspectives. Expand
ANAPSID: An Adaptive Query Processing Engine for SPARQL Endpoints
TLDR
ANAPSID is presented, an adaptive query engine for SPARQL endpoints that adapts query execution schedulers to data availability and run-time conditions and speeds up execution time in some cases, in more than one order of magnitude. Expand
A Semantic Web middleware for Virtual Data Integration on the Web
TLDR
The proposed system allows to retrieve data using SPARQL queries, data sources can register and abandon freely, and all RDF Schema or OWL vocabularies can be used to describe their data, as long as they are accessible on the Web. Expand
FedX: Optimization Techniques for Federated Query Processing on Linked Data
TLDR
FedX is presented, a practical framework that enables efficient SPARQL query processing on heterogeneous, virtually integrated Linked Data sources and achieves a significant improvement in query performance over state-of-the-art federated query engines. Expand
Querying Distributed RDF Data Sources with SPARQL
TLDR
DARQ provides transparent query access to multiple SPARQL services, i.e., it gives the user the impression to query one single RDF graph despite the real data being distributed on the web, and uses query rewriting and cost-based query optimization to speed up query execution. Expand
RKBExplorer.com: A Knowledge Driven Infrastructure for Linked Data Providers
TLDR
This paper provides a brief overview of the system including the underlying infrastructure, and a number of associated tools for both knowledge acquisition and publishing. Expand
Avalanche: Putting the Spirit of the Web back into Semantic Web Querying
TLDR
A novel technique called Avalanche, designed to allow a data surfer to query the Semantic Web transparently, is presented, which can perform "live" queries over the Web of Data. Expand
...
1
2
3
4
...