YARS2: A Federated Repository for Querying Graph Structured Data from the Web

335 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

gStore: Answering SPARQL Queries via Subgraph Matching (2011, background): “Existing RDF storage systems, such as Jena [23], Yars2 [11] and Sesame 2.0 [5], cannot work well in large RDF datasets (such as Yago dataset).”
The RDF-3X engine for scalable management of RDF data (2010, methodology): “The native YARS2 system [23] proposes exhaustive indexes of triples and all their embedded sub-triples (pairs and single values) in six separate B+-tree or hash indexes.”
A Distributed Graph Engine for Web Scale RDF Data (2013, background): “YARS2 [17], Virtuoso [15] and SHARD [29] hash partition triples across multiple machines and parallelize the query processing.”
Scalable SPARQL querying of large RDF graphs (2011, positive): “Those that are currently available, such as SHARD [27], YARS2 [19], and Virtuoso [26] generally hash partition triples across multiple machines, and parallelize access to these machines as much as possible at query time.”
RDF-3X: a RISC-style engine for RDF (2008, methodology): “The native YARS2 system [19] proposes exhaustive indexes of triples and all their embedded sub-triples (pairs and single values) in 6 separate B-tree or hash indexes.”
A Native and Adaptive Approach for Unified Processing of Linked Streams and Linked Data (2011, methodology): “A fair amount of work on storage and query processing for Linked Data is available, including Sesame [13], Jena [38], RISC-3X [28], YARS2 [23], and Oracle Database Semantic Technologies [16].”