Filters








936 Hits in 4.9 sec

Towards a Top-K SPARQL Query Benchmark Generator

Shima Zahmatkesh
2014 International Semantic Web Conference  
In this paper we propose Top-k DBPSB: an extension of the DBpedia SPARQL benchmark (DBPSB), a benchmark known to resemble reality, with the capabilities required to compare SPARQL engines on top-k queries  ...  The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches.  ...  l, returns the generated top-k SPARQL query (line 20).  ... 
dblp:conf/semweb/Zahmatkesh14 fatcat:fu3hyeytlbg3hn2ofnwl7xrshu

Towards a Top-K SPARQL Query Benchmark

Shima Zahmatkesh, Emanuele Della Valle, Daniele Dell'Aglio, Alessandro Bozzon
2014 International Semantic Web Conference  
In this paper we propose Top-k DBPSB: an extension of the DBpedia SPARQL benchmark (DBPSB), a benchmark known to resemble reality, with the capabilities required to compare SPARQL engines on top-k queries  ...  The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches.  ...  Fig. 1 : 1 Fig. 1: Top-k DBPSB generates top-k SPARQL queries starting from the Auxiliary queries and datasets of DBPSB (a SPARQL benchmark known to resemble reality).  ... 
dblp:conf/semweb/ZahmatkeshVDB14 fatcat:xr64jd25dbc7xbaaw24hyaspyy

Federated Query Processing: Challenges and Opportunities

Axel-Cyrille Ngonga Ngomo, Muhammad Saleem
2016 Extended Semantic Web Conference  
Addressing such information needs commonly requires using federated queries, which are executed over several knowledge bases to compute a result set.  ...  We then derive potential cornerstones for future research in federated query processing.  ...  The generic architecture of a federated SPARQL query engine is as shown in Figure 1 .  ... 
dblp:conf/esws/NgomoS16 fatcat:w5n7uci5xffm5ldaj3lk65cqge

FedSearch: Efficiently Combining Structured Queries and Full-Text Search in a SPARQL Federation [chapter]

Andriy Nikolov, Andreas Schwarte, Christian Hütter
2013 Lecture Notes in Computer Science  
By performing on-the-fly adaptation of the query execution plan and intelligent grouping of query clauses, we are able to reduce significantly the communication costs making our approach suitable for top-k  ...  To address these challenges, we present FedSearch -a novel hybrid query engine based on the SPARQL federation framework FedX.  ...  A complementary approach proposed in [6] focuses on top-k query answering using link traversal for data access.  ... 
doi:10.1007/978-3-642-41335-3_27 fatcat:tt7gztkmsjg5zbypo2rbgf45ta

Efficient Execution of Top-K SPARQL Queries [chapter]

Sara Magliacane, Alessandro Bozzon, Emanuele Della Valle
2012 Lecture Notes in Computer Science  
of top-k SPARQL queries.  ...  Top-k queries, i.e. queries returning the top k results ordered by a user-defined scoring function, are an important category of queries.  ...  A detailed study on SPARQL top-k query planning is left to future work. Query Benchmark Evaluation As far as we know, currently there is no benchmark for top-k queries SPARQL.  ... 
doi:10.1007/978-3-642-35176-1_22 fatcat:wtfyzolrvbhopnrvhm3dxfio3i

The EvoGen Benchmark Suite for Evolving RDF Data

Marios Meimaris, George Papastefanatos
2016 Extended Semantic Web Conference  
Artificial and synthetic data are widely used for benchmarking and evaluating database, storage and query engines. This is usually performed in static contexts with no evolution in the data.  ...  To this end, we present EvoGen, a generator for evolving RDF data, that offers functionality for instance and schema-based evolution, fine-grained change representation between versions as well as custom  ...  Nevertheless, the Berlin SPARQL Benchmark does define an update-driven use case, which works on top of the Explore use case.  ... 
dblp:conf/esws/MeimarisP16 fatcat:ln3t25d2sncgbaaqkbyzcto4se

FedBench: A Benchmark Suite for Federated Semantic Data Query Processing [chapter]

Michael Schmidt, Olaf Görlitz, Peter Haase, Günter Ladwig, Andreas Schwarte, Thanh Tran
2011 Lecture Notes in Computer Science  
In this paper we present FedBench, a comprehensive benchmark suite for testing and analyzing the performance of federated query processing strategies on semantic data.  ...  Accounting for this heterogeneity, we present a highly flexible benchmark suite, which can be customized to accommodate a variety of use cases and compare competing approaches.  ...  The SPARQL-specific, use-case driven Berlin SPARQL Benchmark [6] comes with a set of queries implementing meaningful requests on top of an eCommerce scenario modeled in RDF.  ... 
doi:10.1007/978-3-642-25073-6_37 fatcat:pluwu6kctbfbrgmpabfb7fjbki

How Representative Is a SPARQL Benchmark? An Analysis of RDF Triplestore Benchmarks?

Muhammad Saleem, GÃbor SzÃrnyas, Felix Conrads, Syed Ahmad Chan Bukhari, Qaiser Mehmood, Axel-Cyrille Ngonga Ngomo
2019 The World Wide Web Conference on - WWW '19  
Furthermore, we measure the correlation between the query execution time and various SPARQL query features and rank those features based on their significance levels.  ...  We address the problem of determining an appropriate benchmark for a given real-life workload by providing a fine-grained comparative analysis of existing triplestore benchmarks.  ...  The overall diversity score DS of the queries is the average coefficient of variation of all the query features k analyzed in the queries of benchmark B: DS = 1 k k i=1 σ i (B) µ i (B) Performance Metrics  ... 
doi:10.1145/3308558.3313556 dblp:conf/www/0001SCBMN19 fatcat:i6b2kx6xvndujgia5yoyhxmgai

