Filters








32 Hits in 1.6 sec

A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores

Ali Davoudian, Liu Chen, Hongwei Tu, Mengchi Liu
2021 Data Science and Engineering  
In order to assess the impact of WASP on a graph store and to show how easily the approach can be plugged on top of the system, we exploit it in a distributed graph-based RDF store.  ...  We address these issues by proposing a novel workload-adaptive streaming partitioner named WASP, that aims to achieve low-latency and high-throughput online graph queries.  ...  We use the WatDiv benchmark data generator to generate four datasets: WatDiv-1M, WatDiv-10M, WatDiv-100M, WatDiv-1B, varying from 1 million to 1 billion triples, respectively.  ... 
doi:10.1007/s41019-021-00156-2 fatcat:6eajdxuz3ra7lo3rvqhbse5eyy

Regular Path Query Evaluation on Streaming Graphs [article]

Anil Pacaci, Angela Bonifati, M. Tamer Özsu
2020 arXiv   pre-print
We focus on navigational queries that determine if there exists a path between two entities that satisfies a user-specified constraint.  ...  We study persistent query evaluation over streaming graphs, which is becoming increasingly important.  ...  Unlike existing streaming RDF benchmarks, Yago2s includes a rich schema (∼100 di erent labels) and allows us to represent the full set of queries listed in Table 2 .  ... 
arXiv:2004.02012v1 fatcat:733z3i5w6bcb5dx6rbhi2nd6eu

Evaluating Complex Queries on Streaming Graphs [article]

