Sciweavers

4 search results - page 1 / 1
» Efficient Processing of RDF Queries with Nested Optional Gra...
Sort
View
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 ...
VLDB
2005
ACM
87views Database» more  VLDB 2005»
13 years 10 months ago
An Efficient SQL-based RDF Querying Scheme
Devising a scheme for efficient and scalable querying of Resource Description Framework (RDF) data has been an active area of current research. However, most approaches define new...
Eugene Inseok Chong, Souripriya Das, George Eadon,...
WWW
2008
ACM
14 years 5 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
WWW
2008
ACM
14 years 5 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...