Filters








5,825 Hits in 5.0 sec

RDFPath: Path Query Processing on Large RDF Graphs with MapReduce [chapter]

Martin Przyjaciel-Zablocki, Alexander Schätzle, Thomas Hornung, Georg Lausen
2012 Lecture Notes in Computer Science  
Our evaluation on a real world data set shows the applicability of RDFPath for investigating typical graph properties like shortest paths.  ...  path queries into MapReduce jobs.  ...  on large RDF graphs.  ... 
doi:10.1007/978-3-642-25953-1_5 fatcat:mipqj26aezfilgn2vizoxxvzui

Querying RDF Data from a Graph Database Perspective [chapter]

Renzo Angles, Claudio Gutierrez
2005 Lecture Notes in Computer Science  
We concentrate on query languages, analyze current RDF trends, and propose the incorporation to RDF query languages of primitives which are not present today, based on the experience and techniques of  ...  From this point of view it is compared with other database models, particularly with graph database models, which are very close in motivations and use cases to RDF.  ...  In graph databases where the number of nodes is very large (e.g. the Web) it is useful to subdivide the domain of evaluation by selecting subsets of the domain on the base of some criteria.  ... 
doi:10.1007/11431053_24 fatcat:gia7gzrs2jhjdlecw3vvexop6y

HPRD: A High Performance RDF Database [chapter]

Liu Baolin, Hu Bo
2007 Lecture Notes in Computer Science  
Triple index manages basic RDF triples by dividing original RDF graph into several sub-graphs. Path index manages frequent RDF path patterns for long path query performance enhancement.  ...  In this paper, we describe the organization of index structures, show the process of evaluating queries based on the index structures, and provide a performance comparison with exist RDF databases through  ...  As each triple pattern derives to a very large result set, join on triple index is not efficient for this type of query.  ... 
doi:10.1007/978-3-540-74784-0_37 fatcat:ukgmzvd23zexti3r65m3u7xcte

HPRD: a high performance RDF database

Baolin Liu, Bo Hu
2010 International Journal of Parallel, Emergent and Distributed Systems  
Triple index manages basic RDF triples by dividing original RDF graph into several sub-graphs. Path index manages frequent RDF path patterns for long path query performance enhancement.  ...  In this paper, we describe the organization of index structures, show the process of evaluating queries based on the index structures, and provide a performance comparison with exist RDF databases through  ...  As each triple pattern derives to a very large result set, join on triple index is not efficient for this type of query.  ... 
doi:10.1080/17445760802431839 fatcat:t24bxb45dvbepir63rga7uj6fu

RP-Filter: A Path-Based Triple Filtering Method for Efficient SPARQL Query Processing [chapter]

Kisung Kim, Bongki Moon, Hyoung-Joo Kim
2012 Lecture Notes in Computer Science  
Currently, most RDF databases store RDF data in a relational table called triple table and carry out several join operations on the triple tables for SPARQL query processing.  ...  RP-Filter exploits the path information in the query graphs and filters the triples which would not be included in final results in advance of joins.  ...  Experimental Results We implemented RP-Filter on the open-source system RDF-3X(0.3.5 version). The system was implemented with C++ and compiled by g++ with -O3 flag.  ... 
doi:10.1007/978-3-642-29923-0_3 fatcat:bxqyzzolyvfotpvfeerbxszkya

Enabling graph appliance for genome assembly

Rina Singh, Jeffrey A. Graves, Sangkeun Lee, Sreenivas R. Sukumar, Mallikarjun Shankar
2015 2015 IEEE International Conference on Big Data (Big Data)  
In this paper, we address the issues involved in representing de Bruin graphs as RDF graphs and propose an iterative querying approach for searching cycles to find Eulerian paths in large RDF graphs.  ...  However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery.  ...  And so, even for relatively small graphs, the query generated becomes very large.  ... 
doi:10.1109/bigdata.2015.7364056 dblp:conf/bigdataconf/SinghGLSS15 fatcat:j2rbjnyvfnavjnghp6k2hwnicm

Top-K Shortest Paths in Large Typed RDF Datasets Challenge [chapter]

Ioannis Papadakis, Michalis Stefanidakis, Phivos Mylonas, Brigitte Endres Niggemeyer, Spyridon Kazanas
2016 Communications in Computer and Information Science  
In this paper, we present the Top-k Shortest Paths in large typed RDF Datasets Challenge the highlights the key aspects of property path queries that employ the Kleene star operator.  ...  SPARQL queries that are agnostic of the underlying RDF graph structure.  ...  Property path queries can be seen as regular expressions over paths between two nodes in the RDF graph.  ... 
doi:10.1007/978-3-319-46565-4_15 fatcat:n4llby6zzfbrbadbobnuhvad3y

An Efficient Distributed SPARQL Query Processing Scheme Considering Communication Costs in Spark Environments

