Sciweavers

25 search results - page 2 / 5
» Scalable join processing on very large RDF graphs
Sort
View
SEMWEB
2010
Springer
13 years 2 months ago
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
Javier D. Fernández, Miguel A. Martí...
CIKM
2009
Springer
13 years 11 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
PVLDB
2010
174views more  PVLDB 2010»
13 years 3 months ago
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases
The RDF data model is gaining importance for applications in computational biology, knowledge sharing, and social communities. Recent work on RDF engines has focused on scalable p...
Thomas Neumann, Gerhard Weikum
WWW
2008
ACM
14 years 5 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
11 years 7 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu