Filters








33 Hits in 5.9 sec

TriAD

Sairam Gurajada, Stephan Seufert, Iris Miliaraki, Martin Theobald
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
Our engine, coined "TriAD", combines joinahead pruning via a novel form of RDF graph summarization with a locality-based, horizontal partitioning of RDF triples into a gridlike, distributed index structure  ...  The multi-threaded and distributed execution of joins in TriAD is facilitated by an asynchronous Message Passing protocol which allows us to run multiple join operators along a query plan in a fully parallel  ...  Trinity.RDF [30] is the first distributed RDF engine that employs a custom communication protocol based on the Message Passing Interface (MPI) standard [6] .  ... 
doi:10.1145/2588555.2610511 dblp:conf/sigmod/GurajadaSMT14 fatcat:tejrebkzsnaa7nspnbmkmorqtm

A survey and experimental comparison of distributed SPARQL engines for very large RDF data

Ibrahim Abdelaziz, Razen Harbi, Zuhair Khayyat, Panos Kalnis
2017 Proceedings of the VLDB Endowment  
Distributed SPARQL engines promise to support very large RDF datasets by utilizing shared-nothing computer clusters.  ...  Some are based on distributed frameworks such as MapReduce; others implement proprietary distributed processing; and some rely on expensive preprocessing for data partitioning.  ...  The complexity of sophisticated partitioning schemes does not allow distributed RDF systems to process very large graphs in a timely manner.  ... 
doi:10.14778/3151106.3151109 fatcat:6m7iotec65cufebmm5jbali74q

Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

Razen Harbi, Ibrahim Abdelaziz, Panos Kalnis, Nikos Mamoulis, Yasser Ebrahim, Majed Sahli
2016 The VLDB journal  
In this paper, we propose AdPart, a distributed RDF system, which addresses the shortcomings of previous work.  ...  First, AdPart applies lightweight partitioning on the initial data, that distributes triples by hashing on their subjects; this renders its startup overhead low.  ...  Multiple join operators are executed concurrently by all workers, which communicate via an asynchronous message pass-ing protocol.  ... 
doi:10.1007/s00778-016-0420-y fatcat:gqpl575oczcjjh7xtertbm7bkm

Scalable Pattern Matching in Metadata Graphs via Constraint Checking [article]

Tahsin Reza, Hassan Halawa, Matei Ripeanu, Geoffrey Sanders, Roger Pearce
2020 arXiv   pre-print
We present an algorithmic pipeline that bases pattern matching on constraint checking.  ...  We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world  ...  TriAD [Gurajada et al. 2014 ] is distributed RDF [RDF 2017] engine, implemented in MPI, and based on an asynchronous distributed join algorithm which uses partitioned locality based indexing.  ... 
arXiv:1912.08453v2 fatcat:jrf3hcy6bnbcff6z256yefjowu

Adaptive Partitioning for Very Large RDF Data [article]

Razen Harbi, Ibrahim Abdelaziz, Panos Kalnis, Nikos Mamoulis, Yasser Ebrahim, Majed Sahli
2015 arXiv   pre-print
In this paper, we propose AdHash, a distributed RDF system, which addresses the shortcomings of previous work.  ...  This requires an expensive data preprocessing phase, leading to high startup costs for very large RDF knowledge bases.  ...  TriAD benefits from its asynchronous message passing and performs better than AdHash-NA in L, S, and F queries.  ... 
arXiv:1505.02728v1 fatcat:zfpc3evd2rb65kefnvqudrz7ge

DiploCloud: Efficient and Scalable Management of RDF Data in the Cloud

Marcin Wylot, Philippe Cudre-Mauroux
2016 IEEE Transactions on Knowledge and Data Engineering  
Despite recent advances in distributed RDF data management, processing large-amounts of RDF data in the cloud is still very challenging.  ...  In this paper, we describe DiploCloud, an efficient and scalable distributed RDF data management system for the cloud.  ...  Gurajada et al. propose a distributed shared-nothing RDF engine named TriAd [33] .  ... 
doi:10.1109/tkde.2015.2499202 fatcat:mxxfq3jxwbbwllpbrjpmag3tau

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
This paper provides a comprehensive review of centralized and distributed RDF engines in terms of storage, indexing, language support, and query execution.  ...  This massive adoption has paved the way for the development of various centralized and distributed RDF processing engines.  ...  Triple Asynchronous and Distributed (TriAD) [40] implements the main memory, master-slave, and shared-nothing architecture based on asynchronous Message Passing protocol.  ... 
arXiv:2009.10331v2 fatcat:ou4nctjyj5c6jbh4osclewj62e

A Survey of RDF Stores SPARQL Engines for Querying Knowledge Graphs [article]

