Sciweavers

25 search results - page 1 / 5
» Scalable join processing on very large RDF graphs
Sort
View
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 4 months ago
Scalable join processing on very large RDF graphs
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 addre...
Thomas Neumann, Gerhard Weikum
WWW
2010
ACM
13 years 11 months ago
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. A...
Medha Atre, Vineet Chaoji, Mohammed J. Zaki, James...
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 4 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
CIKM
2009
Springer
13 years 8 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
IV
2003
IEEE
183views Visualization» more  IV 2003»
13 years 9 months ago
Visualisation of RDF(S)-based Information
As Resource Description Framework (RDF) reaches maturity, there is an increasing need for tools that support it. A common and natural representation for RDF data is a directed lab...
Alexandru Telea, Flavius Frasincar, Geert-Jan Houb...