We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level processing of web resources are enabled by underlying metadata described in RDF format. A typical application of RDF is to describe ontologies or dictionaries, but in such applications, the size of RDF data is large. As...

RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to reach. Even if the semantical gems hidden in the RDF/RDFS specification are precisely captured, as, for example, in the axiomatic formalizations currently available, the useabilty of RDF’s concepts and constraints is limited: RD...

This chapter provides an introduction to the RDF language as well as surveys the languages that can be used for querying RDF graphs. Then it reviews some of the languages that can be used for querying RDF and provides a comparison between these query languages.

Although RDF is considered the Semantic Web language, it may not be the only one. SOAP serialisation provides several advantages, especially if the Semantic Web is not just about providing meta data for existing web pages, but also about exchange of content that is machine-readable in the rst place. This paper discusses some problems with the RDF syntax and data model. RDF is compared to SOAP, ...

With the wide application of RDF(Resource Description Framework) data, the data volume grows rapidly. Therefore, RDF storage has become a hot research issue in data storage field currently. Distributed storage is an effective way to solve the storage and query of RDF data, and data partition is the premise of data distributed storage. In this paper we use graph clustering idea to realize the ef...

Reformulation-based query answering is a query processing technique aiming at answering queries under constraints. It consists of reformulating the query based on the constraints, so that evaluating the reformulated query directly against the data (i.e., without considering any more the constraints) produces the correct answer set. In this paper, we consider optimizing reformulation-based query...