Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
15,310
Scalable join processing on very large rdf graphs
- In SIGMOD Conference
, 2009
"... With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addresses the resulting scalability problems. Recent prior work along these lines has focused on indexing and other physical-d ..."
Abstract
-
Cited by 84 (5 self)
- Add to MetaCart
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addresses the resulting scalability problems. Recent prior work along these lines has focused on indexing and other physical
Path query processing on very large rdf graphs
- In WebDB
, 2011
"... Finding the shortest path between two nodes in an RDF graph is a fundamental operation that allows to discover complex relationships between entities. In this paper we consider the path queries over graphs from a database perspective. We provide the full-fledge database solution to execute path quer ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
queries over very large RDF graphs. We present low-level techniques to speed-up shortest paths algorithms, and a robust method to estimate selectivities of path queries. We perform extended experiments on several large RDF collections, including the UniProt collection, demonstrating that our approach
Scalable SPARQL Querying of Large RDF Graphs
"... The generation of RDF data has accelerated to the point where many data sets need to be partitioned across multiple machines in order to achieve reasonable performance when querying the data. Although tremendous progress has been made in the Semantic Web community for achieving high performance data ..."
Abstract
-
Cited by 71 (1 self)
- Add to MetaCart
The generation of RDF data has accelerated to the point where many data sets need to be partitioned across multiple machines in order to achieve reasonable performance when querying the data. Although tremendous progress has been made in the Semantic Web community for achieving high performance
Random Indexing for Searching Large RDF Graphs
"... Querying large RDF spaces with traditional query languages such as SPARQL is challenging as it requires a familiarity with the structure of the RDF graph and the names (URIs) of its classes, properties and relevant individuals. In this paper, we propose a complementary approach based on Vector Space ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Querying large RDF spaces with traditional query languages such as SPARQL is challenging as it requires a familiarity with the structure of the RDF graph and the names (URIs) of its classes, properties and relevant individuals. In this paper, we propose a complementary approach based on Vector
Distributed Storage and Query of Large RDF Graphs
"... RDF tuples are the building blocks of the semantic web. As more data are expressed as RDF tuples, storage capabilities become important. The data set will become increasingly large such that it is necessary for data to be stored across multiple machines. Data set will be partitioned into smaller sub ..."
Abstract
- Add to MetaCart
RDF tuples are the building blocks of the semantic web. As more data are expressed as RDF tuples, storage capabilities become important. The data set will become increasingly large such that it is necessary for data to be stored across multiple machines. Data set will be partitioned into smaller
Random Indexing for Finding Similar Nodes within Large RDF Graphs
"... We propose an approach for searching large RDF graphs, using advanced vector space models, and in particular, Random Indexing (RI). We first generate documents from an RDF Graph, and then index them using RI in order to generate a semantic index, which is then used to find similarities between grap ..."
Abstract
- Add to MetaCart
We propose an approach for searching large RDF graphs, using advanced vector space models, and in particular, Random Indexing (RI). We first generate documents from an RDF Graph, and then index them using RI in order to generate a semantic index, which is then used to find similarities between
RDFPath: Path Query Processing on Large RDF Graphs with MapReduce
"... Abstract. The MapReduce programming model has gained traction in different application areas in recent years, ranging from the analysis of log files to the computation of the RDFS closure. Yet, for most users the MapReduce abstraction is too low-level since even simple computations have to be expres ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
to be expressed as Map and Reduce phases. In this paper we propose RDFPath, an expressive RDF path query language geared towards casual users that benefits from the scaling properties of the MapReduce framework by automatically transforming declarative path queries into MapReduce jobs. Our evaluation on a real
BitMat – Scalable Indexing and Querying of Large RDF Graphs (Technical Report)
"... The growing size of Semantic Web data expressed in the form of Resource Description Framework (RDF) has made it necessary to develop effective ways of storing this data to save space and to query it in a scalable manner. SPARQL – the query language for RDF data – closely follows SQL syntax. As a nat ..."
Abstract
- Add to MetaCart
. Although these approaches perform well for highly selective queries, for queries having low-selectivity triple patterns, scalability of the querying method and optimizations still remain a challenge. In this paper we present a new way of storing RDF graphs in run-length-encoded bit-vector format called Bit
Storage and Retrieval of Large RDF Graph Using Hadoop and MapReduce
"... Abstract. Handling huge amount of data scalably is a matter of concern for a long time. Same is true for semantic web data. Current semantic web frameworks lack this ability. In this paper, we describe a framework that we built using Hadoop 1 to store and retrieve large number of RDF 2 triples. We ..."
Abstract
- Add to MetaCart
Abstract. Handling huge amount of data scalably is a matter of concern for a long time. Same is true for semantic web data. Current semantic web frameworks lack this ability. In this paper, we describe a framework that we built using Hadoop 1 to store and retrieve large number of RDF 2 triples. We
BitPath – Label Order Constrained Reachability Queries for Large RDF Graphs
"... Abstract. In this paper we focus on the following constrained reachability problem over edge-labeled graphs like RDF – given source node x, destination node y, and a sequence of edge labels (a, b, c, d), is there a path between the two nodes such that the edge labels on the path satisfy a regular ex ..."
Abstract
- Add to MetaCart
Abstract. In this paper we focus on the following constrained reachability problem over edge-labeled graphs like RDF – given source node x, destination node y, and a sequence of edge labels (a, b, c, d), is there a path between the two nodes such that the edge labels on the path satisfy a regular
Results 1 - 10
of
15,310
