Indexing method for transitive relationships of Product information
- Authors
- Lee H.; Shim J.
- Issue Date
- Jan-2009
- Publisher
- IEEE
- Citation
- Proceedings - 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2008, pp 521 - 524
- Pages
- 4
- Journal Title
- Proceedings - 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2008
- Start Page
- 521
- End Page
- 524
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/14573
- DOI
- 10.1109/WIIAT.2008.190
- ISSN
- 0000-0000
- Abstract
- For successfully using a RDBMS as repository for the Product information, it is essential that the ontological query be processed efficiently and answered properly on RDBMS. The key point of well processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. Especially, the transitive relationships (i.e. ISA, component-of relationships, etc.) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. To processing the queries over transitive relationships, we suggest the efficient index using the numbering schemes. © 2008 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - 공과대학 > 소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.