Heaven: A Framework for Systematic Comparative Research Approach for RSP Engines [chapter]

Riccardo Tommasini, Emanuele Della Valle, Marco Balduini, Daniele Dell'Aglio
2016 Lecture Notes in Computer Science  
Benchmarks like LSBench, SRBench, CSRBench and, more recently, CityBench satisfy the growing need of shared datasets, ontologies and queries to evaluate window-based RDF Stream Processing (RSP) engines  ...  In this paper, we claim that the RSP community needs to adopt a Systematic Comparative Research Approach (SCRA) if it wants to move a step forward.  ...  Related works in RSP engines benchmarking The state-of-the-art for RSP engine benchmarking currently comprises four benchmarks [1, 11, 17, 28] , summarized in Table 4 and a first attempt towards a general  ... 
doi:10.1007/978-3-319-34129-3_16 fatcat:vibfer4ekfgmjfbiof273d54pq

RDF Stream Processing: Let's React

Jean-Paul Calbimonte
2014 International Semantic Web Conference  
Some top-k query answering techniques for Linked Data appeared. Several works are considering SPARQL query answering on RDF annotated with partially ordered labels.  ...  The description logic community is investigating top-k ontological query answering. This year, OrdRing registered the highest number of attendees of its series.  ...  Henning Towards a Top-K SPARQL Query Benchmark Generator . . . . . . . . . . . . . . . 35 Shima Zahmatkesh, Emanuele Della Valle, Daniele Dell'Aglio and Alessandro Bozzon Towards an Efficient Semantically  ... 
dblp:conf/semweb/Calbimonte14 fatcat:f7cjlbnbl5ahlf6fus6llny6r4

Ontology-Based Top-k Query Answering over Massive, Heterogeneous, and Dynamic Data

Daniele Dell'Aglio
2013 International Semantic Web Conference  
In my research activity I will study the problem of computing the top k relevant items given a collection of data sets with both streaming and static data, an ontology describing them, and a set of top-k  ...  queries where each scoring function describes the relevance as a combination of several criteria.  ...  General model of a continuous SPARQL query The query answering process can be represented in three logical steps.  ... 
dblp:conf/semweb/DellAglio13 fatcat:7oxyb3p45zcqpn62zkro2edjue

Benchmarking Knowledge Graphs on the Web [article]

Michael Röder and Mohamed Ahmed Sherif and Muhammad Saleem and Felix Conrads and Axel-Cyrille Ngonga Ngomo
2020 arXiv   pre-print
History in computer science has shown that a main driver to scientific advances, and in fact a core element of the scientific method as a whole, is the provision of benchmarks to make progress measurable  ...  This paper gives an overview of benchmarks used to evaluate systems that process Knowledge Graphs.  ...  ., 2015b ) is a cluster-based SPARQL benchmark generator, which is able to synthesize customizable benchmarks from the query logs of SPARQL endpoints.  ... 
arXiv:2002.06039v1 fatcat:tc25o6rplbekndjng4cqh2oxoe

Sequential linked data: The state of affairs

Enrico Daga, Albert Meroño-Peñuela, Enrico Motta, Axel-Cyrille Ngonga Ngomo, Muhammad Saleem, Ruben Verborgh
2021 Semantic Web Journal  
our benchmark and proposing a set of read-write Semantic Web list operations in SPARQL, with insert, update and delete support.  ...  Covering this knowledge gap would be a significant step towards the realization of a Semantic Web list Application Programming Interface (API) that standardizes list manipulation and generalizes beyond  ...  The Berlin SPARQL Benchmark (BSBM) [4] generates benchmark data around exploring products and analyzing consumer reviews.  ... 
doi:10.3233/sw-210436 fatcat:k5kqfalg5nbh3ahg6xj6cubwte

Question Answering Benchmarks for Wikidata

Dennis Diefenbach, Thomas Pellissier Tanon, Kamal Deep Singh, Pierre Maret
2017 International Semantic Web Conference  
We present two new datasets in order to train and benchmark QA systems over Wikidata.  ...  The first is a translation of the popular SimpleQuestions dataset to Wikidata, the second is a dataset created by collecting user feedbacks.  ...  If not they can check the top-k SPARQL queries generated by the QA system, as shown in Figure 2 and (if available) select the right one. The collected data contains 689 questions.  ... 
dblp:conf/semweb/DiefenbachTSM17 fatcat:a67uua6pwnf6zoqi6n6gkv4txa

Extending SPARQL Algebra to Support Efficient Evaluation of Top-K SPARQL Queries [chapter]

Alessandro Bozzon, Emanuele Della Valle, Sara Magliacane
2012 Lecture Notes in Computer Science  
A crucial category of queries that is prone to optimization is "top-k" queries, i.e. queries returning the top k results ordered by a specified ranking function.  ...  Top-k queries can be expressed in SPARQL by appending to a SELECT query the ORDER BY and LIMIT clauses, which impose a sorting order on the result set, and limit the number of results.  ...  Toward Rank-aware Optimization of Top-K queries Optimization is a query processing activity devoted to the definition of an efficient execution plan for a given query.  ... 
doi:10.1007/978-3-642-34213-4_10 fatcat:l4v2yejsvnavfmljimpb2ovsja
« Previous Showing results 1 — 15 out of 936 results