• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.82-84
• /
• 2005

시맨틱 웹의 등장에 따라 RDF와 RDF Schema(RDF/RDFS)로 표현되는 웹 데이타의 양이 증가하고 있다. 이에 웹 데이타를 효율적으로 저장, 검색할 수 있는 인덱스 구조의 필요성이 높아지고 있다. 본 연구에서는 기존의 트리 모델을 위한 소수 레이블 기법(prime number labeling scheme)을 발전시켜, RDF/RDFS 인덱스 구조를 표현할 수 있는 그래프 모델을 위한 소수 레이블 기법을 제안한다. 제안한 기법은 기존의 소수 레이블 기법을 그래프에 적용하여 구조 질의(Structural Query)를 효율적으로 처리할 수 있고, 데이타 갱신 시에 인덱스를 재구성하지 않아도 되는 장점을 가지고 있다. 그리고 이전의 RDF/RDFS 인덱스 구조에서 효율적으로 처리하기 힘들었던 순환 방향성 그래프에 대한 질의도 쉴게 처리할 수 있다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.1
• /
• pp.57-62
• /
• 2010

This paper proposes two methods for the construction of job offer and job hunting information in order to supply an environment that can easily connects to job hunting information. First, the database expansion, category rules and ERD(Entity Relation Diagram) are designed for the construction of job hunting site with real example. Second, the prime number labeling rules are designed for the strong intimacy of label rules. Therefore, according to using the systematic and regular rules when we design and construct a database, the consistency and efficiency are improved in the database being constructed and being operated. And the convenience of application program development and operation are easily provided. In addition, the proposed code-expansion rule can be defined and be standardized in the domestic and foreign job offer and job hunting information provision agency.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.3
• /
• pp.25-35
• /
• 2011

In the Semantic Web, storage models are required to efficiently store and retrieve metadata and ontology represented using OWL that can provide expressive power and reasoning support. In this paper, we propose an OWL storage model that can store and retrieve many restrictions and semantic relations defined on ontology with metadata. In addition, we propose some methods and rules to improve query processing efficiency of the proposed storage model. The proposed storage model can store and process large amounts of ontology and metadata because it consists of tables based on the relational database. And the proposed model can quickly provide more accurate results to users because of performing two different types of ontology reasoning and using the prime number labeling scheme to easily identify hierarchy relationships between classes or properties. The comparative evaluation results show that our storage model provides better performance than the existing storage model.