Anil Pacaci, Angela Bonifati, M. Tamer Özsu
2021 arXiv   pre-print
We study the problem of evaluating persistent queries over streaming graphs in a principled fashion. These queries need to be evaluated over unbounded and very high speed graph streams.  ...  Our implementation of a streaming graph query processor shows the feasibility of our approach and allows us to gauge the high performance gains obtained for query processing over streaming graphs.  ...  Streaming RDF benchmarks such as LSBench (https://code.google.com/archive/p/lsbench/) and Stream WatDiv [24] only focus on SPARQL v1.0 (thus not even including simple RPQs), and their workloads do not  ... 
arXiv:2101.12305v3 fatcat:llkibdijebfdvkohipbyu6gj24

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  
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.  ...  Triplestores are data management systems for storing and querying RDF data.  ...  The Waterloo SPARQL Diversity Test Suite (WatDiv) [2] provides a synthetic data generator that produces RDF data with a tunable structuredness value and a query generator.  ... 
doi:10.1145/3308558.3313556 dblp:conf/www/0001SCBMN19 fatcat:i6b2kx6xvndujgia5yoyhxmgai

Graph Generators: State of the Art and Open Challenges [article]

Angela Bonifati, Irena Holubová, Arnau Prat-Pérez, Sherif Sakr
2020 arXiv   pre-print
This survey provides a comprehensive overview of the state-of-the-art graph generators by focusing on those that are pertinent and suitable for several data-intensive tasks.  ...  Despite the disparate requirements of modern graph generators throughout these communities, we analyze them under a common umbrella, reaching out the functionalities, the practical usage, and their supported  ...  The Streamer component of this framework is designed to publish RDF streams from the various existing RDF benchmarks (e.g., BSBM, LUBM).  ... 
arXiv:2001.07906v1 fatcat:sp62i47pzzdtvjsi6watl63wpu

Bindings-Restricted Triple Pattern Fragments [chapter]

Olaf Hartig, Carlos Buil-Aranda
2016 Lecture Notes in Computer Science  
While a SPARQL endpoint enables users to query its RDF dataset by using the full potential of SPARQL, providing such a comparably complex functionality presents a serious challenge (the evaluation problem  ...  The Triple Pattern Fragment (TPF) interface is a recent proposal for reducing server load in Web-based approaches to execute SPARQL queries over public RDF datasets.  ...  Given such a request, the servlet internally generates a stream of data triples for the requested (brTPF) fragment and processes this stream in the same way as the TPF implementation processes the stream  ... 
doi:10.1007/978-3-319-48472-3_48 fatcat:6glsfnbfgjdkzofth3r5g6vxi4

brTPF: Bindings-Restricted Triple Pattern Fragments (Extended Preprint) [article]

Olaf Hartig, Carlos Buil-Aranda
2016 arXiv   pre-print
The Triple Pattern Fragment (TPF) interface is a recent proposal for reducing server load in Web-based approaches to execute SPARQL queries over public RDF datasets.  ...  in a join with the given intermediate result.  ...  Given such a request, the servlet internally generates a stream of data triples for the requested (brTPF) fragment and processes this stream in the same way as the TPF implementation processes the stream  ... 
arXiv:1608.08148v2 fatcat:dvgfgpteuzeuhmvt2m2ax7khom

GSmart: An Efficient SPARQL Query Engine Using Sparse Matrix Algebra – Full Version [article]

Yuedan Chen, M. Tamer Özsu, Guoqing Xiao, Zhuo Tang, Kenli Li
2021 arXiv   pre-print
Efficient execution of SPARQL queries over large RDF datasets is a topic of considerable interest due to increased use of RDF to encode data.  ...  Evaluations of gSmart on a CPU+GPU HPC architecture show execution time speedups of up to 46920.00x compared to the existing SPARQL query engines on a single node machine.  ...  WatDiv-100M with 109M triples is generated by the Stream WatDiv benchmark [5] . YAGO2 with 284M triples is extracted from Wikipedia 1 , Geonames 2 , and Word-Net 3 [24] .  ... 
arXiv:2106.14038v1 fatcat:2gogaelsxberbpbxv3kie2lacq

SMART-KG: Hybrid Shipping for SPARQL Querying on the Web

Amr Azzam, Javier D. Fernández, Maribel Acosta, Martin Beno, Axel Polleres
2020 Proceedings of The Web Conference 2020  
While Linked Data (LD) provides standards for publishing (RDF) and (SPARQL) querying Knowledge Graphs (KGs) on the Web, serving, accessing and processing such open, decentralized KGs is often practically  ...  In this paper we present smart-KG, a novel approach to share the load between servers and clients, while signicantly reducing data transfer volume, by combining TPF with shipping compressed KG partitions  ...  Family-Based Partitioning of RDF Graphs. RDF is a semistructured data model which typically does not prescribe a xed schema.  ... 
doi:10.1145/3366423.3380177 dblp:conf/www/AzzamFABP20 fatcat:irrxzpvodzgu3kogwnbwvlwcfy

Storage, Indexing, Query Processing, and Benchmarking in Centralized and Distributed RDF Engines: A Survey [article]

Waqas Ali, Muhammad Saleem, Bin Yao, Aidan Hogan, Axel-Cyrille Ngonga Ngomo
2020 arXiv   pre-print
., SPARQL or SQL) used for query execution is a crucial optimization component of the RDF storage solutions.  ...  This paper provides a comprehensive review of centralized and distributed RDF engines in terms of storage, indexing, language support, and query execution.  ...  Then the code generator unites the different steps into segments, after that all the segments are packaged for query into a stream. The master sends this stream to corresponding nodes in parallel.  ... 
arXiv:2009.10331v2 fatcat:ou4nctjyj5c6jbh4osclewj62e

S2RDF: RDF Querying with SPARQL on Spark [article]

Alexander Schätzle, Martin Przyjaciel-Zablocki, Simon Skilevic, Georg Lausen
2016 arXiv   pre-print
S2RDF achieves sub-second runtimes for majority of queries on a billion triples RDF graph.  ...  However, SPARQL query performance is a major challenge as these platforms are not designed for RDF processing from ground.  ...  in other existing RDF/SPARQL benchmarks.  ... 
arXiv:1512.07021v3 fatcat:b3inj3oy7nbetlppjndv7hl4s4

VEDAS: an efficient GPU alternative for store and query of large RDF data sets

Pisit Makpaisit, Chantana Chantrapornchai
2021 Journal of Big Data  
AbstractResource Description Framework (RDF) is commonly used as a standard for data interchange on the web. The collection of RDF data sets can form a large graph which consumes time to query.  ...  It achieves speedup 578.57 and 62.97 for LUBM benchmark when compared to RDF-3X and gStore. The analysis shows the query cases which can gain benefits from our approach.  ...  WatDiv [41] test suite and LUBM [42] are used as benchmarks. WatDiv is a SPARQL benchmark that has different query structures and workload sizes.  ... 
doi:10.1186/s40537-021-00513-y fatcat:5vrbzbnxbfcxrcanabbxdzgiqi

Robust query processing for linked data fragments

Lars Heling, Maribel Acosta, Axel-Cyrille Ngonga Ngomo, Muhammad Saleem, Ruben Verborgh
2022 Semantic Web Journal  
Then, we address robust query execution by proposing a new class of adaptive operators: Polymorphic Join Operators.  ...  We first focus on robust plan selection by proposing CROP, a query plan optimizer that explores the cost and robustness of alternative query plans.  ...  First, we use a synthetic RDF graph and benchmark queries from the Waterloo SPARQL Diversity Test Suite (WatDiv) [4] .  ... 
doi:10.3233/sw-212888 fatcat:zy3vkeufcjeoxfyb42bwz3gfvi

Compressed Indexes for Fast Search of Semantic Data [article]

Raffaele Perego, Giulio Ermanno Pibiri, Rossano Venturini
2019 arXiv   pre-print
The sheer increase in volume of RDF data demands efficient solutions for the triple indexing problem, that is devising a compressed data structure to compactly represent RDF triples by guaranteeing, at  ...  at the state-of-the-art, by taking 30 60 and speeding up query execution by a factor of 2 81X.  ...  benchmarks for RDF data.  ... 
arXiv:1904.07619v2 fatcat:w3cjaocagve3to3zqmad4gthsq

SPARQL2Flink: Evaluation of SPARQL Queries on Apache Flink

Oscar Ceballos, Carlos Alberto Ramírez Restrepo, María Constanza Pabón, Andres M. Castillo, Oscar Corcho
2021 Applied Sciences  
Several approaches have been developed in this context proposing the storage and querying of RDF data in a distributed fashion, mainly using the MapReduce Programming Model and Hadoop-based ecosystems.  ...  We use this formalization to provide a mapping to translate a SPARQL query to a Flink program.  ...  Other operators are not specified Algebra operators present in 17 WatDiv benchmark queries Dataset/RDF Graph load Loading using the Apache Flink readTextFile operator into a Dataset API.  ... 
doi:10.3390/app11157033 fatcat:kqtyvqp645bctbpriwhwb5qgxu
« Previous Showing results 1 — 15 out of 32 results