25 search results - page 3 / 5 » Scalable indexing of RDF graphs for efficient join processin... |
SEMWEB
2010
Springer
13 years 3 months ago
2010
Springer
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...
VLDB
2005
ACM
13 years 11 months ago
2005
ACM
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...
CN
2010
13 years 5 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...