Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

LAWEB
2005
IEEE

favoriteEmaildiscussreport

147views Internet Technology» more LAWEB 2005»

Optimized Index Structures for Querying RDF from the Web

13 years 9 months ago

Optimized Index Structures for Querying RDF from the Web

Download sw.deri.org

Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for this task. However, current RDF database systems do not use optimized indexes, which results in a poor performance behavior for querying RDF. In this paper we describe optimized index structures for RDF, show how to process and evaluate queries based on the index structure, describe a lightweight adaptable implementation in Java, and provide a performance comparison with existing RDF databases.

Andreas Harth, Stefan Decker

Real-time Traffic

Human Computer Interaction | Index Structure | Internet Technology | LAWEB 2005 | RDF Database Systems | RDF Databases |

claim paper

Related Content

» Designing Indexing Structure for Discovering Relationships in RDF Graphs

» Index structures and algorithms for querying distributed RDF repositories

» PAGE A Distributed Infrastructure for Fostering RDFBased Interoperability

» Scaling RDF with time

» Efficiently querying rdf data in triple stores

» Matrix Bit loaded a scalable lightweight join query processor for RDF data

» Efficient Indices Using Graph Partitioning in RDF Triple Stores

» Hexastore sextuple indexing for semantic web data management

» Towards a scalable search and query engine for the web

Post Info
More Details (n/a)

Added	25 Jun 2010
Updated	25 Jun 2010
Type	Conference
Year	2005
Where	LAWEB
Authors	Andreas Harth, Stefan Decker

Comments (0)