Jongtae Lim, Byounghoon Kim, Hyeonbyeong Lee, Dojin Choi, Kyoungsoo Bok, Jaesoo Yoo
2021 Applied Sciences  
Various distributed processing schemes were studied to efficiently utilize a large scale of RDF graph in semantic web services.  ...  We divide a SPARQL query into several subqueries using a WHERE clause to process a query of an RDF graph stored in a distributed environment.  ...  Moreover, performance degradation occurs when a large scale of RDF graph is queried and processed [18] [19] [20] [21] [22] [23] [24] .  ... 
doi:10.3390/app12010122 fatcat:4hsznk3q4rbk3htluwtlv6ox2y

A distributed graph approach for pre-processing linked RDF data using supercomputers

Michael J. Lewis, George K. Thiruvathukal, Venkatram Vishwanath, Michael E. Papka, Andrew Johnson
2017 Proceedings of The International Workshop on Semantic Big Data - SBD '17  
E cient RDF, graph based queries are becoming more pertinent based on the increased interest in data analytics and its intersection with large, unstructured but connected data.  ...  Many commercial systems have adopted distributed RDF graph systems in order to handle increasing dataset sizes and complex queries.  ...  Each chief governs their realm (graph) of linked RDF data. Mantona pre-processes RDF data in the form of paths within the RDF-graph.  ... 
doi:10.1145/3066911.3066913 dblp:conf/sigmod/LewisTVPJ17 fatcat:6bbt45nsdrfthf4hgyvfhbsnsu

Distributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1 [article]

Sairam Gurajada, Martin Theobald
2016 arXiv   pre-print
., distributed, processing of this kind of queries over very large RDF collections, we develop a suitable partitioning and indexing scheme, which allows us to shard the RDF triples over an entire cluster  ...  of compute nodes and to process an incoming SPARQL query over all of the relevant graph partitions (and thus compute nodes) in parallel.  ...  scale-out in processing SPARQL 1.1 queries with property paths over a number of large RDF collections.  ... 
arXiv:1609.05293v2 fatcat:d5dvgojzfzajro3knlrt4pcnti

Scalable SPARQL querying using path partitioning

Buwen Wu, Yongluan Zhou, Pingpeng Yuan, Ling Liu, Hai Jin
2015 2015 IEEE 31st International Conference on Data Engineering  
query processing over big RDF graphs.  ...  Q11 and Q12 are one-hop chain queries and hence are also inner-partition queries. But they are not very selective and hence each local engine has to process a large amount of data.  ... 
doi:10.1109/icde.2015.7113334 dblp:conf/icde/WuZYLJ15 fatcat:pqm7hvxuyrdthhkxyuqvkcwcmy

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

Alfredo Cuzzocrea, Mirel Cosulschi, Roberto de Virgilio
2016 Algorithms  
When RDF graphs are defined on top of big (Web) data, they lead to the so-called large-scale RDF graphs, which reasonably populate the next-generation Semantic Web.  ...  In line with this trend, in this paper, we present an approach for efficiently implementing traversals of large-scale RDF graphs over MapReduce that is based on the Breadth First Search (BFS) strategy  ...  [61] addresses the problem of supporting SPARQL queries over very large RDF datasets via mapping SPARQL statements over PigLatin [62] programs.  ... 
doi:10.3390/a9010007 fatcat:wxorzsnnovbjvpnoc4prrucnty

STLIS: A Scalable Two-Level Index Scheme for Big Data in IoT

Yonglin Leng, Zhikui Chen, Yueming Hu
2016 Mobile Information Systems  
In the first level, we devise a compressed path template tree (CPTT) index based on S-tree to retrieve the candidate sets of full path.  ...  For the large-scale RDF data, most of them suffer from a large number of self-joins, high storage cost, and many intermediate results.  ...  The candidate set of full paths becomes very large, which would increase the query time.  ... 
doi:10.1155/2016/5341797 fatcat:nsuwkztbqrdslm6vdbwvfqnqju

R3F: RDF triple filtering method for efficient SPARQL query processing

Kisung Kim, Bongki Moon, Hyoung-Joo Kim
2013 World wide web (Bussum)  
With the rapid growth in the amount of graph-structured Resource Description Framework (RDF) data, SPARQL query processing has received significant attention.  ...  Through comprehensive experiments on large-scale RDF datasets, we demonstrate that R3F can effectively and efficiently reduce the number of redundant intermediate results and improve the query performance  ...  And some of queries have no results. These queries tend to be processed quicker than queries with results, and RDF-3X process these queries very fast.  ... 
doi:10.1007/s11280-013-0253-1 fatcat:pqi4li4yrnbhlfvqjf4y6lpese

Distributed real-time knowledge graph serving

Liang He, Bin Shao, Yatao Li, Enhong Chen
2015 2015 International Conference on Big Data and Smart Computing (BIGCOMP)  
This paper presents our efforts of serving real-world knowledge graphs at scale for real-time query processing.  ...  On the one hand, we have a revolutionary way of piling knowledge up; on the other hand, the technology of making the knowledge graph accessible, i.e. how to serve the knowledge to support real-life applications  ...  The SPARQL query execution process is essentially a subgraph matching process on a knowledge graph. Serving a large knowledge graph is never an easy task.  ... 
doi:10.1109/35021bigcomp.2015.7072810 dblp:conf/bigcomp/HeSLC15 fatcat:dhhfscozb5h6za62ulgwaaxmle
« Previous Showing results 1 — 15 out of 5,825 results