FEASIBLE: A Featured-Based SPARQL Benchmarks Generation Framework.

  • screenshot

A Featured-Based SPARQL Benchmarks Generation Framework.

Source Code Demo Issues

Logo QUETSAL

FEASIBLE, an automatic approach for the generation of benchmarks out of the query history of applications, i.e., query logs. The generation is achieved by selecting prototypical queries of a user-defined size from the input set of queries. We evaluate our approach on two query logs and show that the benchmarks it generates are accurate approximations of the input query logs. Moreover, we compare four different triple stores with benchmarks generated using our approach and show that they behave differently based on the data they contain and the types of queries posed. Our results suggest that FEASIBLE generates better sample queries than the state of the art. In addition, the better query selection and the larger set of query types used lead to triple store rankings which partly differ from the rankings generated by previous works.

Online demo is available at http://feasible.aksw.org/

Project Team

Publications

by (Editors: ) [BibTex of ]

News

ESWC 2017 accepted two Demo Papers by AKSW members ( 2017-04-19T10:19:43+02:00 Christopher Schulz)

2017-04-19T10:19:43+02:00 Christopher Schulz

Hello Community! The 14th ESWC, which takes place from May 28th to June 1st 2017 in Portoroz, Slovenia, accepted two demos to be presented at the conference. Read more about them in the following:                                                                         1. Read more about "ESWC 2017 accepted two Demo Papers by AKSW members"

AKSW Colloquium, 10.04.2017, GeoSPARQL on geospatial databases ( 2017-04-07T10:43:55+02:00 by Dr. Matthias Wauer)

2017-04-07T10:43:55+02:00 by Dr. Matthias Wauer

At the AKSW Colloquium, on Monday 10th of April 2017, 3 PM, Matthias Wauer will discuss a paper titled “Ontop of Geospatial Databases“. Read more about "AKSW Colloquium, 10.04.2017, GeoSPARQL on geospatial databases"

AKSW Colloquium, 03.04.2017, RDF Rule Mining ( 2017-03-31T13:39:28+02:00 TommasoSoru)

2017-03-31T13:39:28+02:00 TommasoSoru

At the AKSW Colloquium, on Monday 3rd of April 2017, 3 PM, Tommaso Soru will present the state of his ongoing research titled “Efficient Rule Mining on RDF Data”, where he will introduce Horn Concerto, a novel scalable SPARQL-based approach … Continue reading → Read more about "AKSW Colloquium, 03.04.2017, RDF Rule Mining"

AKSW Colloquium, 27.03.2017, PPO & PPM 2.0: Extending the privacy preference framework to provide finer-grained access control for the Web of Data ( 2017-03-27T10:13:08+02:00 by Marvin Frommhold)

2017-03-27T10:13:08+02:00 by Marvin Frommhold

In the upcoming Colloquium, March the 27th at 3 PM Marvin Frommhold will discuss the paper “PPO & PPM 2.0: Extending the Privacy Preference Framework to provide finer-grained access control for the Web of Data” by Owen Sacco and John G. Read more about "AKSW Colloquium, 27.03.2017, PPO & PPM 2.0: Extending the privacy preference framework to provide finer-grained access control for the Web of Data"

DBpedia @ Google Summer of Code – GSoC 2017 ( 2017-03-13T11:12:50+01:00 Christopher Schulz)

2017-03-13T11:12:50+01:00 Christopher Schulz

DBpedia, one of InfAI’s community projects, will be part of the 5th Google Summer of Code program. The GsoC has the goal to bring students from all over the globe into open source software development. Read more about "DBpedia @ Google Summer of Code – GSoC 2017"