Browse > Article

Efficient Processing of Transitive Closure Queries in Ontology using Graph Labeling  

Kim Jongnam (서울대학교 컴퓨터공학부)
Jung Junwon (서울대학교 컴퓨터공학부)
Min Kyeung-Sub (서울대학교 컴퓨터공학부)
Kim Hyoung-Joo (서울대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.32, no.5, 2005 , pp. 526-535 More about this Journal
Abstract
Ontology is a methodology on describing specific concepts and their relationships, and it is being considered important more and more as semantic web and variety of knowledge management systems are being highlighted. Ontology uses the relationships among concerts to represent some concrete semantics of specific concept. When we want to get some useful information from ontology, we severely have to process the transitive relationships because most of relationships among concepts represent transitivity. Technically, it causes recursive calls to process such transitive closure queries with heavy costs. This paper describes the efficient technique for processing transitive closure queries in ontology. To the purpose of it, we examine some approaches of current systems for transitive closure queries, and propose a technique by graph labeling scheme. Basically, we assume large size of ontology, and then we show that our approach gives relative efficiency in processing of transitive closure, queries.
Keywords
Ontology; Transitive relationship; Transitive closure; Labeling;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Karvounarakis, S. Alexaki, V. Christophides, D. Plexousakis, 'RQL: A Declarative Query Language for RDF,' Proceeding of International World Wide Web Conference 2002
2 Gene Ontology Next Generation(GONG) Project: http://gong.man.ac.uk/
3 J. Broekstra, A. Kampman, F.V. Harmelen. 'Sesame: An Architecture for Storing and Querying RDF Data and Schema Information,' Semantics for the WWW, 2001
4 ODP Project: http://www.dmoz.org
5 J. Kim, H.-J. Kim, 'Efficient Processing of Regular Path Joins using PID,' Information and Software Technology, 2002
6 I. Horrocks, S. Tobies, 'Optimisation of Terminological Reasoning,' Proceedings of International Workshop in Description Logics 2000
7 R. Agrawal, A. Borgida, H. V. Jagadish. 'Efficient Management of Transitive Relationships in Large Data and Knowledge Bases,' Proceedings of the ACM SIGMOD International Conference on the Management of Data, 1989:253-262   DOI
8 Chun Zhang, J. Naughton, D. DeWitt, Q. Luo, G. Lohman, On Supporting Containment Queries in Relational database Management Systems, SIGMOD, 2001   DOI   ScienceOn
9 Gene Ontology(GO) Consortium: http://www.geneontology.org
10 V. Christophides, G. Karvounarakis, D. Plexousakis. 'Optimizing Taxonomic Semantic Web Quries using Labeling Schemes,' Web Semantics: Science, Services, and Agents on the World Wide Web, Vol. 1(2), 2004: 207-228   DOI   ScienceOn
11 K. Wilkinson, C. Sayers, H. Kuno, D. Reynolds. 'Efficient RDF Storage and Retrieval in Jena2,' SWDB 2003
12 S. Alexaki, V. Christophides, G. Karvounarakis, D. Plexousakis. 'The lCS-FORTH RDFSuite: Managing Voluminous RDF Description Bases,' Semantic Web Workshop 2001
13 W3 Consortium (W3C): http://www.w3c.org