Filters








132 Hits in 4.2 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  ...  We believe that our architecture provides a so far unique approach to join-ahead pruning in a distributed environment, as the more classical form of sideways information passing would not permit for executing  ...  graph summarization to facilitate join-ahead pruning in a distributed environment.  ... 
doi:10.1145/2588555.2610511 dblp:conf/sigmod/GurajadaSMT14 fatcat:tejrebkzsnaa7nspnbmkmorqtm

Fast and Concurrent RDF Queries with RDMA-Based Distributed Graph Exploration

Jiaxin Shi, Youyang Yao, Rong Chen, Haibo Chen, Feifei Li
2016 USENIX Symposium on Operating Systems Design and Implementation  
Many public knowledge bases are represented and stored as RDF graphs, where users can issue structured queries on such graphs using SPARQL.  ...  We present Wukong 1 , a distributed graph-based RDF store that leverages RDMA-based graph exploration to provide highly concurrent and low-latency queries over large data sets.  ...  Conclusion This paper describes Wukong, a distributed in-memory RDF store that leverages RDMA-based graph exploration to support fast and concurrent SPARQL queries.  ... 
dblp:conf/osdi/ShiYCCL16 fatcat:iszwak734zag5klwqpviy3vyp4

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.  ...  In this paper, we present a survey of 22 state-of-the-art systems that cover the entire spectrum of distributed RDF data processing and categorize them by several characteristics.  ...  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

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
To keep the survey self-contained, we also provide a short discussion on graph partitioning techniques used in the distributed setting.  ...  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.  ...  For basic graph pattern queries, a variant of Leapfrog-Trie Join is implemented, offering worst-case optimal joins. A.2 Distributed RDF Engines We now survey distributed RDF stores.  ... 
arXiv:2102.13027v4 fatcat:phontczhbfcvdjt5y75n3hfcge

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
The type of indexing approach used in RDF engines is critical for fast data lookup.  ...  This paper provides a comprehensive review of centralized and distributed RDF engines in terms of storage, indexing, language support, and query execution.  ...  It implements a graph summarization approach for data storage and to facilitate join-ahead pruning in a distributed environment. It creates indexes both at master and slave nodes.  ... 
arXiv:2009.10331v2 fatcat:ou4nctjyj5c6jbh4osclewj62e

Scalable Multi-query Optimization for SPARQL

Wangchao Le, Anastasios Kementsietsidis, Songyun Duan, Feifei Li
2012 2012 IEEE 28th International Conference on Data Engineering  
We show that the techniques developed for relational and semi-structured data/query languages are hard, if not impossible, to be extended to account for RDF data model and graph query patterns expressed  ...  This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL.  ...  The assignment of labels on linegraph edges captures these four join types (useful for pruning and will become clear shortly).  ... 
doi:10.1109/icde.2012.37 dblp:conf/icde/LeKDL12 fatcat:pbxaeplytrhgfkxpq2zt5lmzlq

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.  ...  State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation.  ...  We compare to TriAD and TriAD-SG; the former uses lightweight hash partitioning while the later uses graph summaries for join-ahead pruning.  ... 
doi:10.1007/s00778-016-0420-y fatcat:gqpl575oczcjjh7xtertbm7bkm

Robust Runtime Optimization and Skew-Resistant Execution of Analytical SPARQL Queries on Pig [chapter]

Spyros Kotoulas, Jacopo Urbani, Peter Boncz, Peter Mika
2012 Lecture Notes in Computer Science  
case of data analysis using RDF data crawled from the web.  ...  This system is designed to work efficiently on complex queries with many self-joins over huge datasets, avoiding job failures even in the case of joins with unexpected high-value skew.  ...  In this work, for the first time, it has been shown that MapReduce is suited for very large-scale analytical processing of RDF graphs and it is, in fact, better suited than a traditional RDF store in a  ... 
doi:10.1007/978-3-642-35176-1_16 fatcat:bkrhd4o36jfnnnm7iuiebaqtm4

An Adaptive Framework for RDF Stream Processing [chapter]

Qiong Li, Xiaowang Zhang, Zhiyong Feng
2017 Lecture Notes in Computer Science  
In this paper, we propose a novel framework for RDF stream processing named PRSP.  ...  Moreover, taking advantage of PRSP, we can process large-scale RDF streams in a distributed context via distributed SPARQL engines, such as gStoreD and TriAD.  ...  TriAD combines join-ahead pruning by using a novel form of RDF graph summarization with a locality-based, horizontal partitioning of RDF triples into a grid-like, i.e., distributed index structure.  ... 
doi:10.1007/978-3-319-63579-8_33 fatcat:cdktyyc4mfdinhhub4r4bkrx3q

Dominance-Partitioned Subgraph Matching on Large RDF Graph

Bo Ning, Yunhao Sun, Deji Zhao, Weikang Xing, Guanyu Li
2020 Complexity  
However, traditional edge-cutting strategy destroys the structure of indivisible knowledge in a large RDF graph.  ...  Subgraph matching on a large graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including question answering and community detection.  ...  TriAD [4] combined join-ahead pruning via the form of RDF graph summarization with a locality-based horizontal partitioning of RDF triples into a grid-like distributed index structure.  ... 
doi:10.1155/2020/6620528 doaj:676088f7fa6049848ac62a7560213cdd fatcat:ghmahuzvlfgerjjxdsmqs6ydsm

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.  ...  Distributed RDF systems partition data across multiple computer nodes (workers).  ...  SHARD and HadoopRDF solve SPARQL queries using a set of MapReduce iterations. Trinity.RDF [37] is a distributed in-memory RDF engine that can handle web scale RDF data.  ... 
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  
Sharding such data using classical techniques or partitioning the graph using traditional min-cut algorithms leads to very inefficient distributed operations and to a high number of joins.  ...  In this paper, we describe DiploCloud, an efficient and scalable distributed RDF data management system for the cloud.  ...  The system combines join-ahead pruning via RDF graph summarization with a locality-based, horizontal partitioning of the triples into a grid-like, distributed index structure.  ... 
doi:10.1109/tkde.2015.2499202 fatcat:mxxfq3jxwbbwllpbrjpmag3tau

Querying a messy web of data with Avalanche

Cosmin Başca, Abraham Bernstein
2014 Journal of Web Semantics  
For instance, Yars2 [17] is an endto-end semantic search engine that uses a graph model to interactively answer queries over semi-structured interlinked data, collected from disparate Web sources.  ...  This approach allows searching for and joining potentially distributed data sources.  ...  materialize(bgp) This operator is necessary when distributed joins are executed in a common ID space used by the remote endpoints to index RDF data-sets.  ... 
doi:10.1016/j.websem.2014.04.002 fatcat:gxuxfdkpmnc3tcf4st34o7u3qy

Knowledge Graphs for Processing Scientific Data: Challenges and Prospects [article]

Masoud Salehpour, Joseph G. Davis
2020 arXiv   pre-print
There is growing interest in the use of Knowledge Graphs (KGs) for the representation, exchange, and reuse of scientific data.  ...  In this paper, we studied the performance of some of the major DMSs in the context of querying KGs with the goal of providing a finely-grained, comparative analysis of DMSs representing each of the four  ...  However, RDF-3X's query optimization relies on join ordering using dynamic programming for plan enumeration with a statistics-based cost model.  ... 
arXiv:2004.06203v1 fatcat:szmdrcpo3ncjnf43o4l7prcnyy

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  ...  RDF has become very popular for semantic data publishing due to its flexible and universal graph-like data model.  ...  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
« Previous Showing results 1 — 15 out of 132 results