Waqas Ali, Muhammad Saleem, Bin Yao, Aidan Hogan, Axel-Cyrille Ngonga Ngomo
2021 arXiv   pre-print
RDF has seen increased adoption in recent years, prompting the standardization of the SPARQL query language for RDF, and the development of local and distributed engines for processing SPARQL queries.  ...  While other reviews on this topic tend to focus on the distributed setting, the main focus of the work is on providing a comprehensive survey of state-of-the-art storage, indexing and query processing  ...  Various kinds of distributed RDF stores have thus been proposed [88, 104, 203, 204] that typically run on clusters of shared-nothing machines.  ... 
arXiv:2102.13027v4 fatcat:phontczhbfcvdjt5y75n3hfcge

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.  ...  We propose a representation consists of indices and column-based RDF ID data that can reduce the GPU memory requirement.  ...  In TriAD, the authors proposed the asynchronous shared-nothing message passing architecture for SPARQL query processing [14] . The approach partitions the RDF graph and distributes the portions.  ... 
doi:10.1186/s40537-021-00513-y fatcat:5vrbzbnxbfcxrcanabbxdzgiqi

S2RDF

Alexander Schätzle, Martin Przyjaciel-Zablocki, Simon Skilevic, Georg Lausen
2016 Proceedings of the VLDB Endowment  
In this paper, we introduce a novel relational partitioning schema for RDF data called ExtVP that uses a semi-join based preprocessing, akin to the concept of Join Indices in relational databases, to efficiently  ...  Thus, the ever-increasing size of RDF data collections raises the need for scalable distributed approaches.  ...  TriAD [12] uses an asynchronous Message Passing protocol for distributed join execution in combination with join-ahead pruning via RDF graph summarization.  ... 
doi:10.14778/2977797.2977806 fatcat:kehcu2c43rhczorh4nl7vkxlwu

S2RDF: RDF Querying with SPARQL on Spark [article]

Alexander Schätzle, Martin Przyjaciel-Zablocki, Simon Skilevic, Georg Lausen
2016 arXiv   pre-print
Yet, the ever-increasing size of RDF data collections makes it more and more infeasible to store and process them on a single machine, raising the need for distributed approaches.  ...  S2RDF achieves sub-second runtimes for majority of queries on a billion triples RDF graph.  ...  TriAD [16] uses an asynchronous Message Passing protocol for distributed join execution in combination with join-ahead pruning via RDF graph summarization.  ... 
arXiv:1512.07021v3 fatcat:b3inj3oy7nbetlppjndv7hl4s4

ABSTAT-HD: a scalable tool for profiling very large knowledge graphs

Renzo Arturo Alva Principe, Andrea Maurino, Matteo Palmonari, Michele Ciavotta, Blerina Spahiu
2021 The VLDB journal  
In this paper, we present ABSTAT-HD, a highly distributed profiling tool that supports users in profiling and understanding big and complex knowledge graphs.  ...  We demonstrate the impact of the new architecture of ABSTAT-HD by presenting a set of experiments that show its scalability with respect to three dimensions of the data to be processed: size, complexity  ...  Similarly to [51] also Triple Asynchronous and Distributed (TriAD) [23] uses graph-exploration strategies based on Message Passing.  ... 
doi:10.1007/s00778-021-00704-2 fatcat:eue2ppldrnfr5aip3xrv7ttnpy

Distributed querying of large labeled graphs [article]

Sairam Gurajada, Universität Des Saarlandes, Universität Des Saarlandes
2017
In this thesis, we advance the state-of-the-art for the following query models, and propose a distributed solution to process them in an e cient and scalable manner. 2  ...  Because of its versitality, graphs have been adapted into several di erent forms and one such adaption with many practical applications is the "Labeled Graph", where vertices and edges are labeled.  ...  Acknowledgements We implemented our approach in TriAD RDF engine (discussed in Chapter 4) . We used GCC-4. 7 .3 with -O3 optimization and MPICH2-1.4.1 and Boost-1.55 as external libraries.  ... 
doi:10.22028/d291-26695 fatcat:emcbwfkycja3jfnebwfy64rwum

Accelerating SPARQL Queries and Analytics on RDF Data Dissertation by EXAMINATION COMMITTEE

Razen Al-Harbi, Razen Al-Harbi
2016 unpublished
This dissertation tackles the problem of accelerating SPARQL queries and RDF analytics on distributed shared-nothing RDF systems. First, a distributed RDF engine , coined AdPart, is introduced.  ...  Accelerating SPARQL Queries and Analytics on RDF Data Razen Mohammad Al-Harbi The complexity of SPARQL queries and RDF applications poses great challenges on distributed RDF management systems.  ...  This dissertation tackles the problem of accelerating SPARQL queries and RDF analytics on distributed shared-nothing RDF systems. First, a distributed RDF engine, coined AdPart, is introduced.  ... 
fatcat:6dfkuah4wzdo3hq7zc3lxdjqea

Evaluation of Distributed Semantic Databases

Philipp Trucksäß, Chair Of Network Architectures
2018
In this paper, several implementations of RDF data stores are compared, analyzing their unique innovations and evaluating their benefits and shortcomings for various applications.  ...  [3] , the TriAD (for "Triple Asynchronous Distributed") RDF engine puts a strong focus on parallelization as its shared-nothing architecture enables several nodes in a cluster, as well as several cores  ...  The essential proposition to enable this high level of scalability is TriAD's custom asynchronous message passing protocol, which allows strongly multithreaded query execution without a big synchronization  ... 
doi:10.2313/net-2018-11-1_11 fatcat:atr6jvkygbftzcffv2pd6cubvu
« Previous Showing results 1 — 15 out of 33 results