Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Design of Storage Structure for Path-Based Query on RDF and RDF Schema YounHee KIM ByungGon KIM HaeChull LIM Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E89-A No.6 pp.1733-1735 Publication Date: 2006/06/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e89-a.6.1733 Print ISSN: 0916-8508 Type of Manuscript: Special Section LETTER (Special Section on Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2005)) Category: Keyword: RDF, RDF Schema, path-based query, storage, Full Text: PDF(522.4KB)>>
Summary: In the Semantic Web, metadata and ontology for representing semantics and conceptual relationships of information resources are essential factors. RDF and RDF Schema are the W3C standard models for describing metadata and ontology. In this paper, we focus on a result of analyzing available query patterns considering both RDF and RDF Schema. And we propose a structure to store and query using path information in graph models of RDF and RDF Schema. The proposed structure supports whole query patterns fairly. We can retrieve entities that are reached from a certain class, property, resource, or literal in RDF and RDF Schema without a loss of performance because of multiple joins with tables. And, through encoding schemes, we determine easily hierarchical relationships between classes or properties. | ||||||||||
| ||||||||||
